← 返回题目

题库练习 Minimum Possible LCM

← 上一题下一题 →

A12472 | $Minimum Possible LCM$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given an array $a$ consisting of $n$ integers $a_1, a_2, \dots, a_n$ . Your problem is to find such pair of indices $i, j$ ( $1 \le i < j \le n$ ) that $lcm(a_i, a_j)$ is minimum possible. $lcm(x, y)$ is the least common multiple of $x$ and $y$ (minimum positive number such that both $x$ and $y$ are divisors of this number).

输入格式

The first line of the input contains one integer $n$ ( $2 \le n \le 10^6$ ) — the number of elements in $a$ . The second line of the input contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 10^7$ ), where $a_i$ is the $i$ -th element of $a$ .

输出格式

Print two integers $i$ and $j$ ( $1 \le i < j \le n$ ) such that the value of $lcm(a_i, a_j)$ is minimum among all valid pairs $i, j$ . If there are multiple answers, you can print any.

输入输出样例

输入 #1

5
2 4 8 3 6

输出 #1

1 2

输入 #2

5
5 2 11 3 7

输出 #2

2 4

输入 #3

6
2 5 10 1 10 2

输出 #3

1 4

C++ 编辑器

输入

输出