Cod sursa(job #3149718)
Utilizator | Data | 11 septembrie 2023 14:52:57 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX=1000000;
int v[NMAX+1];
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
int n;
long long s=0;
f>>n;
for(int i=2;i<=n;i++)
v[i]=i;
for(int i=2;i<=n;i++)
{
if(v[i]==i)
for(int j=i;j<=n;j+=i)
v[j]=v[j]/i*(i-1);
s+=2*v[i];
}
g<<s+1;
return 0;
}