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