0
Your rating: None

CodeChef submission 136792 (C++ 4.0.0-8)

CodeChef submission 136792 (C++ 4.0.0-8) plaintext list. Status: WA, problem SNCK01, contest SNACKDWN. By TriPas (TriPas), 2009-11-21 23:57:53.
  1. #include <stdio.h>
  2.  
  3. int r, c, k, tc, m[64][64];
  4.  
  5. int maxPos(int i)
  6. {
  7.     int p = 0, s = 1;
  8.  
  9.     for (int j = 1; j < c; j++)
  10.         if (m[i][j] > m[i][p])
  11.         {
  12.             p = j;
  13.             s++;
  14.         }
  15.  
  16.     return s;
  17. }
  18.  
  19. bool wins()
  20. {
  21.     int s = 0;
  22.  
  23.     for (int i = 0; i < r; i++)
  24.         s += maxPos(i);
  25.  
  26.     return s % 2 == 1;
  27. }
  28.  
  29. int main()
  30. {
  31.     scanf("%d", &tc);
  32.  
  33.     while (tc--)
  34.     {
  35.         scanf("%d%d", &r, &c);
  36.           int no = 0;
  37.           int k = 4294967295;
  38.         for (int i = 0; i < r; i++)
  39.             for (int j = 0; j < c; j++)
  40.               {
  41.                 {scanf("%d", &m[i][j]);}
  42.                  if(m[i][j]-1==0)
  43.                   no++;
  44.                   k^=m[i][j];
  45.               }
  46.         if(no != 0)
  47.         {
  48.           if(r*c%2==0)
  49.            printf("SECOND\n");
  50.           else
  51.              printf("FIRST\n");
  52.         }
  53.         else
  54.          {
  55.           if(k)
  56.           printf("SECOND\n");
  57.           else
  58.           printf("FIRST\n");
  59.          }
  60.  
  61.  
  62.  
  63.        //if (wins())
  64.         //    printf("FIRST\n");
  65.        // else
  66.          //   printf("SECOND\n");
  67.     }
  68.  
  69.     return 0;
  70. }
  71.

Comments