fork download
  1. #include<stdio.h>
  2. int main() {
  3. int i,n,j,test,re=0;
  4. while(scanf("%d", &test) != EOF) {
  5. int tmp = test,cnt = 0,h;
  6.  
  7. h = test/10; //個位數
  8.  
  9. if (test == 11) { //11
  10. cnt = 2;
  11. }
  12.  
  13. for(i=2;i<tmp;i++) { //測試是否為prime
  14. if(tmp%i != 0) {
  15. cnt = 1;
  16. }else{
  17. cnt = 0;
  18. break;
  19. }
  20. }
  21.  
  22.  
  23. if (cnt == 1 && test != 11 && h != 0) { //11和個位數不討論
  24.  
  25. while(test) { //反轉
  26. re *= 10;
  27. re += test%10;
  28. test /= 10;
  29. }
  30.  
  31. for(i=2;i<re;i++) { //判斷是否為emirp
  32. if(re%i != 0)
  33. cnt = 2;
  34. else{
  35. cnt = 1;
  36. break;
  37. }
  38. }
  39. }
  40.  
  41. if (cnt == 2)
  42. printf("%d is emirp.\n", tmp);
  43. if (cnt == 1)
  44. printf("%d is prime.\n", tmp);
  45. if (cnt == 0)
  46. printf("%d is not prime.\n", tmp);
  47. }
  48. }
Success #stdin #stdout 0s 9424KB
stdin
10
5
9
8
4
3
2
7
2
10
5
5
7
8
5
9
4
4
10
94
61
28
66
57
99
45
71
38
59
59
83
73
53
17
11
stdout
10 is not prime.
5 is prime.
9 is not prime.
8 is not prime.
4 is not prime.
3 is prime.
2 is not prime.
7 is prime.
2 is not prime.
10 is not prime.
5 is prime.
5 is prime.
7 is prime.
8 is not prime.
5 is prime.
9 is not prime.
4 is not prime.
4 is not prime.
10 is not prime.
94 is not prime.
61 is prime.
28 is not prime.
66 is not prime.
57 is not prime.
99 is not prime.
45 is not prime.
71 is prime.
38 is not prime.
59 is prime.
59 is prime.
83 is prime.
73 is prime.
53 is prime.
17 is prime.
11 is prime.