fork download
copy 
  1. def isPrime(n):
  2.     if (n<=2):
  3.         return True
  4.     if n%2==0:
  5.         return False
  6.     else:
  7.         k=3
  8.         while(k<n//2):
  9.             if (n%k)==0:
  10.                 return False
  11.             k+=2
  12.         return True
  13.  
  14. def isHyperPrime(n):
  15.     if not isPrime(n):
  16.         return False
  17.     else:
  18.         while(True):
  19.             if (n==0):
  20.             	break
  21.             n=n//10
  22.             if not isPrime(n):
  23.             	return False
  24.         return True
  25.  
  26.  
  27. n=int(input())
  28. if isHyperPrime(n):
  29.     print("Число гиперпростое")
  30. else:
  31. 	if isPrime(n):
  32. 	    print("Число простое, но не гиперпростое")
  33. 	else:
  34. 	    print("Число составное")
  35.  
Success #stdin #stdout 0.02s 27704KB
comments (?)
stdin
copy 
97
stdout
copy 
Число простое, но не гиперпростое
https://ideone.com/3IMuIV
language:
Python 3 (python  3.12)
created:
6 years 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!