#include <bits/stdc++.h>
#define f0(i, n) for(int i(0); i<(n); i++)
#define f1(i, n) for(int i(1); i<=(n); i++)
using namespace std;
typedef long long ll;
const int N = 1002;
int n, testcase, a[N];
void solve(){
vector <int> save;
cin >> n;
f1(i, n) cin >> a[i];
/// first one is crazy old lady
f1(i, n) if(a[i] != i) save.push_back(i); /// sai cho
if(a[2]==1){
/// seat of the COL is not 1
cout << save[save.size() - 1] << endl;
}
}
int main(){
ios_base::sync_with_stdio(0);
cin >> testcase;
while(testcase--) solve();
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
448 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
