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
sarthak_1998:
20190520 16:16:29
Did the question with structs in c++ which made the question quite easy. 

markaman:
20181230 16:20:59
Just read problem statement carefully


cypher33:
20181228 14:13:55
Easy question hai chutiyon AC in 1 go likh ke khush kya ho ja rahe ho... 

bugsbunnyo1:
20181124 18:32:49
Be careful, wrote non instead of non resulted in WA! 

kundannayak51:
20181017 13:10:30
wasted 3 hour because I was taking input of no. of testcases from user as we normally do in competitive coding.


phoemur:
20180911 18:16:31
AC in std::numeric_limits<unsigned long long>::max() go !!! 

yashraj_rocks:
20180725 15:16:39
Ac in one go!


koustubh:
20180630 20:16:20
Be careful while writing the output, costed me a WA for wrong spelling! 

theabd123:
20180529 11:10:24
AC in one go...Everyone have right to celebrate


m_sundriyal:
20180327 10:24:14
For those who are having a hard time to understand the problem.

Added by:  Adrian Kuegel 
Date:  20050624 
Time limit:  10s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 VB.NET 
Resource:  own problem, used in University of Ulm Local Contest 2005 