Cod sursa(job #883648)
Utilizator | Data | 20 februarie 2013 11:00:37 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,i,j,a[1000001];
long long s;
int main ()
{
f>>n;
for(i=1;i<=n;++i)
a[i]=i;
for(i=2;i<=n;++i)
if(a[i]==i)
for(j=i;j<=n;j+=i)
{
a[j]*=i-1;
a[j]/=i;
}
for(i=2;i<=n;++i)
s+=a[i];
s=s*2+1;
g<<s<<'\n';
return 0;
}