fork(2) download
copy 
  1. # your code goes here
  2. def isprime(n) : 
  3.  
  4.     if (n <= 1) :
  5.         return False
  6.     if (n <= 3) :
  7.         return True
  8.  
  9.  
  10.     if (n % 2 == 0 or n % 3 == 0) : 
  11.         return False
  12.  
  13.     i = 5
  14.     while(i * i <= n) : 
  15.         if (n % i == 0 or n % (i + 2) == 0) : 
  16.             return False
  17.         i = i + 6
  18.  
  19.     return True
  20.  
  21.  
  22.  
  23. n1, n2 = map(int, input().split())
  24. a = []
  25. e = 0
  26. g = 0
  27. j = 0
  28. k = []
  29. #if(n1 == 2):
  30.     #a.append(n1)
  31. for i in range(n1, n2+1):
  32.     if(isprime(i) == True):
  33.         a.append(i)
  34. #print(a)
  35. #print(len(a))
  36. b = []
  37. s = ''
  38. for i in range(len(a)):
  39.     for j in range(len(a)):
  40.         if(a[i] != a[j]):
  41.             s = str(a[i])+str(a[j])
  42.             b.append(int(s))
  43.             s = ''
  44. b = set(b)
  45. b = list(b)
  46. c = []
  47. #print(b)
  48. #print(len(b))
  49. for i in range(len(b)):
  50.     if(isprime(b[i]) == True):
  51.         c.append(b[i])
  52. #print(c)
  53. #print(len(c))
  54. c.sort()
  55. e = c[0]
  56. g = c[-1]
  57. h = len(c)
  58. #print(e,g)
  59. for i in range(2,h):
  60.     j = e+g
  61.     e = g
  62.     g = j
  63.     #k.append(j)
  64. #if(j > 10**15):
  65.  #   j = j%mod
  66. print(j)
  67.  
Success #stdin #stdout 0.02s 9320KB
comments (?)
stdin
copy 
2 40
stdout
copy 
13158006689
https://ideone.com/CEZzOc
language:
Python 3 (python  3.9.5)
created:
3 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!