2470.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

Memory:444K  Time:109MS
Language:C++  Result:Accepted

Source 

#include"iostream.h"
#include"stdio.h"
#include"math.h"

int a[100000];

int main()
{
	int n,i;

	while(1)
	{
		scanf("%d",&n);
		if(n==0)break;

		for(i=0;i<n;i++)
			scanf("%d",&a[i]);

		for(i=0;i<n;i++)
			if(a[a[i]-1]!=i+1)
				break;
		if(i<n)
			printf("not ambiguous\n");
		else printf("ambiguous\n");

	}

	return 0;
}