Cod sursa(job #476087)

Utilizator dushmiMihai-Alexandru Dusmanu dushmi Data 9 august 2010 18:23:53
Problema Mins Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.39 kb
#include<cstdio>
#include<stdlib.h>
int a,b,tot,x,y,n,pr[10],sol[10],rez[1<<20],nr[1<<20],*v[1<<20];
short int lung[1<<20];
void read()
{
    freopen("mins.in","r",stdin);
    freopen("mins.out","w",stdout);
    scanf("%d%d",&x,&y);
}
void add()
{
    int nrt=1,q=0;
    for(int i=0;i<n;i++)
        if(sol[i]==1)
            nrt*=v[b][i], q++;
    if(q%2==0 && q)
        tot-=(a/nrt);
    else if(q) tot+=(a/nrt);
}
void back(int poz)
{
    if(poz>n)
    {
        add();
        return;
    }
    sol[poz]=0;
    back(poz+1);
    sol[poz]=1;
    back(poz+1);
}
int calc()
{
    n=lung[b]-1;
    tot=0;
    back(0);
    return a-tot;
}
void init()
{
    for(int i=1;i<=x;i++)
       nr[i]=1;
}
void solve()
{
    init();
    long long rasp=y-2;
    for(int i=2;i<x;i++)
        if(nr[i]==1)
            for(int j=i;j<x;j+=i)
                nr[j]*=i, ++lung[j];
    for(int i=2;i<x;i++)
    {
        v[i]=(int *) malloc(lung[i]*sizeof(int));
        lung[i]=0;
    }
    init();
    for(int i=2;i<x;i++)
    {
        if(nr[i]==1)
            for(int j=i;j<x;j+=i)
                nr[j]*=i, v[j][lung[j]++]=i;
        if(nr[i]==i)
        {
            a=y-1;
            b=i;
            rasp+=(rez[i]=calc());
        }
        else rasp+=rez[nr[i]];
    }
    printf("%lld",rasp);
}
int main()
{
    read();
    solve();
    return 0;
}