fork download
  1. #include <iostream>
  2. #include <string>
  3. #include <algorithm>
  4. using namespace std;
  5. bool NOTprime (long long int p){
  6. int prime = p==1? 0 : 1;
  7. for(int i=2; i< p ; i++)
  8. if( p%i == 0 )
  9. prime = 0;
  10. return !prime;
  11. }
  12. bool NOTpal (long long int p) {
  13. char x[100];
  14. sprintf(x,"%lld",p);
  15. string s1=x,s2=x;
  16. reverse(s1.begin(),s1.end());
  17. return s1 != s2 ;
  18. }
  19.  
  20. int main() {
  21. long long int p;
  22. cin>>p;
  23. for( ; NOTprime( p ) || NOTpal( p ) ; p++) ;
  24. cout<< p<<endl;
  25. return 0;
  26. }
Success #stdin #stdout 0s 15240KB
stdin
68
stdout
101