Cod sursa(job #1618899)
Utilizator | Data | 28 februarie 2016 04:41:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool mat[2000001];
int main ()
{
int n, sum = 0;
fin >> n;
for (int i = 2; i <= n; i++)
for (int j = 2; i*j <= n; j++)
mat[i*j] = true;
for (int i = 2; i <= n; i++)
if (mat[i] == false) sum+=1;
fout << sum;
fin.close();
fout.close();
return 0;
}