Cod sursa(job #1594836)
Utilizator | Data | 9 februarie 2016 19:20:44 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include<fstream>
using namespace std;
int i,j,N,total;
int phi[1000000];
int main()
{
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin>>N;
for(i=1;i<=N;i++)
phi[i]=i-1;
for(i=2;i<=N;i++)
{
total+=phi[i];
for(j=i*2;j<=N;j+=i)
phi[j]-=phi[i];
}
total=total*2+1;
fout<<total;
return 0;
}