标签:
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 4322 Accepted Submission(s):
1489
3 1 100 2 2 3 19
Case #1: 14 Case #2: 1 Case #3: 4
1 #include<stdio.h> 2 const int N = 1000000; 3 int biao[1000001],coun[1000001]; 4 int main() 5 { 6 int i; 7 for(i=2;i<N;i++) 8 { 9 biao[i]=1; 10 } 11 for(i=2;i<N;i++) 12 { 13 if(biao[i]==1) 14 { 15 int j; 16 for(j=2*i;j<N;j+=i) 17 { 18 biao[j]=0; 19 } 20 } 21 } 22 int total=0; 23 for(i=2;i<N;i++) 24 { 25 if(biao[i]==1) 26 { 27 int temp=i,sum=0; 28 while(temp) 29 { 30 sum+=temp%10; 31 temp/=10; 32 } 33 if(biao[sum]==1) 34 total++; 35 } 36 coun[i]=total; 37 } 38 int m; 39 scanf("%d",&m); 40 for(i=1;i<=m;i++) 41 { 42 int a,b; 43 scanf("%d %d",&a,&b); 44 printf("Case #%d: %d\n",i,coun[b]-coun[a-1]); 45 } 46 return 0; 47 }
标签:
原文地址:http://www.cnblogs.com/fengshun/p/4572812.html