Cod sursa(job #2500067)
Utilizator | Data | 27 noiembrie 2019 10:43:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <cmath>
using namespace std;
int n, i, j, c;
bool ciur[2000005];
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int main () {
fin>>n;
for (i=2;i<=n;i++) {
if (ciur[i]==0) {
c++;
for (j=i+i;j<=n;j+=i)
ciur[j]=1;
}
}
fout<<c;
return 0;
}