Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<math.h>
- int pals[10000000];
- int primes[10000000];
- void generatePals(){
- int i,j=0,x;
- for(i=10;i<=10000000;i++)
- {
- int n=0;
- x=i;
- while(x!=0)
- {
- n=n*10+x%10;
- x/=10;
- }
- if(i==n)
- pals[j++]=i;
- }
- }
- void generatePrimes()
- {
- int i,j,k=0;
- for(i=2;i<=10000000;i++)
- {
- int f=0;
- for(j=2;j<=sqrt(i);j++)
- {
- if(i%j==0)
- {
- f=1;
- break;
- }
- }
- if(!f)
- primes[k++]=i;
- }
- }
- int main(){
- printf("generating sequences...");
- generatePrimes();
- generatePals();
- printf("\ngenerated\n");
- int t;
- scanf("%d",&t);
- while(t--)
- {
- int n,sum=0,i;
- scanf("%d",&n);
- if(n%2)
- {
- for(i=0;i<n;i++)
- sum=(sum+pals[i])%3333333;
- }
- else
- {
- for(i=0;i<n;i++)
- sum=(sum+primes[i]*primes[i]*primes[i])%3333333;
- }
- printf("%d\n",sum);
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment