Cod sursa(job #1096500)
Utilizator | Data | 2 februarie 2014 10:05:21 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream>
using namespace std;
int ciur[1000005]={0},n;
ifstream in("fractii.in");
ofstream out("fractii.out");
void ciurE()
{
int i,j;
for(i=2;i<=n;i++)
for(j=2*i;j<=n;j+=i)
ciur[j]++;
}
void afisare()
{
int i,nr=0;
for(i=2;i<=n;i++)
{
nr+=i-ciur[i]-1;
}
nr=nr*2+1;
out<<nr;
}
int main ()
{
in>>n;
ciurE();
afisare();
return 0;
}