Cod sursa(job #2793587)
Utilizator | Data | 3 noiembrie 2021 19:21:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
//Ciurul lui Eratosthenes
#include <fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
bool a[2000003];
int N,i,j,k;
int main() {
fi>>N;
a[0]=1; //1 taiat (neprim)
a[1]=1; //0 prim
for(i=2;i<=N;i++)
if(a[i]==0)
for(j=2*i;j<=N;j=j+i)a[j]=1;
for(i=1;i<=N;i++)
if(a[i]==0)k++;
fo<<k;
fi.close();fo.close();
return 0;
}