Multiple Clocks

AtCoder

IDabc070_c

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

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

API Response (JSON)

{
  "problem": {
    "name": "Multiple Clocks",
    "description": {
      "content": "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",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc070_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "We have $N$ clocks. The hand of the $i$\\-th clock $(1≤i≤N)$ rotates through $360°$ in exactly $T_i$ seconds.  \nInitially, the hand of every clock stands still, pointing directly upward.  \nNow, Dolphin...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments