//http://www.spoj.com/problems/PERMUT2/
#include <iostream>
using namespace std;
int main(int argc, char* argv[]) {
int buffer[100001];
int n;
cin >> n;
while (n!=0) {
for (int i = 1; i <=n; i++) {
cin >> buffer[i];
}
int notambiguous = true;
for (int i = 1; i <=n; i++) {
if (buffer[buffer[i]] != i) {
notambiguous = false;
}
}
if (notambiguous) {
cout << "ambiguous" << endl;
} else {
cout << "not ambiguous" << endl;
}
cin >> n;
}
}
Ambiguous Permutations
最新推荐文章于 2020-11-23 10:18:10 发布