Cod sursa(job #1325426)
Utilizator | Data | 23 ianuarie 2015 22:01:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream is ("ciur.in");
ofstream os ("ciur.out");
int N, P[2000002], c;
int main()
{
is >> N;
for(int i = 2; i <= N; ++i)
if(!P[i])
{
for(int j = i+i; j <= N; j+=i)
P[j] = 1;
c++;
}
os << c;
return 0;
}