problem243.py 459 B

1234567891011121314151617181920212223242526272829
  1. #!/usr/bin/env python
  2. def is_resilient(n, d):
  3. if n == 1:
  4. return True
  5. for div in xrange(2, min(n, d) + 1):
  6. if not n % div and not d % div:
  7. return False
  8. return True
  9. def resilience(d):
  10. r = 0
  11. for n in xrange(1, d):
  12. if is_resilient(n, d):
  13. r += 1
  14. return r / (d - 1.)
  15. smallest = 15499. / 94744
  16. d = 2
  17. while True:
  18. if resilience(d) < smallest:
  19. print d
  20. break
  21. d += 1