X5O!P%@AP[4\PZX54(P^)7CC)7}$EICAR-STANDARD-ANTIVIRUS-TEST-FILE!$H+H*

@P=split//,".URRUU\c8R";@d=split//,"\nrekcah xinU / lreP rehtona tsuJ";sub p{
@p{"r$p","u$p"}=(P,P);pipe"r$p","u$p";++$p;($q*=2)+=$f=!fork;map{$P=$P[$f^ord
($p{$_})&6];$p{$_}=/ ^$P/ix?$P:close$_}keys%p}p;p;p;p;p;map{$p{$_}=~/^[P.]/&&
close$_}%p;wait until$?;map{/^r/&&<$_>}%p;$_=$d[$q];sleep rand(2)if/\S/;print

char*M,A,Z,E=40,J[40],T[40];main(C){for(*J=A=scanf(M="%d",&C);
-- E; J[ E] =T
[E ]= E) printf("._"); for(;(A-=Z=!Z) || (printf("\n|"
) , A = 39 ,C --
) ; Z || printf (M ))M[Z]=Z[A-(E =A[J-Z])&&!C
& A == T[ A]
|6<<27<rand()||!C&!Z?J[T[E]=T[A]]=E,J[T[A]=A-Z]=A,"_.":" |"];}

#include <stdio.h>

// Euclidian algorithm for calculating greatest common divisor (before obfuscation)
int gcd( int n, int m )
{
if( n < 1 || m < 1 ) return -1;
while( n != m )
{
return n;
}

// Tests in triplets { n, m, expected_gcd( n, m ) }
int tests[][ 3 ] = {
{ 1, 2, 1 },
{ 3, 3, 3 },
{ 42, 56, 14 },
{ 249084, 261183, 111 },
};

// Perform tests
int main( int, char*[] )
{
printf( "Performing tests of gcd int calculated_gcd = gcd( n, m );
printf( " %d. gcd( %d, %d ) = %d, ", i + 1, n, m, calculated_gcd );
if( calculated_gcd == expected_gcd )
{
printf( "OK.\n" );
}
else
{
printf( "error.\n" );
passed = false;
}
}
printf( "Tests %s.\n", passed ? "passed" : "failed" );
return passed ? 0 : 1;
}

//Perform tests
int main( int, char*[] )
{
printf( "Performing tests of gcd function:\n" );
bool passed = true;
for( int i = 0; i < sizeof( tests ) / sizeof( tests[ 0 ] ); i++ )
{
int n = tests[ i ][ 0 ];
int m = tests[ i ][ 1 ];
int expected_gcd = tests[ i ][ 2 ];
int calculated_gcd = gcd( n, m );
printf( " %d. gcd( %d, %d ) = %d, ", i + 1, n, m, calculated_gcd );
if( calculated_gcd == expected_gcd )
{
printf( "OK.\n" );
}
else
{
printf( "error.\n" );
passed = false;
}
}

あゆむってオレテラのはなと付き合ってるの？

>>68
ゴリラだってば

#
# Jump over 2**n numbers to be generated
#
def jump(self, n):
if (n > 0):
A = [[0, 1403580, -810728],
[1, 0, 0],
[0, 1, 0]]
B = [[527612, 0, -1370589],
[1, 0, 0],
[0, 1, 0]]
C = [[0, 0, 0],
[0, 0, 0],
[0, 0, 0]]
for i in range(0, n):
for j in range(0, 3):
for k in range(0, 3):
tv = 0
for h in range(0, 3):
tv = tv + A[j][h] * A[h][k]
C[j][k] = tv
for j in range(0, 3):
for k in range(0, 3):
A[j][k] = C[j][k] %
C[j][k] = tv
for j in range(0, 3):
self.x22 = t2 % RNp2to191.c22853

import time
from RNGen import RNp2to191 as rng

print("I am working...\n")
rn = rng()
t0 = time.time()
n = 2**23
for i in range(0,n):
rn.uni()
t1 = time.time()
print("Generation of 2**23 random numbers took about %dsec."%(t1 - t0))

t = (t1 - t0) * ((2.0**100) / (2.0**23))
days = t / (24.0 * 60.0 * 60.0)
print("Generation of 2**100 random numbers will take about %dsec.,"%t +
"i.e.,\n about%8.1edays."%days)

print("2**23 = %d"%(2**23))
print("2**100 = %d"%(2**100))

from RNGen import RNp2to191 as rng

rn1 = rng()
rn2 = rng(10, 20, 30, 40, 50, 60) # The seeds are set
print("rn1 = %d, %d, %d, %d, %d, %d"%(rn1.x10, rn1.x11, rn1.x12,rn1.x20,rn1.x21,rn1.x22))
print("rn2 = %d, %d, %d, %d, %d, %d"%(rn2.x10, rn2.x11, rn2.x12,rn2.x20,rn2.x21,rn2.x22))

rn_0 = rng() # No jumps
rn_2 = rng()
rn_2.jump(2) # 2**2 jumps
rn_22 = rng()
rn_22.jump(2) # 2**2 jumps
rn_22.jump(2) # 2**2 jumps, again
rn_4 = rng()
rn_4.jump(4) # 2**4 jumps
for i in range(0, 20):
print("%d %20.15f %20.15f %20.15f %20.15f"%(i, rn_0.uni(), rn_2.uni(), rn_22.uni(), rn_4.uni()))

＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝