[20180623 PRO]

1. /*
   
2. 数字拼图[Digit Puzzle]由NxN的拼片组成
   
3. 每个拼片是一个MxM的正方形，外面由一圈数字描述，数字只能是-1，0，1
   
4. -1表示图形凹进去1，0表示图形是平的，1表示图形凸出来1，顺时针的
   
5. 
   
6. */
   
7. 
   
8. #include "stdafx.h"
   
9. extern void init(int N,int M,int K);
   
10. extern void add_piece(int piece[]);
    
11. extern int find_center_piece();
    
12. static int mseed;
    
13. static int pseudo_rand(void){
    
14.    mseed=mseed*431345+2531999;
    
15.    return mseed&0x7FFFFFFF;
    
16. }
    
17. 
    
18. static int run(){
    
19.    int i,j,idx,m;
    
20.    int N,M,K,result;
    
21.    scanf("%d %d %d",&N,&M,&K);
    
22.    init(N,M,K);
    
23.    int piece[60];
    
24.    for(i=0;i<N*N+K;++i){
    
25.       for(j=0;j<4;++j){
    
26.          scanf("%d",&mseed);
    
27.          idx=j*M;
    
28.          piece[idx]=piece[idx+M-1]=0;
    
29.          if(mseed>0){
    
30.             for(m=1;m<M-1;++m)
    
31.                piece[idx+m]=pseudo_rand()%3-1;
    
32.          }else{
    
33.             mseed*=-1;
    
34.             for(m=M-2;m>0;--m)
    
35.                piece[idx+m]=1-pseudo_rand()%3;
    
36.          }
    
37.       }
    
38.       add_piece(piece);
    
39.    }
    
40.    result=find_center_piece();
    
41.    return result;
    
42. }
    
43. 
    
44. int main(int argc, char* argv[])
    
45. {
    
46.    int tc,T;
    
47.    setbuf(stdout,NULL);
    
48.    freopen("20180624i.txt","r",stdin);
    
49.    scanf("%d",&T);
    
50.    for(tc=1;tc<=T;++tc)
    
51.    {
    
52.       printf("#%d %d\n",tc,run());
    
53.    }
    
54.    return 0;
    
55. }
    
56. 
    
57. /*
    
58. 1
    
59. 3 8 1
    
60. 324558 198996 -104795 -31709
    
61. 1443 122094 -15203 -67959
    
62. 222569 376501 -127631 -54743
    
63. 88597 51386 -648201 -395447
    
64. 15203 54743 -324558 -579850
    
65. 648201 268085 -355781 -376501
    
66. 355781 74551 -297177 -249935
    
67. 88597 80788 -617409 -395447
    
68. 850670 395447 -222569 -122094
    
69. 127631 249935 -303339 -198996
    
70. */

1. #include "stdafx.h"
   
2. 
   
3. /*
   
4. 3 <= N <= 49 odd number
   
5. 8 <= M <= 18
   
6. 1 <= K <= 5
   
7. */
   
8. 
   
9. int fn;
   
10. int fm;
    
11. int fk;
    
12. short a_ps[2406][60];
    
13. short mark[2406];
    
14. 
    
15. void init(int N,int M,int K)
    
16. {
    
17.    fn=N;
    
18.    fm=M;
    
19.    fk=K;
    
20. }
    
21. 
    
22. void add_piece(int piece[])
    
23. {
    
24. 
    
25. }
    
26. 
    
27. int find_center_piece()
    
28. {
    
29.    return 0;
    
30. }