0
Your rating: None
CodeChef submission 601251 (C) 

CodeChef submission 601251 (C) plaintext list. Status: AC, problem SEQUENCE, contest . By karlheinz_jung (karlheinz_jung), 2011-07-18 18:24:48.
  1. #include <stdio.h>
  2. #define R(a,b) ((p<<a)+(q<<b))
  3. #define S(a,b,c) if(a){x=b;y=c;}
  4.  
  5. main()
  6. {
  7. int fall, a, b, n, i, j, x, y, k, p, q, e[1<<17], c[1<<17];
  8. for(i=0; i<=15; e[1<<i]=i++);
  9. for(scanf("%d",&fall); fall--;)
  10. 	{
  11. 	for(x=y=-!(i=!scanf("%d %d %d",&n,&a,&b)); i<(1<<n); i++)
  12. 		{
  13. 		c[i]=i^(i>>1);
  14. 		S((i>0&&((c[i]==a&&c[i-1]==b)||(c[i]==b&&c[i-1]==a))),i-1,i)
  15. 		}
  16. 	i--;
  17. 	S((c[0]==a&&c[i]==b)||(c[0]==b&&c[i]==a),0,i)
  18. 	if(x>=0)
  19. 		for(j=e[c[x]^c[y]]+(k=0); k<n; k++)
  20. 			if(j!=k)
  21. 				{
  22. 				for(x=y=-!(i=0); i<(1<<n); i++)
  23. 					{
  24. 					p=(c[i]>>j)&1;
  25. 					q=(c[i]>>k)&1;
  26. 					c[i]+=-R(j,k)+R(k,j);
  27. 					S((i>0&&((c[i]==a&&c[i-1]==b)||(c[i]==b&&c[i-1]==a))),i-1,i)
  28. 					}
  29. 				i--;
  30. 				S(((c[0]==a&&c[i]==b)||(c[0]==b&&c[i]==a)),0,i)
  31. 				if(x==-1)break;
  32. 				}
  33. 	for(printf((x==(i=-1))?"":"-1\n"); x==-1&&(++i<(1<<n)); printf("%d%c",c[i],(i==(1<<n)-1)?'\n':' '));
  34. 	}
  35. return 0;
  36. }
  37.

Comments