fork download
copy 
  1. import sys
  2. def sieve(n):
  3.     z = [1] * n
  4.     z[1] = 0
  5.     for i in range(2,n/2):
  6.             j = 2 * i
  7.             while j < n:
  8.                     z[j]=0
  9.                     j = j+i
  10.     return z
  11.  
  12. def prime(n,z):
  13.     i = 1
  14.     j = 1
  15.     while j <= n:
  16.             if z[i] == 1:
  17.                     j = j + 1
  18.             i = i + 1
  19.     return i - 1
  20. z=sieve(10000)
  21. code = [1206,301,384,5]
  22. key =[1,1,2,2,]
  23.  
  24. sys.stdout.write("".join(chr(i) for i in [73,83,66,78,32,61,32]))
  25. for i in range (0,4):
  26.     sys.stdout.write(str(prime(code[i],z)-key[i]))
  27.  
  28. print
Success #stdin #stdout 0.02s 7840KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
ISBN = 9780199226559
https://ideone.com/dGhHGF
language:
Python (cpython 2.7.16)
created:
10 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!