@YSS

def name(params): Q = params T = 0 for S in Q: if S > T: T = S G = [0]*(T+1) for S in Q: G[S] += 1 return G

class sell { #table = []; push() { this.#table[this.#table.length] = [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,]; } write(A,B) { this.#table[A[0]][A[1]]=B; } get(A) { return this.#table[A[0]][A[1]]

def name(params): k = 0 for A in params: if A > k: k = A return k print(name([1,2,1,3]))

#include <stdio.h> int f(int x) { return x*x; } int main() { printf("%d\n",(f(3)-f(2))); return 0; }

#include <stdio.h> typedef struct { char *name; int age; } box; int main() { box A; A.name = "Aho"; A.age = 12; printf("%d\n",A.age);

#include <stdio.h> #include <stdlib.h> int main() { int *LET = malloc(2*sizeof(int)); while (*(LET + 1) < 5) { printf("Hello world!\n"); *(LET+1) += 1; } free(LET); return 0;

def name(g): params = g for K in params: for S in params: if S > K: params[params.index(S)],params[params.index(K)]=params[params.index(K)],params[params.index(S)] return params print(name([1,2,1,3]))

def O(f,x): K = lambda A,B=f,C=x: B(C,A) return K print(O(O,(lambda A,B:B+A))(1)(1))

lambda x:x+1 class name: def __init__(self): self.__list = {} def DEF(self,R): self.__list[R] = len(self.__list) def get(self,R): return self.__list[R] def MOVE(self,R,L):

using System; namespace chinpoko { class Program { public static void Main(string[] args) { int gold_ball = 0; while (gold_ball < 5) { Console.WriteLine("Hello world!"); gold_ball+

g = 20 G = g izaberu = 0 while g > 1: if g % 3 == 0: g -= 2 elif g % 2 == 0: g += 1 izaberu -= 1

def aho(papa) i = 0 k = 0 l = [] lp = [] while i < papa.length if papa[i] == "+" k += 1 elsif papa[i] == "-"

A = 0 B = 0 while True: try: print("hello world") A += 1 if A > 5: raise ValueError("") except: A = 0

class numbar: def __init__(self, num): self.__age = num def get(self): return self.__age class ECHO: def __init__(self,wen): print(wen,end="") class Set: def __init__(self):

#include <stdio.h> #define q(f,x) f(f(f(f(x)))) #define qw(f,h,x) f(h,f(h,f(h,f(h,x)))) #define qwe(f,i,h,x) f(i,h,f(i,h,f(i,h,f(i,h,x)))) void aho() { printf("\n"); } char *Po(char *r) {

def name(params): P = 0 for T in range(len(params)): if P < params[T]: P = params[T] J = [0]*(P+1) for Q in range(len(params)): J[params[Q]] += 1 return J print(name([1,2,1,0,1,

G = [1,2,1,3] for B in range(len(G)): for A in range(len(G)-1): if G[A] < G[B]: G[A],G[B] = G[B],G[A] print(G)

let P = 1; while (P < 121) { if (P == 1) { console.log(P+"->x"); } else if (P % 2 == 0 && P != 2) { console.log(P+"->x"); } else if (P % 3 == 0 && P != 3) { console.log(P+"->x"); } else if (P % 5 == 0 && P !=

def VM(code): A = 0 J = lambda f,x:f(x) T = 0 flag = 0 loop=[] fx = [lambda x:x+1,0] FX = [lambda x:x+1, lambda x:x-1, lambda x:x*2,lambda x:x/2] memor=0 while A < len(code):

class func: def __init__(self, params): self.params = params def Go(self, f): condition = 0 self.params = f(self.params) def get(self): k = self.params self.params = None return k