fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. bool is_prime = true;
  5.  
  6. bool isPrime(int n){
  7.     if (n <= 1){
  8.     	return false;
  9.     }
  10.         for (int i = 2; i * i <= n; i++){
  11.             if (n % i == 0){
  12.                 return false;
  13.         } 
  14.     }
  15.     return true;
  16. }
  17.  
  18. int reversed(int n){
  19.     int terbalik = 0;
  20.  
  21.     while (n > 0){
  22.         int sisa = n % 10;
  23.         terbalik = terbalik * 10 + sisa;
  24.         n = n / 10;
  25.     }
  26.     return terbalik;
  27. }
  28.  
  29. int main (){
  30.     int n;
  31.     while (cin >> n) {
  32.         if (!isPrime(n)) {
  33.             cout << n << " is not prime." << endl;
  34.         } else {
  35.             int rev = reversed(n); 
  36.  
  37.             if (rev != n && isPrime(rev)) {
  38.                 cout << n << " is emirp." << endl;
  39.             } else {
  40.                 cout << n << " is prime." << endl;
  41.             }
  42.         } 
  43.     }
  44. }
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
17
18
19
179
199
stdout
copy 
17 is emirp.
18 is not prime.
19 is prime.
179 is emirp.
199 is emirp.
https://ideone.com/MFs5v7
language:
C++ (gcc 8.3)
created:
21 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!