Cod sursa(job #496114)
Utilizator | Data | 27 octombrie 2010 20:20:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[1<<21];
int ciur(int n)
{
long long i,j;
int cont=0;
for (i=2;i<=n;i++)
if(!v[i])
{
++cont;
for(j=i*i;j<=n;j+=i)
v[j]=true;
}
return cont;
}
int main()
{
int n;
in>>n;
out<<ciur(n)<<"\n";
return 0;
}