Guest User

Untitled

a guest
Mar 20th, 2018
79
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.81 KB | None | 0 0
  1. #include<stdio.h>
  2. #include<math.h>
  3. int pals[10000000];
  4. int primes[10000000];
  5. void generatePals(){
  6.  
  7. int i,j=0,x;
  8. for(i=10;i<=10000000;i++)
  9. {
  10. int n=0;
  11. x=i;
  12. while(x!=0)
  13. {
  14. n=n*10+x%10;
  15. x/=10;
  16. }
  17.  
  18. if(i==n)
  19. pals[j++]=i;
  20. }
  21.  
  22. }
  23. void generatePrimes()
  24. {
  25. int i,j,k=0;
  26. for(i=2;i<=10000000;i++)
  27. {
  28. int f=0;
  29. for(j=2;j<=sqrt(i);j++)
  30. {
  31. if(i%j==0)
  32. {
  33. f=1;
  34. break;
  35. }
  36. }
  37. if(!f)
  38. primes[k++]=i;
  39. }
  40. }
  41. int main(){
  42.  
  43. printf("generating sequences...");
  44. generatePrimes();
  45. generatePals();
  46. printf("\ngenerated\n");
  47. int t;
  48. scanf("%d",&t);
  49. while(t--)
  50. {
  51. int n,sum=0,i;
  52. scanf("%d",&n);
  53. if(n%2)
  54. {
  55. for(i=0;i<n;i++)
  56. sum=(sum+pals[i])%3333333;
  57. }
  58. else
  59. {
  60. for(i=0;i<n;i++)
  61. sum=(sum+primes[i]*primes[i]*primes[i])%3333333;
  62. }
  63. printf("%d\n",sum);
  64.  
  65. }
  66.  
  67. return 0;
  68.  
  69. }
Add Comment
Please, Sign In to add comment