BestCoder Round #61 (div.2)

来源：互联网发布：linux 屏幕测试编辑：程序博客网时间：2024/05/02 04:27

#include<iostream>#include<cstring>#include<cstdio>#include<cmath>#include<algorithm>#include<cstdlib>#include<map>#include<queue>#include <deque>#include <list>#include <ctime>#include <stack>#include <vector>#include<set>#define Maxn 128#define MODtypedef long long ll;#define FOR(i,j,n) for(int i=j;i<=n;i++)#define DFR(i,j,k) for(int i=j;i>=k;--i)#define lowbit(a) a&-a#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1const int inf = 0x3f3f3f3f;const double pi = acos(-1.0);using namespace std;int n;int A[Maxn];int flag,i,j,k;int main(){   while(~scanf("%d",&n))    {   flag=0;        for(i=1;i<=n;i++)        scanf("%d",&A[i]);        sort(A+1,A+1+n);        for(i=1;i<=n;i++)        {   if(flag)break;        for(j=i+1;j<=n;j++){if(flag)break;        for(k=j+1;k<=n;k++)        {   if(flag)break;            if(A[i]+A[j]==A[k]){          //  printf("%d %d %d\n",i,j,k);            flag=1;}        }        }        }if(flag)        printf("YES\n");        else printf("NO\n");    }    return 0;}

#include<iostream>#include<cstring>#include<cstdio>#include<cmath>#include<algorithm>#include<cstdlib>#include<map>#include<queue>#include <deque>#include <list>#include <ctime>#include <stack>#include <vector>#include<set>#define Maxn#define MODtypedef long long ll;#define FOR(i,j,n) for(int i=j;i<=n;i++)#define DFR(i,j,k) for(int i=j;i>=k;--i)#define lowbit(a) a&-a#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1const int inf = 0x3f3f3f3f;const double pi = acos(-1.0);using namespace std;int n,s,t;int main(){   while(~scanf("%d%d%d",&n,&s,&t))    {   if(s==t==n==1)        printf("0\n");        else if(s==t)        printf("-1\n");   else  if(s==1&&t==n)        printf("0\n");   else  if(s==n&&t==1)        printf("0\n");   else  if(s==1)        printf("1\n");   else  if(s==n)        printf("1\n");   else if(s==t+1||t==s+1)        printf("1\n");   else printf("2\n");    }    return 0;}

0 0