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
+128
@@ -0,0 +1,128 @@
|
||||
#include <stdio.h>
|
||||
#include <malloc.h>
|
||||
#include <string.h>
|
||||
|
||||
#define A(x) (e^d)&i?e:(e+=i+i/15-d,d<<=4,i<<=4,x)
|
||||
#define B b+=!((e^d)&i)&&(d|=i),i<<=4,
|
||||
#define C i=15,B B B B d=d<<4|d>>12,
|
||||
#define D=(d=g,b=0,C b<<=4, C C C b)
|
||||
#define E if(**y)goto
|
||||
#define F=a[rand()%c]
|
||||
#define G unsigned short
|
||||
#define H e^=a[z],a[z]^=e,e^=a[z],
|
||||
|
||||
void
|
||||
main
|
||||
(int
|
||||
z,char
|
||||
**y)
|
||||
{G*a
|
||||
,b,c
|
||||
,d,e
|
||||
,f,g
|
||||
,h,i
|
||||
;*(*
|
||||
y+=
|
||||
strlen
|
||||
(*y)
|
||||
-1)^=
|
||||
'd';
|
||||
srand
|
||||
(time
|
||||
(0))
|
||||
;z==
|
||||
2&&
|
||||
sscanf
|
||||
(y[1
|
||||
],"%d"
|
||||
,&z)
|
||||
&&z?
|
||||
0:(z
|
||||
=6);
|
||||
if(!
|
||||
(a=(
|
||||
G*)
|
||||
calloc(
|
||||
z*z*
|
||||
z*z,
|
||||
sizeof
|
||||
(G))
|
||||
)){
|
||||
printf
|
||||
("No\
|
||||
memory\
|
||||
\n");
|
||||
exit
|
||||
(1);
|
||||
}for
|
||||
(c=1
|
||||
;i=15
|
||||
,d=z
|
||||
,c<z
|
||||
*z*z
|
||||
*z&&
|
||||
(e=a
|
||||
[c-1
|
||||
]+1,
|
||||
a[c]
|
||||
=A(A
|
||||
(A(A
|
||||
(0))
|
||||
)),1
|
||||
);c++
|
||||
);*(
|
||||
**y?
|
||||
&g:&
|
||||
e)F;
|
||||
do{
|
||||
printf
|
||||
("(%d): ????\b\b\b\b"
|
||||
,c);E
|
||||
q0;else
|
||||
goto
|
||||
q1;q0:
|
||||
printf
|
||||
("%04X\n"
|
||||
,g+
|
||||
4369
|
||||
);E
|
||||
q2;q1:
|
||||
scanf
|
||||
("%hx"
|
||||
,**y
|
||||
?&h:
|
||||
&g);
|
||||
E q3
|
||||
;g-=
|
||||
4369
|
||||
;q2:
|
||||
printf
|
||||
("??\b\b"
|
||||
);E q1;
|
||||
printf(
|
||||
"%02x\n"
|
||||
,h D
|
||||
);q3
|
||||
:for
|
||||
(z=f
|
||||
=0;(
|
||||
z<c||
|
||||
(c=f
|
||||
,0))
|
||||
&&(H
|
||||
b D!=
|
||||
h,H b
|
||||
||(a[
|
||||
f++]=
|
||||
a[z])
|
||||
,1);z
|
||||
++);
|
||||
}while
|
||||
(h!=
|
||||
64&&
|
||||
c>0&&
|
||||
((g F
|
||||
),1)
|
||||
);printf
|
||||
("\n"
|
||||
);}
|
||||
@@ -0,0 +1,106 @@
|
||||
Best Game:
|
||||
|
||||
Leonid A. Broukhis
|
||||
Moscow Centre of SPARC Technology
|
||||
123481 Liberty St.,
|
||||
89-1-95 Moscow
|
||||
Russia
|
||||
|
||||
|
||||
Judges' comments:
|
||||
|
||||
To make:
|
||||
make leo
|
||||
|
||||
To have the computer guess:
|
||||
leo [colors]
|
||||
|
||||
To guess the computer's number:
|
||||
mind [colors]
|
||||
|
||||
where:
|
||||
colors number of possible colors (1 to 15) (default: 6)
|
||||
|
||||
By default, the number of colors if 6. You may specify a
|
||||
value of between 1 and 15 colors. See the author's notes
|
||||
for instructions of how to play.
|
||||
|
||||
We look forward to more entries from the newer members of the
|
||||
International Internet community.
|
||||
|
||||
On some systems, you may need to remove the line:
|
||||
|
||||
#include <malloc.h>
|
||||
|
||||
or replace that line with:
|
||||
|
||||
#include <sys/types.h>
|
||||
#include <sys/malloc.h>
|
||||
|
||||
to successfully build this entry.
|
||||
|
||||
|
||||
Selected notes from the author:
|
||||
|
||||
This program plays mastermind, if you call it by a name ending by
|
||||
'd', otherwise it _solves_ mastermind. Call it without parameters
|
||||
to use 6 digits (colors), or indicate the number of possible digits
|
||||
(you cannot change the number of positions so easily).
|
||||
|
||||
The number in parentheses is the number of possible combinations,
|
||||
based on previous questions and answers. If you solve the puzzle,
|
||||
"(1)" indicates that your previous moves are enough to give correct
|
||||
answer. If the program acts as solver and terminates prematurely,
|
||||
it means that you have mistaken in your answers to its guesses.
|
||||
Question marks indicate the number of digits you have to enter
|
||||
(either 4 when you guess or 2 when computer guesses).
|
||||
|
||||
Note that the program uses the same code for both player and
|
||||
solver, and the only place where it makes difference is the
|
||||
interactive part. Many obfuscations have been made to achieve
|
||||
this. An expression giving (bulls * 16 + cows) from two numbers
|
||||
is, however, quite straightforward :-) , as well as the arithmetic
|
||||
of binary coded colors-base numbers is.
|
||||
|
||||
Limitations: maximum number of digits (colors) is 14 (1..F).
|
||||
|
||||
Suggestions: Use terminal (or emulator) with non-destructive
|
||||
backspaces. Do "disable scrolling" on cmdtool or similar emulators.
|
||||
|
||||
Bugs: Please don't type ^D at the prompt!!
|
||||
|
||||
EXAMPLE: Suppose we think of 1234:
|
||||
|
||||
judges-385> leo
|
||||
(1296): 6433
|
||||
?? 12 # one 3 is a bull, another is a cow, and 4 is a cow
|
||||
(160): 5363
|
||||
?? 02 # both 3's are cows
|
||||
(21): 4231
|
||||
?? 22 # 2 and 3 are bulls, 4 and 1 are cows
|
||||
(2): 4132
|
||||
?? 13 # 3 is a bull; 1, 2 and 4 are cows
|
||||
(1): 1234
|
||||
?? 40 # you may enter everything there
|
||||
|
||||
EXAMPLE: Guess the computer's number:
|
||||
|
||||
judges-387> mind
|
||||
(1296): ???? 1122 # my strategy isn't the best, just as example
|
||||
00
|
||||
(256): ???? 3344
|
||||
20
|
||||
(18): ???? 5566
|
||||
02
|
||||
(6): ???? 3654
|
||||
11
|
||||
(2): ???? 3355
|
||||
00
|
||||
(1): ???? 6444
|
||||
40 # we have guessed the number
|
||||
|
||||
Copyright (c) 1993, 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.
|
||||
Reference in new issue
Block a user