PERMUT2  Ambiguous Permutations
Some programming contest problems are really tricky: not only do they
require a different output format from what you might have expected, but
also the sample output does not show the difference. For an example,
let us look at permutations.
A permutation of the integers 1 to n is an
ordering of
these integers. So the natural way to represent a permutation is
to list the integers in this order. With n = 5, a
permutation might look like 2, 3, 4, 5, 1.
However, there is another possibility of representing a permutation:
You create a list of numbers where the ith number is the
position of the integer i in the permutation.
Let us call this second
possibility an inverse permutation. The inverse permutation
for the sequence above is 5, 1, 2, 3, 4.
An ambiguous permutation is a permutation which cannot be
distinguished from its inverse permutation. The permutation 1, 4, 3, 2
for example is ambiguous, because its inverse permutation is the same.
To get rid of such annoying sample test cases, you have to write a
program which detects if a given permutation is ambiguous or not.
Input Specification
The input contains several test cases.
The first line of each test case contains an integer n
(1 ≤ n ≤ 100000).
Then a permutation of the integers 1 to n follows
in the next line. There is exactly one space character
between consecutive integers.
You can assume that every integer between 1 and n
appears exactly once in the permutation.
The last test case is followed by a zero.
Output Specification
For each test case output whether the permutation is ambiguous or not. Adhere to the format shown in the sample output.
Sample Input
4 1 4 3 2 5 2 3 4 5 1 1 1 0
Sample Output
ambiguous not ambiguous ambiguous
hide comments
mkatiyar:
20150914 11:10:03
:( Costed me 1 WA due to typo as "non" instead of "not" 

kartikay singh:
20150830 07:43:39
last test case by 0 ;) missed that :( 

Mohit:
20150827 04:21:31
got AC in first attempt.?


Shivam Singh:
20150822 01:34:02
Green at first sight after a long time :P :D 

suhas:
20150818 21:07:05
My 20th :). got WA coz used "non" instead of "not" :/ 

Babu:
20150814 19:21:51
very very easy


puneethnaik:
20150724 06:03:23
nice question!! 

Vivek:
20150722 19:58:11
Easy.AC in 1st go.


Akshay Aradhya:
20150716 18:48:50
Little Confusing but Easy :P And LOL 10 second Time limit hahahah


poojan :
20150711 14:27:24
ac in 1 go too easy 
Added by:  Adrian Kuegel 
Date:  20050624 
Time limit:  10s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel Pentium G860 3GHz) 
Languages:  All except: NODEJS PERL 6 VB.net 
Resource:  own problem, used in University of Ulm Local Contest 2005 