Cod sursa(job #3124587)
Utilizator | Data | 29 aprilie 2023 13:33:34 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long ciur[1000001],n,i,j,s=1;
int main()
{
int n;
f>>n;
for(i=1; i<=n; i++)
ciur[i]=i;
for(i=2; i<=n; i++)
{
if(ciur[i]==i)
for(j=i; j<=n; j+=i)
ciur[j]=ciur[j]/i*(i-1);
s+=2*ciur[i];
}
g<<s;
return 0;
}