@YSS

#include <stdio.h> int main() { int A = 0; int B = 0; int C = 0; int D = 0; while (A < 30) { B = 0; while (B < A) {

(defn S [A,B] (def a (atom 1.0) ) (def b (atom 0.0) ) (def c (atom 0.0) )

def Q(p): A = p while A > 2: A -= 1 if p % A == 0: break else: return True return False print(Q(59))

#include <iostream> #include <cmath> #include <cstdint> auto go(int A,int8_t B) { int8_t th0 = 0.0; auto th1 = 0; auto th2 = 0.0; auto th3 = 0.0; auto th4 = 1.0;

function 平方根(対象,精度) { let 足すやつ = 1; let 足されるやつ = 0; let 足されるやつ保存用 = 0; let かけるやつ = 0; let ワイル用 = 0; while (ワイル用 < 精度) { かけるやつ = 0; while (かけるやつ < 対象){

class A: O = 0 def __enter__(self): print(O) pass def __exit__(self, *args): pass

#include <stdio.h> double S(int A,int B); int main() { printf("%f",S(2,16)); return 0; } double S(int A,int B){ double th2=0,th3=0,th4=0; double th1 = 1.0;

def s(a,b) spr = [0, 0, 0, 0] (0..b).each do |i| spr[0] = (1.0/10)**i spr[3] = 0 while (spr[3] < a) do spr[1] = spr[2] spr[2] = spr[2] + spr[0] spr[3] = spr[2] ** 2 end

function S(a, b) local spr = {0, 0, 0, 0} for i = 0, b do spr[1] = (0.1) ^ i spr[4] = 0 while spr[4] < a do spr[2] = spr[3] spr[3] = spr[3] + spr[1]

def S(A,B): spr=[0,0,0,0] for name in range(B): spr[0]=(0.1)**name spr[3]=0 while spr[3] < A: spr[1] = spr[2] spr[2] += spr[0] spr[3] = (spr[2]**2) spr[2] = spr[1]

local users = { {id = 1, name = "Alice", age = 30}, {id = 2, name = "Bob", age = 25} } -- ユーザーを検索 for _, user in ipairs(users) do if user.id == 1 then print(user.name) -- "Alice" end

for i = 1, 120 do io.write(i) if i == 1 then print("->x") elseif i % 2 == 0 and i ~= 2 then print("->x") elseif i % 3 == 0 and i ~= 3 then print("->x") elseif i % 5 == 0 and i ~= 5 then

import random print("一行一巡") text = '' A = list("""_ABCDEFGHIJKLMNOPQRSTUVWXYZ""") for q in range(7): for qw in range(27): text = f'{text}{A.pop(random.randint(0, len(A)-1))}' text = f'{text}.{chr(10)}' A = list("""_ABCDEFGHIJKLMN

local = 0 class Parent @@count = 0 def initialize @@count += 1 end def self.count @@count

function loop(P,T) { const NewP = P+1; if (P < T) { console.log("カウント:"+NewP); const o = loop(NewP,T) } return 0; } loop(0,10)

#include <stdio.h> int main() { int* p = (int*)0x1000; *p = 42; printf("%\n"); return 0; }

#include <stdio.h> int* f() { static int x; return &x; } int main() { int* A = f(); *(A+0) = 1;

#[derive(Debug)] struct User { name: String, age: Box<i32>, } fn main() { let user1 = User { name: String::from("Alice"), age: Box::new(42),

def name(params): aho = 0 P = "" alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" while aho < len(params): P=f"{P}{alpha[((alpha.index(params[aho])+13)%26)]}" aho += 1 return P print(name("PUVT"))

#include <stdio.h> // Aの値を1増やし、結果をaに代入 void one_uping(int *A, int *a) { *a = *A + 1; } // Aの値をB回だけインクリメント void two_uping(int *A, int B) { // Bは整数にする int C = 0;