Cod sursa(job #2837373)
Utilizator | Data | 22 ianuarie 2022 10:11:48 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long unsigned int s=0,a[1000000],j,n,i;
int main()
{
f>>n;
for(i=2; i<=n; i++)
{
if(a[i]==0)
{
s=s+i-1;
for(j=i*2; j<=n; j=j+i)
if(a[j]!=0)
a[j]=a[j]-a[j]/i;
else
a[j]=j-j/i;
}
else
s=s+a[i];
}
g<<2*s+1;
return 0;
}