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