Pagini recente » Cod sursa (job #1007069) | fmi-no-stress-9/solutii | Cod sursa (job #1100969) | Cod sursa (job #924614) | Cod sursa (job #274543)
Cod sursa(job #274543)
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
long phi[3000001];
int main()
{ long n,i,j;
freopen("ciur.in","rt",stdin);
freopen("ciur.out","wt",stdout);
scanf("%ld",&n);
for(i=1;i<=n;++i) phi[i]=i;
for(i=2;i<=n;++i)
if(phi[i]==i)
for(j=i;j<=n;j+=i)
phi[j]/=i,phi[j]*=(i-1);
printf("%ld",phi[n]);
//system("PAUSE");
return 0;
}