Cod sursa(job #1337189)
Utilizator | Data | 8 februarie 2015 18:29:24 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long r;
int N,j,n,nr,i,a[2000010];
int main()
{
f>>N;
for (i=2;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]=a[j]/i*(i-1);
}
for (i=1;i<=N;i++)
r+=a[i];
r=r*2;
r+=1;
g<<r;
return 0;
}