Cod sursa(job #3273176)
Utilizator | Data | 1 februarie 2025 11:14:11 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | cex_8 | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int n,v[1000001];
long long s;
int main()
{
for(int i=1;i<=1000001;++i) {
v[i]=i;
}
for(int i=2;i<=1000001;++i)
{
if(v[i]==i)
{
for(int j=i;j<=1000001;j+=i) {
v[j]=v[j]/i*(i-1);
}
}
}
fin>>n;
for(int i=2;i<=n;++i)
{
s+=v[i];
}
int result=s*2+1;
fout<<result;
return 0;
}