НачалоПодразделы
Другие разделы
| 1420. Zipper |
| 1421. Bullet Hole |
| 1422. Oblique Cuboid |
| 1424. Tumble Down |
| 1425. Fish Catch |
| 1426. Rack 'em Up |
| 1427. Huffman Code |
| 1428. Infinite Game |
Дата и время
20/12/2024 22:32:59
1423. Quodigious
Quodigious
ПредрешениеОлимпиадные задачи на английском языке
| 24/06/2010 | Лето 2010 дорешивание ( 5D) |
| 02/07/2010 | Лето 2010 - 5 (D) |
Ограничения: время – 2s/4s, память – 64MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод 
Послать решение Blockly Посылки Темы Где Обсудить (0)
According to Dr. Rich, a quodigious number is a positive decimal number whose digits are
each greater than 1, and which is evenly divisible by both the sum and product of its digits. For
example, 735 is a quodigious number since its digits 7, 3 and 5 are each greater than 1, and 735 is
evenly divisible (with zero remainder) by `7\ *\ 3\ *\ 5\ =\ 105` and `7\ +\ 3\ +\ 5\ =\ 15`. In this program, we
will find and print quodigious numbers.
Input Format
The input consists of one or more positive integers, each representing a number of decimal
digits `n\ <\ 10`.
Output Format
For each number `n` in the input, output all `n`-digit quodigious numbers on successive lines,
followed by an empty line.
Sample Input
1 2 3 4
Sample Output
2 3 4 5 6 7 8 9 24 36 224 432 624 735 2232 3276 4224 6624
