Cod sursa(job #622099)
Utilizator | Data | 17 octombrie 2011 14:06:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
const int N = 2000000;
bool c[N];
ifstream in("ciur.in");
ofstream out("ciur.out");
int ciur(int n)
{
int i,j,nr=0;
for(i=2;i*i<=N;i++)
if(c[i]==false)
{
if(i<=n)
nr++;
for(j=i*i;j<=N;j+=i)
c[j]=true;
}
return nr;
}
int main()
{
int n;
in>>n;
out<<ciur(n)<<'\n';
return 0;
}