2834123_ac_0ms_148k.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>

void main()
{
	int inv[] = {0,1,2,3};
	int a, b, c, d, e, f, g, h, i, l;
	int ax, bx, cx, dx, ex, fx, gx, hx, ix;
	int t[10], an[30];
	
	scanf("%d%d%d%d%d%d%d%d%d",&ax,&bx,&cx,&dx,&ex,&fx,&gx,&hx,&ix);
	a = inv[ax]; b = inv[bx]; c = inv[cx]; 
	d = inv[dx]; e = inv[ex]; f = inv[fx]; 
	g = inv[gx]; h = inv[hx]; i = inv[ix];
	t[1] = (8+a+2*b+c+2*d+2*e-f+g-h)%4;
	t[2] = (a+b+c+d+e+f+2*g+2*i)%4;
	t[3] = (8+a+2*b+c-d+2*e+2*f-h+i)%4;
	t[4] = (a+b+2*c+d+e+g+h+2*i) % 4;
	t[5] = (4+a+2*b+c+2*d-e+2*f+g+2*h+i)%4;
	t[6] = (2*a+b+c+e+f+2*g+h+i)%4;
	t[7] = (8+a-b+2*d+2*e-f+g+2*h+i)%4;
	t[8] = (2*a+2*c+d+e+f+g+h+i)%4;
	t[9] = (8-b+c-d+2*e+2*f+g+2*h+i)%4;
	l = 0;
	for (a = 1; a < 10; a++)
	{
		for (b = 1; b <= t[a]; b++)
	 		an[l++] = a;
	}
	for (a = 0; a < l; a++)
	  	printf("%d ",an[a]);
}