
David W. answered 05/12/16
Tutor
4.7
(90)
Experienced Prof
"Find all the possible" suggests a process called "exhaustive iteration" (that is, consider all possible values and determine whether the criteria is true).
Often, problems of this type do not allow leading zeros, so that should be considered.
LET O = 0 TO 9
LET N = 0 TO 9
LET E = 0 TO 9
LET T = 0 TO 9
LET W = 0 TO 9
IF (2*(100*O+10*N+E)=(100*T+10*W+O) THEN OUTPUT (O,N,E,T,W,O)
NEXT W
NEXT T
NEXT E
NEXT N
NEXT O
The results are:
O N E T W O
------- ----------
0 0 0 0 0 0
0 0 5 0 1 0
0 1 0 0 2 0
0 1 5 0 3 0
0 2 0 0 4 0
0 2 5 0 5 0
0 3 0 0 6 0
0 3 5 0 7 0
0 4 0 0 8 0
0 4 5 0 9 0
0 5 0 1 0 0
0 5 5 1 1 0
0 6 0 1 2 0
0 6 5 1 3 0
0 7 0 1 4 0
0 7 5 1 5 0
0 8 0 1 6 0
0 8 5 1 7 0
0 9 0 1 8 0
0 9 5 1 9 0
2 0 1 4 0 2
2 0 6 4 1 2
2 1 1 4 2 2
2 1 6 4 3 2
2 2 1 4 4 2
2 2 6 4 5 2
2 3 1 4 6 2
2 3 6 4 7 2
2 4 1 4 8 2
2 4 6 4 9 2
2 5 1 5 0 2
2 5 6 5 1 2
2 6 1 5 2 2
2 6 6 5 3 2
2 7 1 5 4 2
2 7 6 5 5 2
2 8 1 5 6 2
2 8 6 5 7 2
2 9 1 5 8 2
2 9 6 5 9 2
4 0 2 8 0 4
4 0 7 8 1 4
4 1 2 8 2 4
4 1 7 8 3 4
4 2 2 8 4 4
4 2 7 8 5 4
4 3 2 8 6 4
4 3 7 8 7 4
4 4 2 8 8 4
4 4 7 8 9 4
4 5 2 9 0 4
4 5 7 9 1 4
4 6 2 9 2 4
4 6 7 9 3 4
4 7 2 9 4 4
4 7 7 9 5 4
4 8 2 9 6 4
4 8 7 9 7 4
4 9 2 9 8 4
4 9 7 9 9 4
0 0 5 0 1 0
0 1 0 0 2 0
0 1 5 0 3 0
0 2 0 0 4 0
0 2 5 0 5 0
0 3 0 0 6 0
0 3 5 0 7 0
0 4 0 0 8 0
0 4 5 0 9 0
0 5 0 1 0 0
0 5 5 1 1 0
0 6 0 1 2 0
0 6 5 1 3 0
0 7 0 1 4 0
0 7 5 1 5 0
0 8 0 1 6 0
0 8 5 1 7 0
0 9 0 1 8 0
0 9 5 1 9 0
2 0 1 4 0 2
2 0 6 4 1 2
2 1 1 4 2 2
2 1 6 4 3 2
2 2 1 4 4 2
2 2 6 4 5 2
2 3 1 4 6 2
2 3 6 4 7 2
2 4 1 4 8 2
2 4 6 4 9 2
2 5 1 5 0 2
2 5 6 5 1 2
2 6 1 5 2 2
2 6 6 5 3 2
2 7 1 5 4 2
2 7 6 5 5 2
2 8 1 5 6 2
2 8 6 5 7 2
2 9 1 5 8 2
2 9 6 5 9 2
4 0 2 8 0 4
4 0 7 8 1 4
4 1 2 8 2 4
4 1 7 8 3 4
4 2 2 8 4 4
4 2 7 8 5 4
4 3 2 8 6 4
4 3 7 8 7 4
4 4 2 8 8 4
4 4 7 8 9 4
4 5 2 9 0 4
4 5 7 9 1 4
4 6 2 9 2 4
4 6 7 9 3 4
4 7 2 9 4 4
4 7 7 9 5 4
4 8 2 9 6 4
4 8 7 9 7 4
4 9 2 9 8 4
4 9 7 9 9 4