ГлавнаяСборникиТурнирыРазделыФорумыУчастникиПечатьПомощьО системе

Разделы > Арифметика > задача:


50305 - John's Tasks

Гость
• Вопросы к жюри (1)

Задачи раздела

• 50640 - Cubes
• 50377 - kth Permutation
• 50341 - Separate Into Digits
• 50424 - Area
• 50335 - Five Math Operators
• 50299 - Median
• 50301 - Fractions to Decimals
• 50304 - Number Pattern
• 50305 - John's Tasks
• 50649 - Puzzle
• 50321 - Missing Number
• 50308 - IT Knowledge Seminars
• 50310 - Kinetic Energy
• 50314 - Falling Distance
• 50316 - Population Bar Chart
• 50530 - Sum of Ratios
• 50384 - Permutations revisited

Обратная связь

Если у вас есть предложения или пожелания по работе Contester, посетите форум сайта www.contester.ru.

Лимит времени 2000/4000/4000/4000 мс. Лимит памяти 65000/65000/65000/65000 Кб.
Prepared by Geri Gokaj.

John's Tasks

John is a married man. His wife is asking him to do N-tasks every N[a] days.

For example: He should wash the car every 3 days. Water the flowers every 2 days etc.

The user will be given the frequency of every tasks.

We accept that he performed all the tasks today. You need to write a program to find out after how many days he will perform all the tasks again in one day.

Input specification
-In the first line, you will enter the number of tasks(N) -In the following line, N integer numbers that represent the frequency of each task.

Output specification
The first day after today where he has to perform all the tasks again.

Sample Input I
4
3 2 4 5
Sample Input II
3
2 1 3
Sample Input III
8
3 5 7 11 13 17 21 20
Sample Output I
60
Sample Output II
6
Sample Output III
1021020


Для отправки решений необходимо выполнить вход.

www.contester.ru