(some old hints have been made available)
To make an end to this boring times without contests we proudly announce the
$ foo 1 3 1 2 3 $ foo 1 -1 1 0 -1We think the problem itself is not too hard. The program that solves the problem with the constraints given below with the shortest source code wins the contest.
wc -c
' for measurement).
gcc -o foo foo.c
' (the choice of the target
architecture is due to the jury).
void o(int x);can be used, that prints the value of x on one single line. You can link the object code to your program (`
gcc -o foo o.o foo.c
'). One
possible way to make o.o
is by typing
echo 'void o(int i) { printf("%d\n", i); }' > o.c; gcc -c -o o.o o.cOne can not assume that this is done in this way in the very contest concering the internal implementation.
BEGIN-SHOCC
on a seperate line, followed
by the source code, followed by an END-SHOCC
tag, again on a
separate line. Used for the contest are only the lines between the two
tags excluding them.
From: Max User To: shocc@unix-ag.uni-kl.de Hi thou shoccers, eat my submission: BEGIN-SHOCC void main(int argc, char *argv[]) { o(1); o(2); o(3); } END-SHOCC P.S.: Unfortunately my submission worx only in certain cases. Is that a prob? Greetinx, Max.Submissions must be sent to shocc@unix-ag.uni-kl.de until Wednesday, February 22nd, 1995, 11:59:59 PM MET (that is 10:59 PM GMT, 5:59 PM EST, 2:59 PM PST); incoming timestamps are relevant. Each contestant can participate with exactly one program. In case of multiple submissions only the last valid one is accepted.
The results are computed directly after the deadline and published on Thursday, February 23rd, 1995 6:30 PM MET at the University of Kaiserslautern Regional Computing Center (RHRK), Room DS/1 and on IRC on channel #shocc. The celebration of winners is also done at that time. All participants are also notified by mail and the results are posted to the newsgroups you got this announcementy from.
\n
) at the end of the line will be
counted in your submission.
Nils' Homepage
Peter's Homepage (german)
UNIX-AG Homepage