AtCoder Beginner Contest 070
翻译中…
Problem Statement
翻译中…
We have $N$ clocks. The hand of the $i$-th clock $(1≤i≤N)$ rotates through $360°$ in exactly $T_i$ seconds.
Initially, the hand of every clock stands still, pointing directly upward.
Now, Dolphin starts all the clocks simultaneously.
In how many seconds will the hand of every clock point directly upward again?
翻译中…
Constraints
翻译中…
$1≤N≤100$$1≤T_i≤10^{18}$- All input values are integers.
- The correct answer is at most
$10^{18}$seconds.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
N
T_1
:
T_N翻译中…
Output
翻译中…
Print the number of seconds after which the hand of every clock point directly upward again.
翻译中…
样例
Input #1
2
2
3
Output #1
6
We have two clocks. The time when the hand of each clock points upward is as follows:
- Clock $1$: $2$, $4$, $6$, $...$ seconds after the beginning
- Clock $2$: $3$, $6$, $9$, $...$ seconds after the beginning
Therefore, it takes $6$ seconds until the hands of both clocks point directly upward.
Input #2
5
2
5
10
1000000000000000000
1000000000000000000
Output #2
1000000000000000000
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。