Cod sursa(job #1592885)

Utilizator AeroHHorea Stefan AeroH Data 8 februarie 2016 02:42:24
Problema Puteri Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.13 kb
#include <fstream>
#include <cstring>

using namespace std;

ifstream f("puteri.in");
ofstream g("puteri.out");

int n,x[100001],y[100001],z[100001],dp[65][65][65],i,j,m[135],s[135];

long long rasp;

void check(int mod,int s)
{
    int i,a,b,c;
    memset(dp,0,sizeof(dp));
    for(i=1;i<=128;++i)m[i]=i%mod;
    for(i=1;i<=n;++i)
    {
        a = m[mod - m[x[i]]];
        b = m[mod - m[y[i]]];
        c = m[mod - m[z[i]]];
        if(a <= 64 && b <= 64 && c <= 64)
            rasp+=dp[a][b][c] * s;

        dp[m[x[i]]][m[y[i]]][m[z[i]]]++;
    }
}

bool isp(int t)
{
    for(int i=2;i*i<=t;++i)
        if (t%i==0)
            return 0;
    return 1;
}

int main()
{
    f>>n;
    for(i=1;i<=n;++i)
        f>>x[i]>>y[i]>>z[i];

    for(i=2;i<=128;++i)
        if(isp(i))
            s[i]=1;

    for(i=2;i<=128;++i)
        for(j=2;j<=128;++j)
            if(i!=j&&isp(i)&&isp(j)&&i*j<=128)
                s[i*j]=-1;
    s[30]=s[42]=s[66]=s[70]=s[78]=s[102]=s[105]=s[110]=s[114]=1;


    for(i=2;i<=128;++i)
        if(s[i])
            check(i,s[i]);

    g<<rasp;

    return 0;
}