Cod sursa(job #1639621)
Utilizator | Data | 8 martie 2016 13:03:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream F ("ciur.in");
ofstream G ("ciur.out");
int n,i,j,k;
bitset <2000003> ciur;
int main()
{
F>>n;
ciur[1]=1;
ciur[0]=1;
for ( i=2;i*i<=n;i++ )
if ( !ciur[i] )
for ( j=i*i;j<=n;j+=i )
ciur[j]=1;
for ( i=1;i<=n;i++ )
if ( !ciur[i] )
++k;
G<<k;
return 0;
}