Cod sursa(job #1623059)
Utilizator | Data | 1 martie 2016 16:50:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char check[2000001];
int main()
{
int n, i, j;
long k= 0;
fin >> n;
for(i = 2; i < n; i++){
for(j = 2; j *i < n; j++)
check[i*j] = 1;
if(check[i] == 0) k++;
}
fout << k;
fin.close();
fout.close();
return 0;
}