#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#include <algorithm>
#include <queue>
using namespace std;
#define INF 0x3f3f3f3f
const int maxn = 150;
int t, n;
int a[maxn];
int main(){
cin >> t;
while (t--) {
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != i && a[i - 1] == i - 1) cnt++;
}
if (!cnt) cout << 0 << endl;
else if (cnt == 1) cout << 1 << endl;
else cout << 2 << endl;
}
return 0;
}
Codeforces C. Omkar and Baseball (Round #655 Div.2)
最新推荐文章于 2024-04-07 00:15:09 发布