Permut2(Ambiguous_Problem)

#include<stdio.h>
#include<stdlib.h>
int Ambiguous(int* arr, int n){
int inverse[n];
for(int i=0;i<n;i++)
{
inverse[arr[i]-1] = i+1;
}
int flag = 1;
for(int i=0;i<n;i++)
{
if(inverse[i] != arr[i])
{
flag = 0;
}
}
return flag;
}
int main(){
int n,i;
scanf("%d",&n);
if(n<1||n>100000)
{
printf("\n ERROR");
exit(0);
}
int arr[n];
while(n!=0)
{
for(i=0;i<n;i++)
{
scanf(" %d",&arr[i]);
}
if(Ambiguous(arr,n))
{
printf(“ambiguous\n”);
}
else
{
printf(“not ambiguous\n”);
}
int n2;
scanf("%d",&n2);
n = n2;
}
return 0;
}