HDOJ5522Numbers

最新推荐文章于 2020-02-12 14:43:20 发布

飘摇的尘土

最新推荐文章于 2020-02-12 14:43:20 发布

阅读量415

点赞数

分类专栏：杭电oj hash 文章标签： HDOJ5522Numbers

本文链接：https://blog.csdn.net/R1986799047/article/details/49538881

版权

杭电oj 同时被 2 个专栏收录

105 篇文章 0 订阅

订阅专栏

hash

5 篇文章 0 订阅

订阅专栏

Numbers

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/262144 K (Java/Others)
Total Submission(s): 88 Accepted Submission(s): 67

Problem Description

There are n numbers

A1,A2....An ,your task is to check whether there exists there different positive integers i, j, k (

1≤i,j,k≤n ) such that

Ai−Aj=Ak

Input

There are multiple test cases, no more than 1000 cases.
First line of each case contains a single integer n.

(3≤n≤100) .
Next line contains n integers

A1,A2....An .

(0≤Ai≤1000)

Output

For each case output "YES" in a single line if you find such i, j, k, otherwise output "NO".

Sample Input

Sample Output

  
  
   
   YES
NO
YES

Source

BestCoder Round #61 (div.2)

Recommend

hujie

#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
int vis[2010];
int num[110];
int main()
{
    int i,j,k=1,n;
    while(scanf("%d",&n)!=EOF){
        memset(vis,0,sizeof(vis));
        for(i=0;i<n;++i){
            scanf("%d",&num[i]);
            vis[num[i]]++;
        }
        int flag=0;
        for(i=0;i<n&&flag==0;++i){
            for(j=0;j<n&&flag==0;++j){
                if(i==j)continue;
                if(vis[num[i]+num[j]]){
                    vis[num[i]]--;
                    vis[num[j]]--;
                    if(vis[num[i]+num[j]]){
                        flag=1;break;
                    }
                    vis[num[i]]++;
                    vis[num[j]]++;
                }
            }
        }
        if(flag){
            printf("YES\n");
        }
        else {
            printf("NO\n");
        }
    }
    return 0;
}