fork(1) download
copy 
  1. def isPrime(X):
  2.     x = str(X)
  3.     n = 2
  4.     i = 0
  5.     d = 10
  6.     while X >= n:
  7.         i += 1
  8.         n *= 10
  9.     if i == 3:
  10.         num = int(x[i-1])
  11.         if num % 2 != 0:
  12.             D = X // 10
  13.             if D % 2 != 0:
  14.                print("Да, число гиперпростое.")
  15.  
  16.         else:
  17.            print("Нет, число не гиперпростое.")
  18.  
  19. isPrime(735)
Success #stdin #stdout 0.01s 27704KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Да, число гиперпростое.
https://ideone.com/RXqvCV
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!