0
Your rating: None

CodeChef submission 806057 (C++ 4.3.2)

CodeChef submission 806057 (C++ 4.3.2) plaintext list. Status: TLE, problem TAKEAWAY, contest COOK18. By farhadi (farhadi), 2012-01-22 23:52:55.
  1. //In the name of Allah
  2. //
  3. //
  4. //////////////////////
  5. // Program: 
  6. // Written By Alireza Farhadi (LGM)
  7. //////////////////////
  8. #include <iostream>
  9. #include <algorithm>
  10. #include <cstdio>
  11. #include <cstdlib>
  12. #include <cstring>
  13. #include <ctime>
  14. #include <cctype>
  15. #include <climits>
  16. #include <cmath>
  17. #include <queue>
  18. #include <stack>
  19. #include <set>
  20. #include <utility>
  21. #include <vector>
  22. #include <bitset>
  23. #include <deque>
  24. #include <iomanip>
  25. #include <complex>
  26. #include <fstream>
  27. #include <sstream>
  28. //#include <map>
  29. //#include <list>
  30.  
  31.  
  32. using namespace std;
  33.  
  34. #if ( _WIN32 || __WIN32__ )
  35.     #define LLD "%I64d"
  36. #else
  37.     #define LLD "%lld"
  38. #endif
  39.  
  40. #define show(x) cerr<<((#x))<<" = "<<((x))<<" "<<endl
  41. #define bit(a,b) (((a)>>(b))&1)
  42. #define gcd __gcd
  43. #define endl '\n'
  44. #define bcnt(x) ((__builtin_popcount(x)))
  45. #define sz(x) ((int((x).size())))
  46. #define sqr(x) ((((x))*((x))))
  47.  
  48. template<class T> inline void smn(T &a,const T &b){if(b<a) a=b;}
  49. template<class T> inline void smx(T &a,const T &b){if(b>a) a=b;}
  50. template<class T> inline T rev(const T & a){T _=a; reverse(_.begin(),_.end()); return _;}
  51.  
  52. typedef long long ll;
  53. typedef long double ld;
  54. typedef pair<int,int> pie;
  55.  
  56. const double eps=1e-9;
  57. const ld leps=1e-14;
  58.  
  59. int d[2050][2050];
  60. int n,t,k;
  61. int fll(int a,int b)
  62. {
  63. 	if (a==0)
  64. 		return 0;
  65. 	if (d[a][b]!=-1)
  66. 		return d[a][b];
  67. 	vector <int> res;
  68. 	for (int i=1;i<=min(a,b);i++)
  69. 		res.push_back(fll(a-i,min(i,a-i)));
  70. 	sort(res.begin(),res.end());
  71. 	int now=0;
  72. 	for (int i=0;i<=res.size();i++,now++) if (i==res.size() || res[i]!=now)
  73. 		return d[a][b]=now;
  74. }
  75. int main(int argc,char * argv[])
  76. {
  77. 	ios_base::sync_with_stdio(false);
  78. 	memset(d,-1,sizeof(d));
  79. 	cin>>t;
  80. //	for (int i=0;i<10;i++)
  81. //		for (int j=1;j<=i;j++)
  82. //			cerr<<"fll : "<<i<<","<<j<<" "<<fll(i,j)<<endl;
  83. 	while (t-->0)
  84. 	{
  85. 		int now=0;
  86. 		cin>>n>>k;
  87. 		for (int i=0;i<n;i++)
  88. 		{
  89. 			int a;
  90. 			cin>>a;
  91. 			now^=fll(a,min(a,k));
  92. 		}
  93. 		if (now==0)
  94. 			cout<<"Zeta"<<endl;
  95. 		else
  96. 			cout<<"Nancy"<<endl;
  97. 	}
  98. 	return 0;
  99. }
  100.

Comments