Cod sursa(job #727266)
| Utilizator | Data | 27 martie 2012 20:24:45 | |
|---|---|---|---|
| Problema | Fractii | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<stdio.h>
#define Nmax 1000002
using namespace std;
int n,i,j;
long long p[Nmax];
long long s;
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;++i)
p[i]=i-1;
s=0;
for(i=2;i<=n;++i)
{
s+=p[i];
for(j=i+i;j<=n;j+=i)
p[j]-=p[i];
}
s=s*2+1;
printf("%lld",s);
fclose(stdin);
fclose(stdout);
return 0;
}
