UVa 640

From Algorithmist
Jump to navigation Jump to search
This is a stub or unfinished. Contribute by editing me.

Explanation[edit]

The problem is pretty easy. Simply calculate d(n) from n=1 to n=1000000 and "unselect" all results in an array form 1 to 1000000. The rest is the result magnitude.

Output[edit]

1
3
5
7
9
20
31
42
53
64
 |
 |       <-- a lot more numbers
 |
9903
9914
9925
9927
9938
9949
9960
9971
9982
9993
 |
 |
 |

Solutions[edit]