Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
числа близнецы
i = 2 pre = 1000 count_para = 0 flag = True for n in range(pre+1, pre+9000): while flag and (i < n): if n % i == 0: flag = False i += 1 if flag: if n - pre <= 2: print (pre, n, n-pre) count_para += 1 pre = n flag = True i = 2 print ('total', count_para)
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
4
Lesson3 part 2
standardization
max area rectangle
Faiha - Selection Sort
teste
Palindrome using recursion
shuru9
Iterator-1
isStrong.py
Please log in to post a comment.