Cod sursa(job #3273154)
Utilizator | Data | 1 februarie 2025 10:51:59 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | cex_8 | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,p[1000001];
long long s;
int main()
{
for(int i=1;i<=1000000;++i) p[i]=i;
for(int i=2;i<=1000000;++i)
{
if(p[i]==i)
{
for(int j=i;j<=1000000;j+=i) p[j]=p[j]/i*(i-1);
}
}
f>>n;
for(int i=2;i<=n;++i)
{
s+=p[i];
}
g<<s*2+1;
return 0;
}