Cod sursa(job #2135651)
Utilizator | Data | 18 februarie 2018 23:44:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n,c=0,i,j;
bitset<2000002>ciur;
int main()
{
fin>>n;
ciur[i]=1;
for(i=2;i<=n;i++){
if(ciur[i]==0){
c++;
for(j=i*2;j<=n;j+=i){
ciur[j]=1;
}
}
}
fout<<c;
return 0;
}