摘要：
1 bool prime[maxn]; 2 void set() 3 { 4 memset(prime,true,sizeof(prime)); 5 int tmp; 6 for(int i=3;i<maxn;i++){ 7 tmp=(i+1)/2; 8 for(int j=2;j<=tmp;j++ 阅读全文
posted @ 2016-02-02 00:11
Sunny糖果
阅读(192)
评论(0)
推荐(0)
摘要：
Prime Cuts Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2171 Accepted Submission(s): 929 Prob 阅读全文
posted @ 2016-02-02 00:09
Sunny糖果
阅读(228)
评论(0)
推荐(0)
浙公网安备 33010602011771号