According to my program the first 100 ugly numbers are:
1
2
3
4
5
6
8
9
10
12
15
16
18
20
24
25
27
30
32
36
40
45
48
50
54
60
64
72
75
80
81
90
96
100
108
120
125
128
135
144
150
160
162
180
192
200
216
225
240
243
250
256
270
288
300
320
324
360
375
384
400
405
432
450
480
486
500
512
540
576
600 ...
Search found 2 matches
- Wed Jun 07, 2006 3:29 pm
- Forum: Volume 1 (100-199)
- Topic: 135 - No Rectangles
- Replies: 24
- Views: 10651
- Tue Apr 25, 2006 2:53 pm
- Forum: Volume 8 (800-899)
- Topic: 847 - A Multiplication Game
- Replies: 41
- Views: 28227
847 Problem with the logic
The first time I read the problem I thought:
Let's call "p" the number in which we are right now and "n" the number I want to reach.
The first move I always must try is the biggest number available (i.e. 9)
If I can't win using the biggest number then:
I try the next biggest number "m" in which p ...
Let's call "p" the number in which we are right now and "n" the number I want to reach.
The first move I always must try is the biggest number available (i.e. 9)
If I can't win using the biggest number then:
I try the next biggest number "m" in which p ...