View Code of Problem 3792

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;

#define MAXN 1000010
typedef long long ll;
const int mod=1000000009;

int x[MAXN];

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        bool flag[10]={0};
        for(int i=0;i<n;i++)
            scanf("%d",&x[i]);
        bool flagt=false;
        for(int i=0;i<n;i++)
        {
            if(flag[6-x[i]%6])
            {
                flagt=true;
                break;
            }
            flag[x[i]%6]=true;
        }
        if(flagt) puts("pass");
        else puts("fail");
    }
    return 0;
}

Double click to view unformatted code.


Back to problem 3792