Cod sursa(job #1691483)
| Utilizator | Data | 18 aprilie 2016 15:25:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bitset <2000001> marcat;
void ciur(int x)
{
for(int i=2;i*i<=x;i++)
{
if(marcat[i]==0)
{
for(int j=i+i;j<=x;j+=i)
{
marcat[j]=1;
}
}
}
}
int main()
{
int n;
in>>n;
ciur(n);
int nr=0;
for(int i=2;i<=n;i++)
{
if(marcat[i]==0)
nr++;
}
out<<nr;
return 0;
}
