Advertisement
Manioc

Q6

Feb 6th, 2018
183
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.67 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4. int arr[57][57], n, m, maxxi[57];
  5.  
  6. int main(){
  7.     int num; cin >> num;
  8.     while(num--){
  9.         cin >> n >> m;
  10.         for(int i = 0; i < n; i++){
  11.             int mex = 0, one = 0;
  12.             bool over = false;
  13.             for(int j = 0; j < m; j++){
  14.                 cin >> arr[i][j];
  15.                 if(i > 0 && arr[i][j] <= 1 && !over) one++;
  16.                 else over = true;
  17.             }maxxi[i] = arr[i][0] - (one%2 == 0);
  18.         }
  19.         int resp = 0;
  20.         for(int i = 0; i < n; i++) resp ^= maxxi[i];
  21.         if(resp > 0) cout <<"FIRST\n";
  22.         else cout << "SECOND\n";
  23.     }
  24.     return 0;
  25. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement