Cod sursa(job #1167784)
Utilizator | Data | 5 aprilie 2014 22:09:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n;
f >> n;
bool nonprim[2000001];
nonprim[1] = 1;
nonprim[2] = 0;
int nrprim = 0;
int i, j;
for (i=2; i<=n; i++)
{
if (!nonprim[i])
{
nrprim++;
for (j=i; j<=n; j+=i)
{
nonprim[j] = 1;
}
}
}
g << nrprim;
}