Cod sursa(job #2513591)
Utilizator | Data | 23 decembrie 2019 14:39:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <bitset>
using namespace std;
int n,nr;
bitset <2000001> prim;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int main()
{
cin>>n;
prim[0]=prim[1]=1;
for(int i=2;i<=n;i++)
if(!prim[i])
{
for(int j=i;j<=n/i;j++)
prim[j*i]=1;
nr++;
}
cout<<nr;
return 0;
}