Cod sursa(job #1340016)
Utilizator | Data | 11 februarie 2015 14:05:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | 9neplace | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bitset <2000005> ciur;
int main()
{ int i,j,n,cnt=0;
cin>>n;
for(i=2;i<=n;i++)
if(ciur[i]==0)
{ cnt++;
for(j=i+i;j<=n;j=j+i)
ciur[j]=1;}
cout<<cnt;
cin.close();
cout.close();
return 0;
}