fork download
  1. #include<iostream>
  2. #include<vector>
  3. #include<set>
  4. #include<map>
  5. #include<algorithm>
  6. using namespace std;
  7. typedef long long ll;
  8. const ll mod = 998244353;
  9.  
  10.  
  11. int main(){
  12. ll t;
  13. cin >> t;
  14. while(t--){
  15. ll n, index = 0;
  16. cin >> n;
  17.  
  18. vector<vector<ll> > v(n+1, vector<ll>(n+1, 0));
  19. for(int i = 1; i <= n; i++){
  20. for(int j = 1; j <= n; j++){
  21. cin >> v[i][j];
  22. }
  23. reverse(v[i].begin()+1, v[i].end());
  24. for(int j = 1; j <= n; j++){
  25. v[i][j] += v[i][j-1];
  26. }
  27. }
  28. sort(v.begin(), v.end());
  29. for(int i = 1; i <= n; i++){
  30. if(v[i][1] == 1)index = i;
  31. }
  32.  
  33. reverse(v.begin()+1, v.begin()+index+1);
  34.  
  35. for(int i = 1; i <= n; i++){
  36. if(v[i][i] != i){
  37. cout << i << endl;
  38. break;
  39. }
  40. if(i == n)cout << n << endl;
  41. }
  42. }
  43. }
Success #stdin #stdout 0s 5284KB
stdin
5
1
1
1
2
1
3
2
1 1
1 1
2
1 1
1 2
stdout
1
1
1
2
2