0
Your rating: None

CodeChef submission 152568 (C++ 4.0.0-8)

CodeChef submission 152568 (C++ 4.0.0-8) plaintext list. Status: AC, problem RESN04, contest RESNKDWN. By resnk_double_s (resnk_double_s), 2009-12-20 16:46:57.
  1. #include<cstdio>
  2. #include<cstdlib>
  3. #include<cmath>
  4. #include<cstring>
  5. #include<cassert>
  6. #include<ctime>
  7. #include<iostream>
  8. #include<string>
  9. #include<vector>
  10. #include<algorithm>
  11. #include<map>
  12. #include<set>
  13. #include<stack>
  14. #include<queue>
  15.  
  16. #define PB push_back
  17. #define M 1000
  18. #define N 1000
  19. #define LL long long
  20.  
  21.  
  22. using namespace std;
  23.  
  24.  
  25.  
  26.  
  27.  
  28.  
  29. int main()
  30. {
  31. 	
  32. 	int tc,i,j,k;
  33. 	scanf("%d",&tc);
  34. 	while(tc--)
  35. 	{
  36. 		int piles;
  37. 		scanf("%d",&piles);
  38. 		int ans=0;
  39. 		for(i=1;i<=piles;++i)
  40. 		{
  41. 			scanf("%d",&j);
  42. 			ans+=j/i;
  43. 		}
  44. 		if(ans%2==1)
  45. 			puts("ALICE");
  46. 		else
  47. 			puts("BOB");
  48. 	}
  49. 	
  50. 	
  51. 	
  52. 	return 0;
  53. }
  54.

Comments

Is this solution really

stonekyx @ 11 Mar 2010 07:39 PM

Is this solution really correct?

If there are two piles with 1 and 2 stones respectively, Alice can remove 1 stone from the second pile and win, but your program will produce an answer that Bob wins.

That is not a valid move

triplem @ 12 Mar 2010 02:01 AM

That is not a valid move according to the problem statement.