HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Contests > Epoka Science Olympiad 2013-2015 > problem:


2015-11Gr-20. 50305 - John's Tasks

Epoka Science Olympiad 2013-2015

Start: May.18.2013 at 10:00:00 AM
Finish: May.18.2013 at 03:00:00 PM
The contest is finished!
• Contest scoreboard

Guest
• Review clarifications (1)

Contest problems

• 2014-11Gr-30. 50431 - Sultan's Game
• 2015-09Gr-10. 50344 - Profit or Loss
• 2015-09Gr-20. 50725 - Fibonacci Se...
• 2015-09Gr-30. 50302 - Paper Sciss...
• 2015-09Gr-40. 50303 - Pattern
• 2015-10Gr-10. 50308 - IT Knowledg...
• 2015-10Gr-40. 50322 - Snake Pattern
• 2015-11Gr-10. 50304 - Number Pattern
• 2015-11Gr-20. 50305 - John's T...
• 2015-11Gr-30. 50306 - Beautiful N...
• 2015-11Gr-40. 50307 - Palindromes
• 6-P2. 50882 - Say Hello

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
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