// What do you think this will print?

#include <stdio.h>

char *b(void) {return "worst";}
char *c(void) {return "case";}
char *d(void) {return "scenario";}

#define a(a) a
#define b() "best"
#define c() "preprocessor"
#define d() "ever"
#define e
#define f(f) e f e
#define g(s,p,q,r) s##p##q##r
#define h(d,i,j,k) g(d,i,j,k)
#define t m

g(i,n,t,) h(t,a,i,n)(void) {
    puts(  ( f(b)() ) );
    puts( a( f(c)() ) );
    puts(d());
}

def isogram(s,u,p,e,r,a,l,m,i,g,h,t,y):
    _=77  # change this to -1 to print forever

    z=1
    while _:
        if(w:=(v:=m+l*y)//i)==(v+l)//i:print(w,end='');m-=w*i;l*=10;m*=10;_-=1
        else:i*=p*g;m*=p;m+=u*l;m*=g;l*=s*z;s+=e;u+=r;p+=a;g+=h;z+=t

print("Guess the sequences")
print("\nA: ", end=''); isogram( 1, 6, 3, 1, 4, 2, 1, 0, 1, 1, 0, 0, 3)
print("\nB: ", end=''); isogram( 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1)
print("\nC: ", end=''); isogram( 3, 2, 4, 2, 2, 4, 1, 1, 1, 1, 0, 0, 1)
print("\nD: ", end=''); isogram( 1, 2, 4, 1, 1, 2, 1, 0, 1, 1, 0, 0, 0)
print("\nE: ", end=''); isogram(10, 4,36, 4, 1, 9,-4,88,54, 1, 0, 0, 0)
print("\nF: ", end=''); isogram(-1, 2, 2, 0, 2, 2, 1, 0, 1, 3, 2, 0, 0)
print("\nG: ", end=''); isogram( 1, 2, 2, 0, 2, 2, 1, 0, 1, 3, 2, 0, 0)
print("\nH: ", end=''); isogram(30, 1,10, 0, 1,10, 1, 0, 1, 1, 0, 0, 0)
print("\nI: ", end=''); isogram( 1, 2, 2, 0, 2, 2, 1, 0, 1, 1, 0, 0, 1)
print("\nJ: ", end=''); isogram( 3, 3,24, 2, 1, 8,-1,14, 9, 1, 0, 0, 0)
print("\nK: ", end=''); isogram( 1,12,12, 2, 8, 8, 1, 0, 1, 1, 0, 0, 1)
print("\nL: ", end=''); isogram(-1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1)
print("\nM: ", end=''); isogram(-2, 4, 8,-4, 4, 8, 1, 0, 1, 6, 4, 2, 0)
print("\nN: ", end=''); isogram(-4, 2, 2, 0, 2, 2,-1, 0, 1, 1, 2, 0, 0)
print("\nO: ", end=''); isogram( 4, 2, 2, 0, 2, 2, 2, 0, 1, 3, 2, 0, 0)
print("\nP: ", end=''); isogram( 1, 2, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1)

#include <stdio.h>

#define tonight(o,n)                   n##o##i
#define bottom(g,e,a,r)                r(of(r),to_eject(r,a,g),and_is(bi,t,s))
#define i_convince(e,l,o,n,m,u,s,k)    (s?o?m(e,o,n,e) : u(o) : k(o,e,l,,,,))
#define to_eject(t,h,e)                and_is(s,h,e)
#define entire(p,op,u,l,a,t,i,o)n
#define of_i(n,d,i,a)                  i_convince(d,a,n,i,urgent,of(i),n-n,in)
#define into(s,p,a,c,e)                richard(s,o,p,a)
#define richard(g,e,t,s)               and_j(g,o,e,s)
#define in(t,r,o,u,b,l,e)              i(the(,,o,p,e,r,a)(t,o,r))
#define for(i,ll,e,g,a,l,ly)           tonight(l,ll)
#define selling(k,e,t,a,m,i,n)#e
#define on(am,a,z,o,n)                 for(,m,=0,;,m<,o,;m++)
#define and_j(a,m,e,s)                 a##s
#define sits(on)                       to_eject
#define the(s,h,i,f,t,e,r)             sits(i)
#define of(a_2007)                     bottom(e,g,g,the(m,o,n,s,t,e,r))
#define hond(a,_ci,v,ic)               i(richard(a,ct,i,v))
#define and_is(n,o,w)                  o##w
#define i(n)                           selling(m,n,e,m,o,n,ic)
#define urgent(c,a,r,e)                a

into(and_j(s,a,p,i),nt,richard(gn,i(j(i)),for(s,l,ee,p,i,n,g),and_j(e,xt,en,d)),
a,the(t,h,r,i,f,t,e,r))sits(into(t,,h,,e))(urgent(p,a,i,n),on(ta,r,i,a,n),entire
(t,,o,,w,,n,))(){richard(to_eject(f,and_is(ca,pr,i),sits(sq)(ui,n,t)),bottom
(a,f,a,r),and_j(a,f,a,r),urgent(a,f,a,r))(of_i(i(t(e(r(a)t(o(r))))),x,r,h)),
bottom(u,s,p,sits(urgent(,s,i,x)))(i_convince(x,a,i(j(i)),r,hond,of
(v(e,f(o(r),b(r(y)),d(e(r(n(e))))))),i(x),in));}