Cod sursa(job #85035)
Utilizator | Data | 19 septembrie 2007 18:46:27 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.31 kb |
#include<fstream.h>
ifstream f("fractii.in");
ofstream g("fractii.out");
int n;
char a[1000001];
long long k;
void ciur(int x)
{int p=0;
for(int i=x;i<=n;i+=x)
{a[i]=1;p++;}
k+=2*(n-p-x);
}
int main()
{f>>n;
k=2*n-1;
ciur(2);
for(int i=3;i<=n;i+=2)
if(!a[i])
ciur(i);
g<<k;
return 0;
}