fork download
copy 
  1. def divisors(n):
  2.     d = set([1, n])
  3.     i = 2
  4.     while i**2 <= n:
  5.         q, r = divmod(n, i)
  6.         if r == 0:
  7.             d.add(i)
  8.             d.add(q)
  9.         i += 1
  10.     return d
  11.  
  12. def condition(s):
  13.     return s % 100 // 10 == 7
  14.  
  15. n = 500001
  16. k = 5
  17.  
  18. while k:
  19.     s = sum(divisors(n))
  20.     if condition(s):
  21.         print(n, s)
  22.         k -= 1
  23.     n += 1
Success #stdin #stdout 0.07s 9552KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
500001 666672
500048 968874
500069 500070
500079 666776
500114 750174
https://ideone.com/4rqoif
language:
Python 3 (python  3.9.5)
created:
321 days 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!