Cod sursa(job #1695462)

Utilizator sucureiSucureiRobert sucurei Data 27 aprilie 2016 11:12:47
Problema Puteri Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.3 kb
#include <fstream>
#include <cstring>
using namespace std;

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

int n,x[100001],y[100001],z[100001],t1,t2,t3,dp[65][65][65],i,j,pr[135],m[135],semn[135];

long long rasp;

void check(int mod,int semn)
{
    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 = mod - m[x[i]];
        b = mod - m[y[i]];
        c = mod - m[z[i]];
        if(m[a] <= 64 && m[b] <= 64 && m[c] <= 64)
            rasp+=dp[m[a]][m[b]][m[c]] * semn;

        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))
            semn[i]=1;

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

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

    g<<rasp;

    return 0;
}