Cod sursa(job #1874544)
Utilizator | Data | 10 februarie 2017 10:12:56 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
using namespace std;
const int N=1000002;
ifstream f("fractii.in");
ofstream g("fractii.out");
int eras[N],n;
long long rez=0;
int main()
{
f>>n;
eras[1]=n;
rez=n;
for(int i=2;i<=n;i++)
{
eras[i]+=(n-1);
for(int j=2;i*j<=n;j++)
{
eras[i*j]--;
eras[i]--;
}
rez+=eras[i];
}
g<<rez;
f.close();
g.close();
return 0;
}