0
Your rating: None

CodeChef submission 431319 (C++ 4.3.2)

CodeChef submission 431319 (C++ 4.3.2) plaintext list. Status: WA, problem PERMUT2, contest . By surave (surave), 2011-01-23 22:40:11.
  1. #include <stdio.h>
  2. #include "string.h"
  3. #include <iostream>
  4.  
  5. using namespace std;
  6.  
  7. int main()
  8. {
  9. 	int arr[100000] = {0};
  10. 	int n = 1;
  11. 	bool isAmb;
  12. 	while(n)
  13. 	{
  14. 		isAmb = true;
  15. 		scanf("%d",&n);
  16. 		for(int i = 0; i < n; i++)
  17. 		{
  18. 			scanf("%d",&arr[i]);
  19. 			if (arr[arr[i]-1])
  20. 			{
  21. 				if (arr[arr[i]-1] != i+1)
  22. 				{
  23. 					isAmb = false;
  24. 					cin.ignore(10000000, '\n');
  25. 					break;
  26. 				}
  27. 			}
  28. 		}
  29. 		/*for(int i = 0; i < n; i++)
  30. 		{
  31. 			if (arr[arr[i]-1] != i+1)
  32. 			{
  33. 				isAmb = false;
  34. 				break;
  35. 			}
  36. 		}*/
  37. 		if (n)
  38. 		{
  39. 			printf(((isAmb)?"ambiguous\n":"not ambiguous\n"));
  40. 		}
  41. 	}
  42. 	return 0;
  43. }

Comments