Cod sursa(job #1539038)
Utilizator | Data | 30 noiembrie 2015 08:42:18 | |
---|---|---|---|
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");
bitset<2000000>v;
int main(){
int n,i,j,k=0;
fin>>n;
v[1]=v[0]=1;
for(i=2;i<=n;i++)
if(v[i]==0){
k++;
for(j=2*i;j<=n;j=j+i)
v[j]=1;
}
fout<<k;
fin.close();
fout.close();
return 0;
}