Cod sursa(job #610539)
Utilizator | Data | 27 august 2011 21:56:19 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<fstream>
using namespace std;
int main()
{
long n,phi[100],j,i,s=1;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
f.close();
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);
}
for(i=2; i<=n; i++) s=s+phi[i]*2;
g<<s;
return 0;
}