Cod sursa(job #2418144)
Utilizator | Data | 3 mai 2019 20:13:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <iostream>
#define nmax 2000005
using namespace std;
//ifstream fin("date.in");
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, c[nmax], sol;
int main(){
fin >> n;
for(int i = 2; i <= n; ++i)
if(c[i] == 0){
sol++;
for(int j = i + i; j <= n; j += i)
c[j] = 1;
}
fout << sol;
return 0;
}