| Submeter | Todas submissőes | Melhores | Voltar |
|
Problem hidden
DIV2 - Divisors 2 |
Let N be a positive integer and d(N) be the number of positive divisors of N including 1 and N. Your task is to compute all N in [1, 106] for which d(N) > 3 and if M divides N then d(M) divides d(N) too.
Input
None.
Output
To make the problem less output related write out only every 108-th of them, one per line.
Example
Output: 267 511 753 ... 999579 999781 999977
| Adicionado por: | czylabsonasa |
| Data: | 2005-05-24 |
| Tempo limite: | 1s |
| Tamanho do fonte: | 3333B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Linguagem permitida: | Todas exceto: ASM64 CLOJURE ERL FSHARP PERL6 PY_NBC SCALA TCL |
| Origem: | Folklore |