CF31A.Worms Evolution

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Professor Vasechkin is studying evolution of worms. Recently he put forward hypotheses that all worms evolve by division. There are nn forms of worms. Worms of these forms have lengths a1a_{1} , a2a_{2} , ..., ana_{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 nn ( 3<=n<=1003<=n<=100 ) — amount of worm's forms. The second line contains nn space-separated integers aia_{i} ( 1<=ai<=10001<=a_{i}<=1000 ) — lengths of worms of each form.

输出格式

Output 3 distinct integers ii jj kk ( 1<=i,j,k<=n1<=i,j,k<=n ) — such indexes of worm's forms that ai=aj+aka_{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 aj=aka_{j}=a_{k} .

输入输出样例

  • 输入#1

    5
    1 2 3 5 7
    

    输出#1

    3 2 1
    
  • 输入#2

    5
    1 8 1 5 1
    

    输出#2

    -1
    
首页