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:
1 parent
1e82e8aa3e
commit
d2a42f42e8
478 files changed
No files matched your search
@@ -0,0 +1,33 @@
|
||||
typedef struct A*B,*(*C)();struct A{C(*d)();B e;}*v(),*b;C n[256];
|
||||
# include <stdio.h>
|
||||
#define a (d->e)
|
||||
#define o (B)printf
|
||||
#define X(_){return _;}
|
||||
#define Y(_,A)B _(d,e)B d,e;X(A)
|
||||
#define Z(P)C P(f,g,h,i)C f,g,h,i;X(P)
|
||||
#define c(_)(b=(B)malloc(sizeof(*b)),b->d=_,b->e=d,b)
|
||||
#define _(D,E,F,G,H)B D();Y(D/**/f,E)Y(D/**/g,F)Y(D/**/h,G)Y(D/**/i,H)Y(D,(*(*d->d)(D/**/f,D/**/g,D/**/h,D/**/i))(d,e))
|
||||
Z(f)
|
||||
Z(g)
|
||||
Z(h)
|
||||
Z(i)
|
||||
_(j,d,d,j a,j a)
|
||||
_(k,d,c(h),c(h),c(h))
|
||||
_(l,c(i),d,c(i),c(i))
|
||||
_(m,c(g),c(f),l(m a),k(m a))
|
||||
_(p,d,l(m(d)),k(p a),l(m a))
|
||||
_(q,l(p(d)),m(d),l a,k(q a))
|
||||
_(r,m(d),k(mf a),l(r a),k a)
|
||||
_(s,d,e,o("0",s a),o("1",s a))
|
||||
_(t,d,p(e),k(t(a,e)),v(k(t(a,e)),e))
|
||||
_(u,k(e),l(r(e)),k(v(a,e)),l(v(a,e)))
|
||||
_(v,e,r(e),u(e,a),u(q(e),a))
|
||||
_(w,o("0"),d,s(d),s(d))
|
||||
_(x,(*n[getchar()])(d),o("-1"),w(p(d,o("-"))),xh(d))
|
||||
_(y,xf(mg()),v(d,p(yf())),v(d,yf()),t(d,yf()))
|
||||
_(z,xf(yf()),(*(*j(d)->d)(w,x))(d),xf(k(d)),xf(l(d)))
|
||||
main(){
|
||||
n['(']=zf;n['x']=yi;n['-']=yg;
|
||||
n['+']=yh;n['0']=zh;n['1']=zi;
|
||||
n[' ']=xf;n[')']=n['\n']=kf;
|
||||
o("\n",zg(yf()));}
|
||||
@@ -0,0 +1,51 @@
|
||||
Best minimal use of C:
|
||||
|
||||
Arch D. Robison
|
||||
University of Illinois
|
||||
1304 W. Springfield Ave.
|
||||
Urbana, IL
|
||||
61801
|
||||
USA
|
||||
|
||||
Judges notes:
|
||||
|
||||
Sites with punch card facilities will be happy to note that
|
||||
the source deck can be re-collated with an ASCII sort.
|
||||
|
||||
Note that this program uses only a small subset of the
|
||||
constructs that the C language supports.
|
||||
|
||||
Selected notes from the author:
|
||||
|
||||
This program is a handy picoAPL interpreter written in C--. It
|
||||
outputs the evaluation of an APL expression from standard
|
||||
input. Functions are limited to dyadic +,-,x, and unary -;
|
||||
numerals must be binary. Parentheses may be used for
|
||||
grouping. For example:
|
||||
|
||||
101x111-100
|
||||
|
||||
prints:
|
||||
|
||||
1111
|
||||
|
||||
That is 5x(7-4) is 15. (APL groups from right to left.)
|
||||
Extending it to the full APL language should be trivial.
|
||||
|
||||
The C-- language improves the C language by removing superfluous
|
||||
and confusing features: arithmetic, logical operations, shifts,
|
||||
relationals, address-of, and flow control. In fact, the only
|
||||
expressions retained are function calls, indirection, array
|
||||
assignments, the ',' operator, and sizeof. Despite these
|
||||
restrictions, the C-- program does arithmetic on arbitrarily
|
||||
large binary numbers.
|
||||
|
||||
To obtain a C-- reference, simply rip out the irrelevant pages
|
||||
from your K&R C manual. To obtain a C-- compiler, simply rip
|
||||
out the irrelevant bytes from your cc compiler.
|
||||
|
||||
Copyright (c) 1989, 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