[杂题] Codechef July Challenge 2017 #MULDIG Multiplication Program

大意是把二元运算化成一元运算
感谢sxt的帮助

剩下的看代码注释吧 //我觉得蛮清楚了
唯一不爽的是 没想到临时变量这么多 mmp

#include<cstdio>#include<cstdlib>#include<algorithm>#include<vector>#define pb push_backusing namespace std;int B;struct abcd{  int x,y,z;  abcd(int x=0,int y=0,int z=0):x(x),y(y),z(z) { }};//int f[100005];int a[10][10];#define t1 (B+100)#define t2 (B+101)#define t3 (B+102) #define t4 (B+103)#define t5 (B+104)#define t6 (B+105)#define t7 (B+106)#define t8 (B+107)#define t9 (B+108)#define t10 (B+109)#define t (B+110)vector<abcd> Ans;inline void P(int x,int y,int z){  Ans.pb(abcd(x,y,z)); //f[z]=a[f[x]][f[y]];}inline void cpy(int y,int x){ //y=x;  P(0,x,y);}inline void _not(int y,int x){ //y=!x  P(2,x,y);}inline void _bool(int a,int b){ //a=(bool)b  _not(a,b); _not(a,a);}inline void add(int x){ //x++  P(1,x,x);}inline void _and(int z,int x,int y){ //z=x&&y  P(x,y,z); for (int i=1;i<=B-2;i++) add(z); _not(z,z);}inline void del(int x){ //x--  for (int i=1;i<B;i++) add(x);}inline void padd(int a,int b){ //if (a) b++;  P(a,b,b);}inline void pdel(int a,int b){ //if (a) b--;  cpy(t7,a); a=t7;  for (int i=1;i<B;i++)    P(a,b,b);}inline void pcpy(int a,int y,int x){ //if (a) y=x;  cpy(t5,x); x=t5; cpy(t6,a); a=t6; cpy(t10,0);   for (int i=0;i<B;i++){    _bool(t4,x); _and(t4,a,t4);    padd(t4,t10); pdel(t4,x);  }  x=y; _not(a,a);  for (int i=0;i<B;i++){    _bool(t4,x); _and(t4,a,t4);    padd(t4,t10); pdel(t4,x);  }  cpy(y,t10);}inline void add(int a,int b,int c,int d){  /*    c=b;    for (int i=0;i<B;i++)    if (a){    c++;    if (a&&!c) d++;    a--;    }  */  cpy(c,b);  for (int i=0;i<B;i++){    _bool(t1,a);    padd(t1,c);    _not(t2,c); _and(t2,t1,t2);    padd(t2,d);    pdel(t1,a);  }}inline void mul(int a,int b,int c,int d){  /*    t=b;    for (int i=0;i<(B-1)*(B-1);i++){    if (a&&t){    c++;    if (a&&t&&!c) d++;    t--;    }    if (a&&!t) a--,t=b;     }  */  cpy(t8,a); a=t8; cpy(t9,b); b=t9;  cpy(t,b);  for (int i=0;i<(B-1)*(B-1);i++){    _bool(t1,a);    _bool(t2,t);    _and(t1,t1,t2);    padd(t1,c);    _not(t3,c); _and(t3,t1,t3);    padd(t3,d);    pdel(t1,t);    _bool(t1,a); _not(t2,t); _and(t1,t1,t2);    pdel(t1,a);    pcpy(t1,t,b);  }}#define C B#define D B+1#define E B+2#define F B+3#define G B+4#define H B+5#define I B+6#define J B+7#define T1 B+8#define T2 B+9#define T3 B+10#define T4 B+11#define T5 B+12#define T6 B+13#define T7 B+14#define T8 B+15#define T9 B+16#define T10 B+17#define T11 B+18#define T12 B+19#define T13 B+20#define T14 B+21#define T15 B+22#define T16 B+23#define T17 B+24#define T18 B+25#define T19 B+26#define T20 B+27#define T21 B+28#define T22 B+29#define T23 B+30#define T24 B+31#define T25 B+32#define T26 B+33#define trash B+1000inline void Solve(){  for (int i=0;i<B;i++) a[0][i]=i,a[1][i]=(i+1)%B;  a[2][0]=1;  for (int i=0;i<B;i++,putchar('\n'))    for (int j=0;j<B;j++)      printf("%d ",a[i][j]);  mul(D,F,J,T1);  mul(C,F,T3,T4);  mul(E,D,T5,T6);  add(T3,T5,T7,T8);  add(T7,T1,I,T10);  mul(E,C,T11,T12);  add(T11,T4,T13,T14);  add(T13,T6,T15,T16);  add(T15,T8,T17,T18);  add(T17,T10,H,T20);  add(T12,T14,T21,trash);  add(T21,T16,T22,trash);  add(T22,T18,T23,trash);  add(T23,T20,G,trash);  printf("%d\n",Ans.size());  for (abcd x:Ans)    printf("%d %d %d\n",x.x,x.y,x.z);}int main(){  freopen("t.in","r",stdin);  freopen("t.out","w",stdout);  scanf("%d",&B);  /*int _C,_D,_E,_F;  scanf("%d%d%d%d",&_C,&_D,&_E,&_F);  for (int i=0;i<B;i++) f[i]=i;  f[B]=_C; f[B+1]=_D; f[B+2]=_E; f[B+3]=_F;*/  Solve();  return 0;}