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