Cod sursa(job #2226830)
Utilizator | Data | 30 iulie 2018 18:32:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int N,nr=0;
in>>N;
bool ciur[N+1];
fill(ciur,ciur+N,0);
for(unsigned i=2;i<=N;i++)
{
if(ciur[i]==0)
{
nr++;
for(unsigned j=i+i;j<=N;j+=i)
{
ciur[j]=1;
}
}
}
out<<nr;
out.close();
return 0;
}