Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
числа близнецы
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
Bisection method
metods.py
3-6.격자판 최대합
Ugly number
Binary number into Decimal
Lesson 6 part 3
on_off
total_tips
restraunt score
Nearest Prime Number