Cod sursa(job #1910437)
Utilizator | Data | 7 martie 2017 16:56:59 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int main()
{
int i,phi[1000],s=0,j,n;
in>>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=j+i)
phi[j]/=i,phi[j]*=(i-1);
for(i=1;i<=n;i++)
s=s+phi[i]*2;
out<<s-1;
return 0;
}