100702: [AtCoder]ABC070 C - Multiple Clocks

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $300$ points

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.


Sample Input 1

2
2
3

Sample 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.


Sample Input 2

5
2
5
10
1000000000000000000
1000000000000000000

Sample Output 2

1000000000000000000

Input

题意翻译

## 题目描述 有N台钟表,第i个钟表的秒针经过T[i]秒绕表盘一周。最初,所有的钟表的秒针都指向上方。某人开始同时顺时针拨动所有时钟的秒针。下一次所有的时钟的秒针都向上是在几秒后? ## 输入 第一行:N; 以下N行:每行一个T[i]。 ## 输出 一行,最少的拨动次数。

加入题单

上一题 下一题 算法标签: