Cod sursa(job #1729907)
| Utilizator | Data | 15 iulie 2016 19:52:28 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | c | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <stdio.h>
#include <stdlib.h>
int phi[1000000];
long long s;
void euler(int n)
{
int i,j;
for (i=1;i<=n;i++)
phi[i]=i-1;
for (i=2; i<=n; i++)
{
s=s+phi[i];
for (j=2*i; j<=n; j+=i)
phi[j]-=phi[i];
}
}
int main()
{
FILE *pf,*pg;
pf=fopen("fractii.in","r");
pg=fopen("fractii.out","w");
unsigned int n;
fscanf(pf,"%d",&n);
euler(n);
fprintf(pg,"%lld",2*s+1);
return 0;
}
