@YSS

print('Hello world!') def name(params): x = 0 y = 0 z = 0 xy = None while params[y][x] != 3: for A in params[y]: if A == 1: break

def log(A,B,C): th3=0 th2 = 0 for d in range(C): th1 = (0.1) ** d while (B**th2 < A): th3 = th2 th2 += th1 if (B**th2 == A): return th2

print('Hello world!') K = [0]*((6*3)+1) for A in range(6): for B in range(6): for C in range(6): print(f'{[(A+1),(B+1),(C+1)]}!') K[(A+1)+(B+1)+(C+1)]+=1 print(K)

import random point = 10000 sc=0 psc=0 listam = [0,0,0] while point > 1: sc=0 psc=random.randint(0,point) while sum(listam) % 2 != 1: listam = [random.randint(0,1) for j in range(10)]

import tkinter as tk def disable_event(): # 閉じるボタン（X）を無効化ニダ pass # メインウィンドウの作成ニダ root = tk.Tk() root.title("Message")

#include <iostream> class memoly { private: int cost; public: memoly(){ this->cost = 0; } void REmemoly(int cost){ this->cost = cost;

class 中国麻雀: def __init__(self, 飜,符): self.飜=飜 self.符=符 def 子計算(self): return ((self.飜*self.符*3) if (self.飜 > 7) else None) def 親計算(self): return ((self.飜*self.符*4) if (self.飜 > 7) else None) class 日本麻雀(中国

#include <iostream> #include <string> #include <vector> #include <stack> #include <cctype> #include <map> #include <stdexcept> #include <cmath> // 演算子の優先順位と結合性を定義

#include <iostream> #include <string> #include <string_view> #include <utility> #include <memory> #include <vector> // 列挙型による厳密な型安全の確保 enum class Gender { Male,

using System; class FOR { private int fors=0; private int forson=0; public bool LOOP(int k) { forson = fors; fors += 1;

using System; class FOR { private int fors; private int forson; public bool Drive(int k) { forson = fors; fors += 1;

import numpy as np A = np.array([ [2, 2], [2, 2] ]) B = np.array([ [1, 0], [0, 1]

def N(params): H=0 F="" for name in list(params): if name==" ": H=((ord(name))) else: H=((256-(ord(name)%256))%(26+26+26+26+27+7+32))+32 F += (chr(H))

def VM(code): A = 0 J = 0 Jo=0 K = 0 G = lambda x:x g=0 c=0 loop = [] while A < len(code):

#include <iostream> #include <stdio.h> #include <string> class Humen { private: std::string name; std::string job; int age; std::string gender; public:

class table: def __init__(self, params): self.Table = [] self.params = params def Craft(self, name, params): pass def push(self, params): self.Table.append({

for i = 1:((11^2)-1) fprintf("%d", i); if i == 1 fprintf("->Δ\n", i); elseif i != 2 && mod(i,2) == 0 fprintf("->x\n", i); elseif i != 3 && mod(i,3) == 0 fprintf("->x\n", i); elseif i != 5 && mod(i,5) == 0

#include <stdio.h> #include <stdlib.h> int main() { int *list = malloc(8 * sizeof(int)); *(list+0)=1; *(list+1)=1; int k=2; while (k < 8) { *(list+k)=*(list+(k-1))+*(list+(k-2)); k++;

#include <iostream> class AHO { private: int *K; public: AHO(int *K){ this->K = K; }; void equal(int J){ *this->K = J;

import numpy as np G = [ [1,3,5,7], [2,4,6,8], [0,4,5,8], [2,1,6,7], [3,0,5,8], [1,3,6,7], [0,2,4,8],