Cod sursa(job #3186506)
Utilizator | Data | 23 decembrie 2023 15:16:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int nmax= 2000000;
bool u[nmax+1];
int main() {
int n, sol= 0;
fin>>n;
for ( int i= 2; i<=n; ++i ) {
sol+= (1-u[i]);
for ( int j= i*2; j<=n; j+= i ) {
u[j]= 1;
}
}
fout<<sol<<"\n";
return 0;
}