Move 1988-2004 entries into subdirs
We we move 1988-2004 entries from all of a year's winning entries in a single directory to each winner being in their own sub-directory under the given year directory.
This commit is contained in:
Landon Curt Noll committed
1 parent
1e82e8aa3e
commit
d2a42f42e8
478 files changed
No files matched your search
@@ -0,0 +1,212 @@
|
||||
#include <stdio.h>
|
||||
; m(x)(x<0?-1:!!x)
|
||||
; g tj()-J
|
||||
; a(x)(x<0?-x:x)
|
||||
; h(x)((x)<=K?x:N-(x))
|
||||
; f 9999
|
||||
; A return
|
||||
; H printf{
|
||||
; R double
|
||||
; U int
|
||||
; V for
|
||||
; b else
|
||||
; u while
|
||||
; B if
|
||||
U v,w,Y} -1,W,J,p,F,o} f,M,N,K,X,YY,_,P[f],s{ } ;
|
||||
typedef U{ *L} { } ;
|
||||
L q[f];
|
||||
tj{ } {
|
||||
U S} m{ v} +{ m{ w} <<K} ;
|
||||
B{ !S} A J;
|
||||
V{ v} W+S; v!} J&&!q[v]; v+} S} ;
|
||||
A v;
|
||||
}
|
||||
k{ } {
|
||||
_} K;
|
||||
A v?a{ v} >1||w-Y||!q[J]:{ w-Y&&{ w-Y*2||q[W+Y*{ N+1} ]||
|
||||
{ J>>K} -K+{ Y-1} / 2} } ||q[J];
|
||||
}
|
||||
z{ } {
|
||||
_} 5;
|
||||
A v*w||g;
|
||||
}
|
||||
e{ } {
|
||||
_} -2;
|
||||
A{ v*v*v-v||w*w*w-w} &&{ J-W-2||{ W&N} -4||{ W>>K!} { Y-1?N:0} } ||
|
||||
q[W+1]||q[W+2]||q[W+K]!} z||P[W+K]*Y<0} ;
|
||||
}
|
||||
R VR{ } {
|
||||
int PZ} 0x7fff;
|
||||
A{ R} { rand{ } &PZ} /{ R} PZ;
|
||||
}
|
||||
l{ } {
|
||||
_} K+1;
|
||||
A{ v*w&&a{ v} -a{ w} } ||g;
|
||||
}
|
||||
R UC{ } {
|
||||
R { } 0,d;
|
||||
u{ { { +} d} VR{ } } <1.0} ;
|
||||
A d;
|
||||
}
|
||||
c{ } {
|
||||
_} -11;
|
||||
A a{ v} -a{ w} ||g;
|
||||
}
|
||||
I{ ur,n,x} {
|
||||
W} ur;
|
||||
J} n;
|
||||
B{ P[W]!} Y||P[J]} } Y} A J+1;
|
||||
v} { J&N} -{ W&N} ;
|
||||
w} { J>>K} -{ W>>K} ;
|
||||
A q[W]{ } ||{ x&&QL{ W,J,s} } ;
|
||||
}
|
||||
TT{ W} {
|
||||
v} w} 0;
|
||||
A q[W]{ } +K;
|
||||
}
|
||||
s{ } {
|
||||
U j} -1,{ ;
|
||||
Y} -Y;
|
||||
V{ { } 0; { <M; ++{ } {
|
||||
B{ j<0&&P[{ ]} } -Y&&TT{ { } &&_} } -2}
|
||||
{
|
||||
j} { ;
|
||||
{ } -1;
|
||||
}
|
||||
b B{ j>} 0&&!I{ { ,j,0} } A Y} -Y;
|
||||
}
|
||||
A!{ Y} -Y} ;
|
||||
}
|
||||
bb{ } {
|
||||
_} 1;
|
||||
A a{ v*w} -2;
|
||||
}
|
||||
uv{ } {
|
||||
V{ v} 0; v<f; ++v} {
|
||||
B{ h{ v>>K} } } 0} {
|
||||
U S} h{ v&N} ;
|
||||
q[v]} !S?z:{ S} } 1?bb:{ S} } 2?c:{ v&N>K?l:e} } } ;
|
||||
}
|
||||
b B{ h{ v>>K} } } 1} q[v]} k;
|
||||
b q[v]} 0;
|
||||
P[v]} !!q[v]*{ 28-v} ;
|
||||
}
|
||||
}
|
||||
y{ } {
|
||||
U G} Y,{ ;
|
||||
J} 0;
|
||||
V{ { } 0; { <M; ++{ } {
|
||||
{ %8||H"\n%4o ",{ } ;
|
||||
B{ { Y} P[{ ]} m{ P[{ ]} } &&
|
||||
TT{ { } } H"%c ",_+93+Y*16} ;
|
||||
b H"- "} ;
|
||||
}
|
||||
H"\n "} ;
|
||||
do
|
||||
H"%2d",{ ++&N} ;
|
||||
u{ { &N} ;
|
||||
Y} G;
|
||||
H"\n"} ;
|
||||
}
|
||||
O{ W,J} {
|
||||
B{ { q[J]} q[W]} } } k&&h{ J>>K} } } 0} q[J]} l;
|
||||
B{ q[W]} } e} B{ J-W} } 2} O{ J+1,J-1} ;
|
||||
b B{ W-J} } 2} O{ W-1,W+1} ;
|
||||
P[J]} P[W];
|
||||
q[W]} 0;
|
||||
P[W]} 0;
|
||||
}
|
||||
QL{ W,J,D} L D;
|
||||
{
|
||||
U HQ} P[J],YX;
|
||||
L AJ} q[J],XY} q[W];
|
||||
O{ W,J} ;
|
||||
YX} D{ } ;
|
||||
O{ J,W} ;
|
||||
q[J]} AJ;
|
||||
q[W]} XY;
|
||||
P[J]} HQ;
|
||||
A YX;
|
||||
}
|
||||
C{ } {
|
||||
U { ,j,BZ} 0;
|
||||
V{ { } 0; { <M; ++{ } {
|
||||
L Z} q[{ ];
|
||||
B{ Z} {
|
||||
U r} h{ { >>K} +h{ { &N} ,G} Y,
|
||||
S} Z} } z?88:{ Z} } k?11
|
||||
+r+{ P[{ ]<0?N-{ { >>K} :{ { >>K} } :
|
||||
{ Z} } l?124-{ { YY<8&&{ { { &N} !} K||
|
||||
{ { >>K} !} { P[{ ]>0?0:N} } } ?M:0} :
|
||||
{ Z} } c?41+r:{ Z} } e?f-r-r:36+r+r} } } } ;
|
||||
Y} P[{ ];
|
||||
V{ j} 0; j<M; ++j} B{ !I{ { ,j,0} } S+} { P[j]?5:1} ;
|
||||
BZ+} G} } Y?S:-S;
|
||||
Y} G;
|
||||
}
|
||||
}
|
||||
B{ !{ ++X&M-1} } write{ 1,".",1} ;
|
||||
A BZ;
|
||||
}
|
||||
PX{ } {
|
||||
U { ,Q} 0,XP} 0,JZ} M*M,E} -f,t,S} o;
|
||||
B{ !F--} A++F+C{ } ;
|
||||
V{ { } 0; { <JZ; ++{ } B{ !I{ { >>K+K,{ &M-1,1} } {
|
||||
Y} -Y;
|
||||
o} -E;
|
||||
t} -QL{ { >>K+K,{ &M-1,PX} ;
|
||||
Y} -Y;
|
||||
B{ t>E} {
|
||||
++XP;
|
||||
Q} { ;
|
||||
E} t;
|
||||
B{ E>} S}
|
||||
A++F,E;
|
||||
}
|
||||
}
|
||||
B{ !XP} E} s{ } ?-f+1:0;
|
||||
p} Q;
|
||||
A++F,E;
|
||||
}
|
||||
RZ{ } {
|
||||
U { ,j,T} 0;
|
||||
V{ ; ; } {
|
||||
y{ } ;
|
||||
o} f;
|
||||
do{
|
||||
H"\n%d %d %d %s ",X,T,C{ } ,s{ } ?"!":">"} ;
|
||||
fflush{ stdout} ;
|
||||
}
|
||||
u{ scanf{ "%o%o",&{ ,&j} !} 2||I{ { ,j,1} } ;
|
||||
O{ { ,j} ;
|
||||
y{ } ;
|
||||
X} 0;
|
||||
++YY;
|
||||
Y} -Y;
|
||||
T} PX{ } ;
|
||||
{ } p>>{ K<<1} ;
|
||||
j} p&{ M-1} ;
|
||||
B{ I{ { ,j,1} } {
|
||||
H"Rats!\n"} ;
|
||||
A;
|
||||
}
|
||||
O{ { ,j} ;
|
||||
Y} -Y;
|
||||
B{ T>M*M} H"\nHar har.\n"} ;
|
||||
}
|
||||
}
|
||||
main{ ac,av} char**av;
|
||||
{
|
||||
long time{ } ,j} time{ &j} ;
|
||||
R { } 0;
|
||||
srand{ { U} j} ;
|
||||
V{ M} 0; M<} f; ++M} { +} UC{ } ;
|
||||
M} { /100;
|
||||
B{ M&3} ++M;
|
||||
B{ M&1} --M;
|
||||
V{ N} 1; N*N<M; ++N} ;
|
||||
K} --N/2;
|
||||
F} ac>1?atoi{ av[1]} :2;
|
||||
uv{ } ;
|
||||
RZ{ } ;
|
||||
}
|
||||
@@ -0,0 +1,144 @@
|
||||
Best of Show:
|
||||
|
||||
Vern Paxson
|
||||
Lawrence Berkeley Laboratory
|
||||
Computer Systems Engineering
|
||||
Bldg. 46A, Room 1123
|
||||
Lawrence Berkeley Laboratory
|
||||
1 Cyclotron Rd.
|
||||
Berkeley, CA 94720 USA
|
||||
|
||||
|
||||
Judges' comments:
|
||||
|
||||
Try:
|
||||
make vern
|
||||
vern 3 <-- default is 2
|
||||
|
||||
You might start off by giving the following input:
|
||||
63 43
|
||||
76 55
|
||||
71 52
|
||||
67 57 (this may take a while)
|
||||
|
||||
The judges assume no responsibility for the obfuscated opening
|
||||
suggested above. :-)
|
||||
|
||||
For a real quick game try:
|
||||
vern
|
||||
|
||||
65 55
|
||||
66 46
|
||||
|
||||
NOTE: Move values must be restricted to the range 00 to 77.
|
||||
|
||||
NOTE: Because some mailers have problems with the original winning source,
|
||||
a slightly modified version with shorter lines has been provided.
|
||||
|
||||
|
||||
Selected notes from the author:
|
||||
|
||||
This program plays chess. You play the white pieces and the program
|
||||
the black pieces. Moves are entered as a two-digit number specifying
|
||||
the coordinates of the piece to be moved followed by another two-digit
|
||||
number specifying the coordinates of where to move it. Rows and
|
||||
columns are numbered starting with (0,0) for the upper-lefthand corner
|
||||
(black's queen's rook) and going to (7,7) for the lower-righthand
|
||||
corner (white's king's rook). For example, the PK4 opening for white
|
||||
is indicated as "64 44". Moves are read using scanf() so care should
|
||||
be taken to not enter the wrong number of fields.
|
||||
|
||||
If the move you enter is illegal then you are just prompted again to
|
||||
move. If the move is legal then the new position is displayed and the
|
||||
program starts computing its response. For every 64 board positions it
|
||||
examines a "." is printed. Once it has chosen its move it simply
|
||||
displays the board updated to reflect the move.
|
||||
|
||||
Your move is prompted for using a string like "1351 9 2 >". The first
|
||||
number is how many board positions the program examined when computing
|
||||
its previous response. The second number is its anticipated value for
|
||||
the move it just made (with larger numbers meaning an ultimately better
|
||||
board position for it), and the third number is the evaluation it
|
||||
assigns to the your current position (larger numbers meaning better
|
||||
positions for you). A ">" indicates that you are not in check; for
|
||||
check it is changed to "!".
|
||||
|
||||
There are a few limitations on play:
|
||||
|
||||
o castling can only be done on the king's side;
|
||||
o prohibitions against castling out of or through check are
|
||||
not enforced;
|
||||
o prohibitions against castling if the king or rook have moved
|
||||
are not enforced;
|
||||
o pawns are always promoted to queens;
|
||||
o en passant is not allowed;
|
||||
o the board-position-repeated-three-times and fifty-moves
|
||||
stalemates are not recognized;
|
||||
|
||||
If you checkmate the computer it prints "Rats!" and exits. If your own
|
||||
checkmate is imminent it prints "Har har." but doesn't exit so it can
|
||||
rub your nose in defeat (which may be a move or two away if you're
|
||||
playing at a high "ply" - see the next paragraph). Stalemates are not
|
||||
recognized per se, but when selecting its move the program assigns a
|
||||
stalemate position a value of 0 so it will try for a stalemate if its
|
||||
other options are worse.
|
||||
|
||||
The program takes one optional argument indicating the ply (lookahead)
|
||||
it should use. The default is 2, which is enough to keep it from
|
||||
making flaming blunders. The higher the ply, the better the play, and
|
||||
the longer you have to wait. For example, at a ply of 2, a response to
|
||||
the PK4 opening takes about 1.8 CPU seconds on a SPARC ELC when
|
||||
compiled -O with Sun cc. A ply of 3 takes 13 CPU seconds (and results
|
||||
in a different response to PK4) and a ply of 4 takes a little under 4
|
||||
CPU minutes (and for PK4 comes up with the same response as a ply of
|
||||
3). A ply of 3 is in general good enough to avoid not only flaming
|
||||
blunders but also immediately stupid moves altogether. A ply of 4
|
||||
will find all mate-in-two's.
|
||||
|
||||
|
||||
|
||||
This program is obfuscated in a number of ways. First, it abuses the
|
||||
contest rule regarding ';', '{', and '}' in the source not counting
|
||||
against the non-whitespace character limit if followed by whitespace.
|
||||
As can be seen from the build file, certain combinations of these
|
||||
characters followed by a particular whitespace character are expanded
|
||||
at build time into much-needed text. Without this hack the program
|
||||
wouldn't pass the character limit. A nice side effect is that the
|
||||
initial source is gloriously difficult to peruse.
|
||||
|
||||
Second, the rather ho-hum step has been taking of naming each variable
|
||||
with a one or two letter identifier to render it meaningless (and save
|
||||
space). This tactic is rather effective in a complex program.
|
||||
|
||||
Third, the board is represented not as an array of pieces but rather as
|
||||
an array of function pointers (with a separate array representing
|
||||
whether a piece is white or black). This obfuscates the program's
|
||||
central data structure. There is one function per type of piece; when
|
||||
called they return 1 if the current move is illegal for that piece and
|
||||
0 if it is legal. The functions also as a side effect set a global
|
||||
indicating the type of the piece (though the type can also be determined
|
||||
by comparing the function pointer with the function itself).
|
||||
|
||||
Fourth, there are no independent routines for generating potential
|
||||
moves. Instead, the program generates its moves by brute force: for
|
||||
every piece it controls on the board, it attempts to move it to every
|
||||
square on the board. Those moves that are legal it then explores to
|
||||
see their effects (using alpha-beta search). This tactic somewhat
|
||||
obfuscates the algorithm used by the program.
|
||||
|
||||
Finally, there are three key constants that occur throughout the
|
||||
program: 64, 8, and 3 (lg 8). Rather than making these available at
|
||||
compile-time, which provides a hint as to what the program is up to,
|
||||
they are computed probabilistically at run-time. An instance of the
|
||||
"Inspection Paradox" is used which happens to produce a value that on
|
||||
average is close to .64. 10000 instances of this value are computed,
|
||||
added up, and then divided by 100. Sometimes the value produced will
|
||||
be 63 or 65 instead of 64 (but I've never observed any other values),
|
||||
so the result is then rounded to the nearest multiple of 4, and then
|
||||
the other constants are derived from it.
|
||||
|
||||
Copyright (c) 1992, Landon Curt Noll & Larry Bassel.
|
||||
All Rights Reserved. Permission for personal, educational or non-profit use is
|
||||
granted provided this this copyright and notice are included in its entirety
|
||||
and remains unaltered. All other uses must receive prior permission in writing
|
||||
from both Landon Curt Noll and Larry Bassel.
|
||||
@@ -0,0 +1,210 @@
|
||||
#include <stdio.h>
|
||||
; m(x)(x<0?-1:!!x)
|
||||
; g tj()-J
|
||||
; a(x)(x<0?-x:x)
|
||||
; h(x)((x)<=K?x:N-(x))
|
||||
; f 9999
|
||||
; A return
|
||||
; H printf{
|
||||
; R double
|
||||
; U int
|
||||
; V for
|
||||
; b else
|
||||
; u while
|
||||
; B if
|
||||
U v,w,Y} -1,W,J,p,F,o} f,M,N,K,X,YY,_,P[f],s{ } ;
|
||||
typedef U{ *L} { } ;
|
||||
L q[f];
|
||||
tj{ } {
|
||||
U S} m{ v} +{ m{ w} <<K} ;
|
||||
B{ !S} A J;
|
||||
V{ v} W+S; v!} J&&!q[v]; v+} S} ;
|
||||
A v;
|
||||
}
|
||||
k{ } {
|
||||
_} K;
|
||||
A v?a{ v} >1||w-Y||!q[J]:{ w-Y&&{ w-Y*2||q[W+Y*{ N+1} ]||
|
||||
{ J>>K} -K+{ Y-1} / 2} } ||q[J];
|
||||
}
|
||||
z{ } {
|
||||
_} 5;
|
||||
A v*w||g;
|
||||
}
|
||||
e{ } {
|
||||
_} -2;
|
||||
A{ v*v*v-v||w*w*w-w} &&{ J-W-2||{ W&N} -4||{ W>>K!} { Y-1?N:0} } ||
|
||||
q[W+1]||q[W+2]||q[W+K]!} z||P[W+K]*Y<0} ;
|
||||
}
|
||||
R VR{ } {
|
||||
int PZ} 0x7fff;
|
||||
A{ R} { rand{ } &PZ} /{ R} PZ;
|
||||
}
|
||||
l{ } {
|
||||
_} K+1;
|
||||
A{ v*w&&a{ v} -a{ w} } ||g;
|
||||
}
|
||||
R UC{ } {
|
||||
R { } 0,d;
|
||||
u{ { { +} d} VR{ } } <1.0} ;
|
||||
A d;
|
||||
}
|
||||
c{ } {
|
||||
_} -11;
|
||||
A a{ v} -a{ w} ||g;
|
||||
}
|
||||
I{ ur,n,x} {
|
||||
W} ur;
|
||||
J} n;
|
||||
B{ P[W]!} Y||P[J]} } Y} A J+1;
|
||||
v} { J&N} -{ W&N} ;
|
||||
w} { J>>K} -{ W>>K} ;
|
||||
A q[W]{ } ||{ x&&QL{ W,J,s} } ;
|
||||
}
|
||||
TT{ W} {
|
||||
v} w} 0;
|
||||
A q[W]{ } +K;
|
||||
}
|
||||
s{ } {
|
||||
U j} -1,{ ;
|
||||
Y} -Y;
|
||||
V{ { } 0; { <M; ++{ } {
|
||||
B{ j<0&&P[{ ]} } -Y&&TT{ { } &&_} } -2}
|
||||
{
|
||||
j} { ;
|
||||
{ } -1;
|
||||
}
|
||||
b B{ j>} 0&&!I{ { ,j,0} } A Y} -Y;
|
||||
}
|
||||
A!{ Y} -Y} ;
|
||||
}
|
||||
bb{ } {
|
||||
_} 1;
|
||||
A a{ v*w} -2;
|
||||
}
|
||||
uv{ } {
|
||||
V{ v} 0; v<f; ++v} {
|
||||
B{ h{ v>>K} } } 0} {
|
||||
U S} h{ v&N} ;
|
||||
q[v]} !S?z:{ S} } 1?bb:{ S} } 2?c:{ v&N>K?l:e} } } ;
|
||||
}
|
||||
b B{ h{ v>>K} } } 1} q[v]} k;
|
||||
b q[v]} 0;
|
||||
P[v]} !!q[v]*{ 28-v} ;
|
||||
}
|
||||
}
|
||||
y{ } {
|
||||
U G} Y,{ ;
|
||||
J} 0;
|
||||
V{ { } 0; { <M; ++{ } {
|
||||
{ %8||H"\n%4o ",{ } ;
|
||||
B{ { Y} P[{ ]} m{ P[{ ]} } &&TT{ { } } H"%c ",_+93+Y*16} ;
|
||||
b H"- "} ;
|
||||
}
|
||||
H"\n "} ;
|
||||
do
|
||||
H"%2d",{ ++&N} ;
|
||||
u{ { &N} ;
|
||||
Y} G;
|
||||
H"\n"} ;
|
||||
}
|
||||
O{ W,J} {
|
||||
B{ { q[J]} q[W]} } } k&&h{ J>>K} } } 0} q[J]} l;
|
||||
B{ q[W]} } e} B{ J-W} } 2} O{ J+1,J-1} ;
|
||||
b B{ W-J} } 2} O{ W-1,W+1} ;
|
||||
P[J]} P[W];
|
||||
q[W]} 0;
|
||||
P[W]} 0;
|
||||
}
|
||||
QL{ W,J,D} L D;
|
||||
{
|
||||
U HQ} P[J],YX;
|
||||
L AJ} q[J],XY} q[W];
|
||||
O{ W,J} ;
|
||||
YX} D{ } ;
|
||||
O{ J,W} ;
|
||||
q[J]} AJ;
|
||||
q[W]} XY;
|
||||
P[J]} HQ;
|
||||
A YX;
|
||||
}
|
||||
C{ } {
|
||||
U { ,j,BZ} 0;
|
||||
V{ { } 0; { <M; ++{ } {
|
||||
L Z} q[{ ];
|
||||
B{ Z} {
|
||||
U r} h{ { >>K} +h{ { &N} ,G} Y,
|
||||
S} Z} } z?88:{ Z} } k?11+r+{ P[{ ]<0?N-{ { >>K} :{ { >>K} } :
|
||||
{ Z} } l?124-{ { YY<8&&{ { { &N} !} K||
|
||||
{ { >>K} !} { P[{ ]>0?0:N} } } ?M:0} :
|
||||
{ Z} } c?41+r:{ Z} } e?f-r-r:36+r+r} } } } ;
|
||||
Y} P[{ ];
|
||||
V{ j} 0; j<M; ++j} B{ !I{ { ,j,0} } S+} { P[j]?5:1} ;
|
||||
BZ+} G} } Y?S:-S;
|
||||
Y} G;
|
||||
}
|
||||
}
|
||||
B{ !{ ++X&M-1} } write{ 1,".",1} ;
|
||||
A BZ;
|
||||
}
|
||||
PX{ } {
|
||||
U { ,Q} 0,XP} 0,JZ} M*M,E} -f,t,S} o;
|
||||
B{ !F--} A++F+C{ } ;
|
||||
V{ { } 0; { <JZ; ++{ } B{ !I{ { >>K+K,{ &M-1,1} } {
|
||||
Y} -Y;
|
||||
o} -E;
|
||||
t} -QL{ { >>K+K,{ &M-1,PX} ;
|
||||
Y} -Y;
|
||||
B{ t>E} {
|
||||
++XP;
|
||||
Q} { ;
|
||||
E} t;
|
||||
B{ E>} S}
|
||||
A++F,E;
|
||||
}
|
||||
}
|
||||
B{ !XP} E} s{ } ?-f+1:0;
|
||||
p} Q;
|
||||
A++F,E;
|
||||
}
|
||||
RZ{ } {
|
||||
U { ,j,T} 0;
|
||||
V{ ; ; } {
|
||||
y{ } ;
|
||||
o} f;
|
||||
do{
|
||||
H"\n%d %d %d %s ",X,T,C{ } ,s{ } ?"!":">"} ;
|
||||
fflush{ stdout} ;
|
||||
}
|
||||
u{ scanf{ "%o%o",&{ ,&j} !} 2||I{ { ,j,1} } ;
|
||||
O{ { ,j} ;
|
||||
y{ } ;
|
||||
X} 0;
|
||||
++YY;
|
||||
Y} -Y;
|
||||
T} PX{ } ;
|
||||
{ } p>>{ K<<1} ;
|
||||
j} p&{ M-1} ;
|
||||
B{ I{ { ,j,1} } {
|
||||
H"Rats!\n"} ;
|
||||
A;
|
||||
}
|
||||
O{ { ,j} ;
|
||||
Y} -Y;
|
||||
B{ T>M*M} H"\nHar har.\n"} ;
|
||||
}
|
||||
}
|
||||
main{ ac,av} char**av;
|
||||
{
|
||||
long time{ } ,j} time{ &j} ;
|
||||
R { } 0;
|
||||
srand{ { U} j} ;
|
||||
V{ M} 0; M<} f; ++M} { +} UC{ } ;
|
||||
M} { /100;
|
||||
B{ M&3} ++M;
|
||||
B{ M&1} --M;
|
||||
V{ N} 1; N*N<M; ++N} ;
|
||||
K} --N/2;
|
||||
F} ac>1?atoi{ av[1]} :2;
|
||||
uv{ } ;
|
||||
RZ{ } ;
|
||||
}
|
||||
Reference in new issue
Block a user