Cod sursa(job #1699043)
Utilizator | Data | 5 mai 2016 22:18:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
##include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int k = 0, n; bool a[3000004];
in >> n;
for(int i = 2; i <= n; i++)
{
if(a[i] == 0)
{
k++;
for(int j = 2 ; j * i <= n; j++) a[j*i] = 1;
}
}
out << k;
return 0;
}