0
Your rating: None

CodeChef submission 198060 (C++ 4.3.2)

CodeChef submission 198060 (C++ 4.3.2) plaintext list. Status: WA, problem AD1, contest ALGOTH10. By codegambler (codegambler), 2010-03-05 13:50:27.
  1. //	Filename:  AD1.cpp 
  2. //	Source: codechef  
  3. //	Author:  pankaj kumar, pankaj4u4m@gmail.com
  4. #include <cassert>//c headers in c++
  5. #include <cctype>
  6. #include <cfloat>
  7. #include <cmath>
  8. #include <cstdarg>
  9. #include <cstdio>
  10. #include <cstdlib>
  11. #include <cstring>
  12. #include <climits>
  13. #include <algorithm>//c++ headers
  14. #include <bitset>
  15. #include <complex>
  16. #include <deque>
  17. #include <functional>
  18. #include <iostream>
  19. #include <iomanip>
  20. #include <iterator>
  21. #include <limits>
  22. #include <list>
  23. #include <map>
  24. #include <memory>
  25. #include <new>
  26. #include <numeric>
  27. #include <queue>
  28. #include <set>
  29. #include <sstream>
  30. #include <stack>
  31. #include <string>
  32. #include <utility>
  33. #include <valarray>
  34. #include <vector>
  35. using namespace std;
  36. /*START OF TEMPLATE:CODEGAMBLER*/
  37. #define VAR(x,a) 		__typeof(a) x=(a)//::VAR(
  38. #define FE(it,c)		for(VAR(it,(c).begin());it!=(c).end();++it)//::FE(
  39. #define FOR(i,a,b)  	for(int i=(int)(a),_b=(int)(b) ; i < _b;++i)//::FOR(
  40. #define FORR(i,a,b) 	for(int i=(a),_b=(b);i>=_b;--i)//::FORR(
  41. #define	REP(i,n)    	FOR(i,0,n)//::REP(
  42. #define ALL(c)		(c).begin(),(c).end()//::ALL(
  43. #define SZ(c)		(int)(c).size()//::SZ(
  44. #define PB      push_back//::PB
  45. #define V(x)    vector< x >//::V(
  46. #define VI      V(int)//::VI
  47. #define VVI     V(VI)//::VII
  48. #define VS      V(string)//::VS
  49. #define PI      pair< int,int >//::PI
  50. #define MP      make_pair//::MP
  51. #define pi      3.14159265358979323846//::pi
  52. #define INF 	2000000000//::INF
  53.  
  54. const double eps=1e-11;//::eps
  55. typedef long long LL;//::LL
  56. typedef unsigned long long ULL;//::ULL
  57. typedef long double LD;//::LD
  58.  
  59. template<class T> inline T lowbit(T n){return (n^(n-1))&n;}//::lowbit(
  60. template<class T> inline int countbit(T n){return (n==0)?0:(1+countbit(n&(n-1)));}//::countbit(
  61. template<class T> inline T sqr(T x){return x*x;}//::sqr
  62. template<class T> inline T gcd(T a,T b)//::gcd(
  63. {if(a<0)return gcd(-a,b);if(b<0)return gcd(a,-b);while (b > 0){a = a % b;a ^= b;b ^= a; a ^= b; } return a;}
  64. template<class T> inline T lcm(T a,T b)//::lcm(
  65. {if(a<0)return lcm(-a,b);if(b<0)return lcm(a,-b);return a*(b/gcd(a,b));}
  66. template<class T> inline T euclide(T a,T b,T &x,T &y)//::euclide(
  67. {if(a<0){T d=euclide(-a,b,x,y);x=-x;return d;}if(b<0){T d=euclide(a,-b,x,y);y=-y;return d;}if(b==0){x=1;y=0;return a;}else{T d=euclide(b,a%b,x,y);T t=x;x=y;y=t-(a/b)*y;return d;}}
  68. template<class T> inline vector<pair<T,int> > factorize(T n)//::factorize(
  69. {vector<pair<T,int> > R;for (T i=2;n>1;){if (n%i==0){int C=0;for (;n%i==0;C++,n/=i);R.push_back(make_pair(i,C));}i++;if (i>n/i) i=n;}if (n>1) R.push_back(make_pair(n,1));return R;}
  70. template<class T> inline T eularFunction(T n)//::eularFunction(
  71. {vector<pair<T,int> > R=factorize(n);T r=n;for (int i=0;i<R.size();i++)r=r/R[i].first*(R[i].first-1);return r;}
  72. template<class T> static void split(const string &s, vector<T> &out)//::split(
  73. {istringstream in(s);out.clear();copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out));}
  74. template<class T> inline T multiplyMod(T a,T b,T m) {return (T)((((LL)(a)*(LL)(b)%(LL)(m))+(LL)(m))%(LL)(m));}//::multiplyMod(
  75. template<class T> inline T powerMod(T p,int e,T m)//::powerMod(
  76. {if(e==0)return 1%m;else if(e%2==0){T t=powerMod(p,e/2,m);return multiplyMod(t,t,m);}else return multiplyMod(powerMod(p,e-1,m),p,m);}
  77.  
  78. /*Point&Line*/
  79. template<class T> T cross(T x0,T y0,T x1,T y1,T x2,T y2){return (x1-x0)*(y2-y0)-(x2-x0)*(y1-y0);}//::cross(
  80. int crossOper(double x0,double y0,double x1,double y1,double x2,double y2)//::crossOper(
  81. {double t=(x1-x0)*(y2-y0)-(x2-x0)*(y1-y0);if (fabs(t)<=eps) return 0;return (t<0)?-1:1;}
  82. bool isIntersect(double x1,double y1,double x2,double y2,double x3,double y3,double x4,double y4)//::isIntersect(
  83. {return crossOper(x1,y1,x2,y2,x3,y3)*crossOper(x1,y1,x2,y2,x4,y4)<0 && crossOper(x3,y3,x4,y4,x1,y1)*crossOper(x3,y3,x4,y4,x2,y2)<0;}
  84. bool isMiddle(double s,double m,double t){return fabs(s-m)<=eps || fabs(t-m)<=eps || (s<m)!=(t<m);}//::isMiddle(
  85.  
  86. /* Only for Debugging */
  87. #define out(__debug) cout << #__debug<< "=" <<__debug << endl;//::out(
  88. template<class T> void outC(T A)//::outContainer
  89. {cout<<"{"; FE(it,A)cout << *it << " " ;cout<<"}"<<endl;}
  90. template<class T> void outA(T A[],int n)//::outArray
  91. { cout<<"{"; for (int i=0;i<n;i++) cout<<A[i]<<" "; cout<<"}"<<endl;}
  92.  
  93. /* Input Output Function */
  94. #define BUFSIZE (1<<26)
  95. char DIP[20];
  96. #ifdef GET
  97. char IBUF[BUFSIZE+1], *inputptr=IBUF;
  98. #define INPUT fread_unlocked(IBUF, 1, BUFSIZE, stdin);//::INPUT
  99. #define DIG(a) (((a)>='0')&&((a)<='9'))//::DIG(
  100. #define getChar(t) {t=*inputptr++;}//::getChar(
  101. template<class T>inline bool getInt(T &j) {j=0;int _t;getChar(_t);if(_t==0)return false;char sign;while(!DIG(_t)&&_t!=0){sign=_t;getChar(_t);}while(DIG(_t)){j=10*j+(_t-'0');getChar(_t);}if(sign == '-') j = -j;*inputptr--;return j==0&&_t==0?false:true;}//::getInt(
  102. inline bool getString(char *s) {char _c;getChar(_c);if(_c==0)return false;while(_c==10||_c==32)getChar(_c);while(_c != 10&&_c != 32&&_c!=0){*s++=_c;getChar(_c)}*s=0;inputptr--;return s[0]==0&&_c==0?false:true;}//::getString(
  103. #endif
  104. #ifdef PUT
  105. char OBUF[BUFSIZE+1], *outputptr=OBUF;
  106. template<class T> inline void putInt(T x, char n=0) {int y, dig=0;while(x){y=x%10;DIP[dig++]=y+'0';x/=10;}while (dig--) *outputptr++=DIP[dig];n?*outputptr++=n:0;}//::putInt(
  107. template<class T> inline void putString(T *s, char n=0){while(*s)*outputptr++=*s++;n?*outputptr++=n:0;}//::putString(
  108. #define putChar(c) {*outputptr++=c;}//::putChar(
  109. #define putLine *outputptr++=10;//::putLine(
  110. #define OUTPUT fputs(OBUF, stdout);//::OUTPUT
  111. #endif
  112. /*END TEMPLATE:CODEGAMBLER*/
  113. bool isPrime(LL n){
  114. 	LL s = sqrt(n)+1;
  115. 	if( n==2) return true;
  116. 	if( n%2 == 0) return false;
  117. 	for( LL i=3;i<=s;i+=2){
  118. 		if( n%i == 0)return false;
  119. 	}
  120. 	return true;
  121. }
  122. int main()
  123. {
  124. //	freopen("AD1.cppin","r",stdin);
  125. 	int T;scanf("%d", &T);
  126. 	while( T-- ){
  127. 		LL n;
  128. 		scanf("%lld", &n);
  129. 		int cnt = 0;
  130. 		if ( n==1 ){
  131. 			printf("NAA ");
  132. 			printf("2 3 5 7 11 13 17 19 23 29\n");
  133. 		}
  134. 		else if (!isPrime(n)){
  135. 			printf("NAA");
  136. 			while(cnt<10){
  137. 				n++;
  138. 				if(isPrime(n)){cnt++;printf("% lld", n);}
  139. 			}
  140. 			printf("\n");
  141. 		}
  142. 		else printf("YEAH\n");
  143. 		printf("\n");
  144. 	}
  145. 	return 0;
  146. }
  147.  
  148.  
  149.

Comments