Cod sursa(job #485157)
Utilizator | Data | 17 septembrie 2010 12:56:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
#include<bitset>
using namespace std;
int n,x,i,j;
//bool a[2000005];
bitset<2000005> a;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f >> n;
for ( i=2;i<=n;i++)
a[i]=1;
for(i = 2; i<=n;i++)
if(a[i])
{ x++;
for( j=i+i; j<=n;j+=i)
a[j]=0;
}
g<<x<<"\n";
return 0;
}