@YSS

#include <stdio.h> int main() { int a = 127; while (0 == 0) { a++; unsigned char byte1 = 0xC0 | (a >> 6); unsigned char byte2 = 0x80 | (a & 0x3F);

#include <stdio.h> double sp(int r[2]) { double V[] = {0,0}; double v = 1; for (int Vv = 0; Vv<r[1]; Vv++) { v *= 0.1; } for(double k = 1; k>v ; k *= 0.1) { while(((2*V[0]+V[1])*V[1])<(r[0]-V[0]*V[0])){

def s(n,l): p1=0 for i in [0.1**t for t in range(l)]: while (p1**2 < n): p1 += i p1 -= i return p1 print(f'{s(2,5)}')

class shop: def __init__(self): print("welcome!") class sell(shop): def __init__(self): super().__init__(name) self.P = 0 def use(sc,self): self.P += sc class buy(shop):

import matplotlib.pyplot as plt class Name: def __init__(self): self.__A = [1, 1] def Pn(self, a): self.__A = [self.__A[0] + a, self.__A[1]] def Pi(self, a):

import matplotlib.pyplot as plt class Name: def __init__(self): self.__A = [1, 1] def Pn(self, a): self.__A = [self.__A[0] + a, self.__A[1]] def Pi(self, a):

def 表(f,x): for X in range(x): yield (X,f(X)) def Recursion(f,n,x): P = [n] yield (0,n) for X in range(x): yield (X+1,f(P[-1])) P.append(f(P[-1])) def D(f):

#include <stdio.h> typedef struct { double x; double y; } Pair; Pair rain(int A[2][3]) { double x=((A[1][1]*A[0][2])-(A[0][1]*A[1][2]))/((A[1][1]*A[0][0])-(A[0][1]*A[1][0])); double y = (A[0][2] - A[0][0]*x) / A[0][1]; Pair p =

def name(P,Q): k=0 J=Q params = P al=["×","⚪︎","△","□",] for name in params: return k

def name(P,Q): k=0 J=Q params = P al=["×","⚪︎","△","□",] for name in params: return k

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

#include <stdio.h> long M(int p) { int k = 2; while(0 == 0){ k++; if (p%(k-1) == 0){ printf("%d ",(k-1)); M(p/(k-1)); break; }

def k(a): if type(a).__name__=="list": if len(a) <= 1: return a mid = len(a) // 2 B=k(a[:mid]) C=k(a[mid:]) if len(B) == len(C) == 1: b=B[-1]

def k(a): if type(a).__name__=="list": if len(a) <= 1: return a mid = len(a) // 2 B=k(a[:mid]) C=k(a[mid:]) if len(B) == len(C) == 1: b=B[-1]

import random G=[random.randint(0,99) for p in range(10)] for name in range(len(G)-1): print(G) G[name+G[name:].index(min(G[name:]))],G[name]=G[name],G[name+G[name:].index(min(G[name:]))] print(G) p=[random.randint(0,99) for p in range(1

print('Hello world!') def square(B,C): k=1 p=1 for _ in range(B): while (C(k)) > k: k -= p p *= 0.1 while (C(k)) < k:

<?php class Ancient_Mahjong { public $hu; public $han; public function __construct($hu,$han) { $this->hu = $hu; $this->han = $han; } } class China_Mahjong extends Ancient_Mahjong {

def levenshtein(s, t): dp = [[0]*(len(t)+1) for _ in range(len(s)+1)] for i in range(len(s)+1): dp[i][0] = i for j in range(len(t)+1): dp[0][j] = j for i in range(1, len(s)+1): for j in range(1, len(t)+1):

var ko=0; while (NaN !== NaN){ console.log("do"); ko++; if(ko > 10){ break } }

def k(a,b): return (b[1]-a[1])/(b[0]-a[0]) print(k([-2,5],[3,-5]))