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