Cod sursa(job #2857227)
Utilizator | Data | 25 februarie 2022 09:31:35 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long s;
int n,i,euler[1000001],j;
int main()
{
f>>n;
for(i=1;i<=n;i++)
euler[i]=i;
for(i=2;i<=n;i++)
{
s=s+euler[i];
if(euler[i]==i)
{
s--;
for(j=i+i;j<=n;j=j+i)
euler[j]=euler[j]/i*(i-1);
}
}
g<<s*2+1;
return 0;
}