Cod sursa(job #1623078)
Utilizator | Data | 1 martie 2016 16:57:05 | |
---|---|---|---|
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;
long k= 0,j;
fin >> n;
for(i = 2; i < n; i++){
for(j = i+i; j < n; j+=i)
check[j] = 1;
if(!check[i]) k++;
}
fout << k;
fin.close();
fout.close();
return 0;
}