Cod sursa(job #1308300)
Utilizator | Data | 3 ianuarie 2015 22:01:19 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int i,a[9999999],j,n;
long long s;
int main()
{
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin>>n;
for(j=1; j<=n; ++j)
a[j]=j-1;
for(i=2; i<=n; ++i)
{
for(j=i+i; j<=n; j=j+i)
a[j]=a[j]-a[i];
}
for(i=2; i<=n; ++i)
s=s+a[i];
fout<<s*2+1;
return 0;
}