UVa 11063 - B2-Sequence

#include<stdio.h>
int main()
{
    int a[10000],m=0,n,j,i,k,flag,c[10000];
    while(scanf("%d",&n)==1)
    {
        flag=1;
        for(i=0; i<n; i++)
            scanf("%d",&a[i]);
        if(a[0]<1)
        {
            printf("Case #%d: It is not a B2-Sequence.\n\n",++m);
            continue;
        }
        for(i=0; i<n-1; i++)
        {
            if(a[i]>=a[i+1])
            {
                flag=0;
                break;
            }
        }
        if(!flag)
        {
            printf("Case #%d: It is not a B2-Sequence.\n\n",++m);
            continue;
        }
        k=-1;
        for(i=0; i<n; i++)
        {
            for(j=i; j<n; j++)
            {
                c[++k]=a[i]+a[j];
            }
        }
        for(i=0; i<k; i++)
        {
            for(j=i+1; j<=k; j++)
            {
                if(c[i]==c[j])
                {
                    flag=0;
                    break;
                }
            }
            if(!flag)
                break;
        }
        if(flag)
            printf("Case #%d: It is a B2-Sequence.\n\n",++m);
        else
            printf("Case #%d: It is not a B2-Sequence.\n\n",++m);
    }
    return 0;
}

Share on Google Plus

About Unknown

This is a short description in the author block about the author. You edit it by entering text in the "Biographical Info" field in the user admin panel.