@YSS

package main import ( "fmt" "math/big" ) func main() { x := big.NewInt(1) one := big.NewInt(1)

x = 1 n = 27 n.times do x = x * x + 1 end puts x.to_s.length

import sys sys.set_int_max_str_digits(200_000_00) x = 1 for _ in range(21): x = x * x + 1 print(x)

let x = 1n; const N = 25; for (let i = 0; i < N; i++) { x = x * x + 1n; } console.log(x.toString().length);

<?php for ($A = 1; $A < 121; $A++) { echo "{$A}"; if ($A === 1) { echo":x\n"; } else { if ($A % 2 === 0 && $A != 2) { echo":x\n"; } else {

import java.util.*; import java.lang.*; import java.io.*; import java.math.BigInteger; // The main method must be in a class named "Main". class Main { public static void main(String[] args) { BigInteger x = BigInteger.ONE; BigI

#!/bin/bash j=1919 k=1918 while true; do k=$((k - 1)) if (( j % k == 0 )); then break fi

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) { int j = 1919; int k = 1918; while (j % k != 0) {

#include <stdio.h> int main() { int j = 1919; int k = 1918; do { k = k - 1; } while (j % k != 0); return 0; }

fn main() { let j = 1919; let mut k = 1918; while j % k != 0{ k = k - 1; } }

package main func main() { j := 1919 k := 1918 for j%k != 0 { k-- } }

let k = 1919; let j = 1918; while (k % j != 0) { j += -1; }

k = 1919 j = 1918 while (k % j != 0) j += -1 end

J = 1919 K = 1918 while ( J % K != 0): K += -1

for (let i = 1; i < 121; i++) { if (i === 1) { console.log(`${i}:x`); } else if (i % 2 === 0 && i != 2) { console.log(`${i}:x`); } else if (i % 3 === 0 && i != 3) { console.log(`${i}:x`); } else if (i % 5 ===

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) { for (int i = 1; i <= 120 ; i++) { System.out.print(i);

<?php $i = 1; for (; ; ) { if ($i > 10) { break; } echo $i; $i++; }

#include <stdio.h> int main() { int ʁu; int ʀu; int ru; scanf("%d",&ru); ʀu = ru-1; while (ru % ʀu != 0) { ʀu = ʀu-1;

R=[3,2,3,3,4,1,-1,5,-5] ʀ=0 for A in range(len(R)-1): for a in range(len(R)-1): if R[a] > R[a+1]: ʀ = R[a] R[a] = R[a+1] R[a+1] = ʀ

#include <iostream> int main() { int i=0; int h=0; int v=0; do { do { do {