Cod sursa(job #2698527)
Utilizator | Data | 22 ianuarie 2021 13:27:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,cnt;
bool ciur[2000001];
int main() {
fin>>n;
ciur[0]=ciur[1]=0;
for (i=2;i<=n;i++)
if (ciur[i]==0) {
for (j=2*i;j<=n;j+=i)
ciur[j]=1;
cnt++;
}
fout<<cnt;
return 0;
}