1
0
Fork 0
mirror of synced 2025-09-23 12:18:44 +00:00

update doc

This commit is contained in:
Thibaut Schaeffer 2017-11-26 15:03:35 +01:00
parent 4fafe84214
commit deaa681620

View file

@ -1,4 +1,6 @@
// Find Waldo = find a non-prime number in a set
// Where's Waldo is a puzzle where the goal is to find Waldo in the picture of a crowd
// In this example, the crowd is a series of numbers, ideally* all prime but one, and Waldo is a non-prime number
// * we don't enforce only one number being non-prime, so there could be multiple Waldos
def isWaldo(a):
// make sure that p and q are both non zero