|
Project Euler Solutions
|
Functions | |
| def | main () |
Project Euler Problem 206 This one ended up being a regex problem. I am sure there is a more clever way to go about it, but this way works fairly quickly. Problem: Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each “_” is a single digit.
| def python.p0206.main | ( | int | ) |
1.8.11