Cod sursa(job #3041278)
Utilizator | Data | 31 martie 2023 10:59:48 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | tot_ | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,m;
int a[1000005];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
a[i]=i;
for(int i=2;i<=n;i++)
if(a[i]==i)
{
for(int j=i;j<=n;j+=i)
a[j]=a[j]/i*(i-1);
}
long long s=0;
for(int i=1;i<=n;i++)
s+=a[i];
g<<2*s-1;
return 0;
}