CT22689

The First Repeat of the Ivory stamps

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Tracker found an old ledger of stamps in the exchange attic at the anvil district of Hammerfall. The margin notes pose a precise question. Task: Read n integers and print the first value that appears twice (the value whose second occurrence has the smallest index). If all are distinct print -1. Input format: First line: n. Second line: n space-separated integers. Output format: Print the first repeated value, or -1. Constraints: 1 <= n <= 572; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.

Example 1:

Input: 489 9 8 10 10 5 10 3 2 9 0 6 10 9 4 9 6 8 7 7 7 6 0 5 2 0 3 10 2 6 9 7 10 5 6 6 0 2 0 9 3 7 1 4 5 0 10 1 10 10 2 7 4 5 3 1 3 1 8 5 9 1 5 1 7 9 1 4 6 7 10 6 2 8 9 0 1 2 4 1 8 3 6 10 9 10 9 6 2 4 6 3 6 7 7 0 3 5 8 2 7 4 4 6 0 8 10 6 10 7 6 8 0 0 5 4 0 4 8 4 4 7 6 4 8 10 8 2 7 2 4 3 1 1 9 9 10 0 3 7 4 2 7 7 7 2 6 4 4 6 8 3 4 6 2 6 8 5 3 10 1 1 5 5 2 5 10 6 9 6 10 5 1 8 5 7 2 3 0 10 4 7 4 10 1 2 7 9 8 9 7 9 10 5 0 1 0 7 8 3 0 2 8 9 3 3 4 1 4 8 4 9 4 0 8 0 3 1 7 7 4 5 3 6 7 7 6 7 9 4 6 9 2 1 6 0 4 10 5 10 9 2 8 7 6 4 10 8 2 1 0 9 7 5 9 8 7 1 1 3 1 4 7 3 1 5 9 2 7 1 9 7 3 10 8 8 10 3 0 1 4 0 5 6 2 10 10 4 1 7 1 9 0 4 2 9 0 1 3 8 5 2 9 10 0 7 3 9 4 10 0 7 8 1 1 4 1 5 2 4 8 1 5 2 5 2 8 5 2 0 1 1 7 0 0 8 2 8 10 10 0 4 8 1 7 6 5 1 7 6 0 4 9 7 7 5 4 6 9 5 6 6 0 3 0 10 4 4 6 0 3 2 5 6 1 1 0 4 9 1 0 3 9 2 9 5 4 4 9 2 5 7 4 8 2 3 2 10 8 1 6 3 7 0 5 1 2 10 1 2 7 1 0 5 2 3 10 5 10 1 1 2 7 5 3 9 3 2 3 9 1 10 6 1 10 7 6 2 10 5 3 1 9 0 4 9 9 3 3 7 8 0 10 2 6 7 4 2 2 3 4 0 8 2 10 7 2 10 3 0 0 0 4 6 8 3 4 8 3 2 3 4 3 5 3 7 2 6 3 1
Output: 10

Example 2:

Input: 206 9 6 0 10 10 4 0 6 6 10 4 10 6 9 5 5 3 9 9 6 6 9 3 0 7 2 0 5 7 7 1 9 7 6 4 0 5 3 3 2 7 8 0 1 4 3 5 4 1 8 5 3 8 4 8 1 9 1 0 5 8 6 7 9 6 4 6 6 10 6 4 9 1 9 3 8 7 6 5 1 9 3 1 8 4 5 3 5 7 10 2 0 8 8 8 0 5 8 6 6 3 3 7 10 0 7 9 6 4 1 8 7 7 8 10 0 10 1 9 1 6 3 10 7 0 7 6 3 2 5 2 7 6 5 9 10 7 0 1 2 5 9 9 4 1 5 10 2 6 1 0 1 9 0 5 9 10 3 2 9 6 1 2 7 9 0 9 6 0 6 7 7 3 7 8 5 3 0 10 3 10 3 9 6 6 7 7 5 3 10 10 8 8 3 2 2 0 8 5 7 3 1 7 5 6 1
Output: 10

Example 3:

Input: 62 10 6 1 7 3 3 7 7 5 7 5 6 8 10 10 2 5 0 7 10 4 7 1 10 5 2 0 9 6 10 5 3 10 1 9 5 8 9 8 4 1 2 4 9 8 10 0 7 2 7 7 2 10 8 3 8 6 0 4 0 0 10
Output: 3

Constraints:

1 <= n <= 572; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.

Loading...
Test Cases:No test cases
No test cases available.