Cod sursa(job #2076574)
Utilizator | Data | 26 noiembrie 2017 19:48:12 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n, a[10000000];
int main()
{
long long s=1;
f >> n;
for(int i=1;i<=n;i++)
a[i] = i-1;
for(int i=2;i<=n;i++)
for(int j=2*i; j<=n; j+=i)
a[j] = a[j]-a[i];
for(int i=1;i<=n;i++)
s=s+2*a[i];
g<<s;
f.close();
g.close();
return 0;
}