Cod sursa(job #1734074)
Utilizator | Data | 26 iulie 2016 14:15:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char vector[2000005];
int main()
{
int n;
f >> n;
int i, j, nr = 1;
for (i = 3; i <= n; i += 2)
{
if (vector[i] == 0)
{
nr++;
for (j = i + i + i; j <= n; j += i << 1)
{
vector[j] = 1;
}
}
}
g << nr;
}