Cod sursa(job #2259500)
Utilizator | Data | 13 octombrie 2018 13:16:51 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int ciur[1000001],n,i,j;
long long s=1;
int main()
{
f>>n;
for(i=2; i<=n; i++)
ciur[i]=i-1;
for(i=2; i<=n; i++)
for(j=2*i; j<=n; j+=i)
ciur[j]-=ciur[i];
for(i=2; i<=n; i++)
s+=2*ciur[i];
g<<s;
f.close();
g.close();
return 0;
}