Cod sursa(job #2432653)
Utilizator | Data | 24 iunie 2019 17:00:13 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long a[1000000+10],n,i,j,sum;
int main() {
f>>n;
for(i=1;i<=n;i++)
{
a[i]=i-1;
}
for(i=2;i<=n;i++)
{
for(j=2*i;j<=n;j+=i)
{
a[j]=a[j]-a[i];
}
}
for(i=1;i<=n;i++)
{
sum+=a[i];
}
g<<sum*2+1;
return 0;
}