- 07 11月, 2020 1 次提交
-
-
由 Ravi Kandasamy Sundaram 提交于
Name: Prime square remainders Let pn be the nth prime: 2, 3, 5, 7, 11, ..., and let r be the remainder when (pn−1)^n + (pn+1)^n is divided by pn^2. For example, when n = 3, p3 = 5, and 43 + 63 = 280 ≡ 5 mod 25. The least value of n for which the remainder first exceeds 10^9 is 7037. Find the least value of n for which the remainder first exceeds 10^10. Reference: https://projecteuler.net/problem=123 reference: #2695 Co-authored-by: NRavi Kandasamy Sundaram <rkandasamysundaram@luxoft.com>
-
- 29 9月, 2020 1 次提交
-
-
由 Dhruv 提交于
-
- 17 7月, 2019 1 次提交
-
-
由 Bruno Simas Hadlich 提交于
* Added doctest and more explanation about Dijkstra execution. * tests were not passing with python2 due to missing __init__.py file at number_theory folder * Removed the dot at the beginning of the imported modules names because 'python3 -m doctest -v data_structures/hashing/*.py' and 'python3 -m doctest -v data_structures/stacks/*.py' were failing not finding hash_table.py and stack.py modules. * Moved global code to main scope and added doctest for project euler problems 1 to 14. * Added test case for negative input. * Changed N variable to do not use end of line scape because in case there is a space after it the script will break making it much more error prone. * Added problems description and doctests to the ones that were missing. Limited line length to 79 and executed python black over all scripts. * Changed the way files are loaded to support pytest call. * Added __init__.py to problems to make them modules and allow pytest execution. * Added project_euler folder to test units execution * Changed 'os.path.split(os.path.realpath(__file__))' to 'os.path.dirname()'
-
- 19 1月, 2019 1 次提交
-
-
由 Matheus Guimarães 提交于
-
- 25 10月, 2017 1 次提交
-
-
由 97arushisharma 提交于
-
- 10 10月, 2016 1 次提交
-
- 09 10月, 2016 1 次提交
-