Y

@YSS

P

C
3 months ago
#include <stdio.h> void swap(int *a,int *b) { int k = *a; *a = *b; *b = k; } int main() {

O

C
3 months ago
#include <stdio.h> int main() { x0:int A = 0; x1:printf("Hello world!\n"); x2:A++; x3:if (A < 5) {goto x1;} return 0; }

O

Python
3 months ago
def Ac(Ec): Ic = 1 while Ic < Ec and (Ic == 1 or Ec % Ic != 0): Ic += 1 return Ic def Bac(Bec): C = Bec R = [] while C != 1: R.append(Ac(C))

最大約数でClojure

Clojure
3 months ago
(def a (atom 114514)) (def p (atom 114513)) (def e (atom 0)) (while (not= 0 (rem @a @p)) (reset! p (- @p 1)) ) (while (not= @a (* @e @p)) (reset! e (+ @e 1)) ) (println @a)

O

C
3 months ago
#include <stdio.h> #include <stdbool.h> // P を先に宣言 void P(int *a); int main() { int a = 0; bool n = true;

O

C
3 months ago
#include <stdio.h> #include <stdbool.h> #include <math.h> #include <stdlib.h> bool Rose(int Q, int A) { int *t = malloc(3 * sizeof(int));; t[0] = ((int)pow(3 + Q - A, 1) % 3 + (int)pow(3 - Q + A, 1)) % 3; t[1] = ((int)pow(3 + Q - A, 2) %

O

Python
3 months ago
Rose=lambda Q,A:( (((3+Q-A)**1)%3)+ (((3+Q-A)**2)%3)+ (((3+Q-A)**3)%3)+ (((3+Q-A)**4)%3) != A) J = 0 while Rose(1,J): J += 1 print(J)

K

Python
3 months ago
Rose=lambda Q,A:( (((14+Q-A)**5)%14)+(((14-Q+A)**5)%14)+ (((7+Q-A)**4)%7)+(((7-Q+A)**4)%7)+ (((6+Q-A)**3)%6)+(((6-Q+A)**3)%6)+ (((3+Q-A)**2)%3)+(((3-Q+A)**2)%3)+ (((2+Q-A)**1)%2)+(((2-Q+A)**1)%2) != A) J = 0 while Rose(1,J):

O

Python
3 months ago
import random # 正しく8×8×(list)を作る Q = [[0 for _ in range(8)] for _ in range(8)] K = [[list(range(16)) for _ in range(16)] for _ in range(8)] N = [[[random.randint(0, 15)] for _ in range(8)] for _ in range(8)] def reward(action, prediction): ret

O

Python
3 months ago
import numpy as np import random # 状態数と行動数 n_state = 60 n_action = 50 # Qテーブル Q = np.zeros((n_state, n_action))

O

C
3 months ago
#include <stdio.h> void P(int *x,int y){ *x += y; } int main() { int A = 5; printf("%d!\n",A);

O

Go
3 months ago
package main import "fmt" func main() { A := [5]float64{0, 1, 0, 0, 0} loop: A[4] = 0

O

Python
3 months ago
A = [3,2,5] B = 0 C = 0 while(B<2): if (A[B] > A[B+1]): A[B],A[B+1] = A[B+1],A[B] B=0 B+=1 print(A)

I

Python
3 months ago
class OOOO: def __init__(self, params): self._params = params def K(self): pass def L(self, f, G): f(G) class OOO(OOOO):

O

Java
3 months ago
import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static void main(String[] args) { var a = 0; while (true) { System.out.println("Hello

O

C++
3 months ago
#include <iostream> void Puts(const char* k) { std::cout << k << std::endl; } class cell { private: int X; int Y; int A[16][16] = {

O

C++
3 months ago
#include <iostream> class Robot { private: int sc; int save; public: Robot() { sc = 0;save = 0;} void P() {sc++;} void D() {sc--;}

O

C++
3 months ago
#include <iostream> class Robot { private: int sc; int save; public: Robot() { sc = 0;save = 0;} void P() {sc++;} void D() {sc--;}

C

C
3 months ago
#include <stdio.h> void swap(int *A,int *B) { int swaper = *A; *A = *B; *B = swaper; } int main() { int X = 0; int Y[] = {1,1,4,5,1,4}; loop:

S

C
3 months ago
#include <stdio.h> void swap(int *A,int *B) { int swaper = *A; *A = *B; *B = swaper; } int main() { int X = 3; int Y = 2; printf("%d %d\n",X,Y);