← 返回题目

题库练习 Worms Evolution

← 上一题下一题 →

A7964 | $Worms Evolution$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Professor Vasechkin is studying evolution of worms. Recently he put forward hypotheses that all worms evolve by division. There are $n$ forms of worms. Worms of these forms have lengths $a_{1}$ , $a_{2}$ , ..., $a_{n}$ . To prove his theory, professor needs to find 3 different forms that the length of the first form is equal to sum of lengths of the other two forms. Help him to do this.

输入格式

The first line contains integer $n$ ( $3<=n<=100$ ) — amount of worm's forms. The second line contains $n$ space-separated integers $a_{i}$ ( $1<=a_{i}<=1000$ ) — lengths of worms of each form.

输出格式

Output 3 distinct integers $i$ $j$ $k$ ( $1<=i,j,k<=n$ ) — such indexes of worm's forms that $a_{i}=a_{j}+a_{k}$ . If there is no such triple, output -1. If there are several solutions, output any of them. It possible that $a_{j}=a_{k}$ .

输入输出样例

输入 #1

5
1 2 3 5 7

输出 #1

3 2 1

输入 #2

5
1 8 1 5 1

输出 #2

-1

C++ 编辑器

输入

输出