Cod sursa(job #1650356)
Utilizator | Data | 11 martie 2016 17:54:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#define MAXN 2000000
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n, k = 1;
f >> n;
char v[MAXN];
for(int i = 3; i <= n; i+=2)
v[i] = 1;
for(int i = 3; i <= n; i+=2)
if(v[i] == 1)
{
k++;
for(int j = i*i; j <= n; j=j+2*i)
v[j] = 0;
}
g << k;
return 0;
}