Cod sursa(job #1840553)
Utilizator | Data | 4 ianuarie 2017 15:51:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N, i, j, nr;
bool prim[2000005];
int main()
{
fin >> N;
prim[1]=0;
for (i=2; i<=N; i++)
prim[i]=1;
for (i=2; i<=N; i++)
{
if (prim[i]==true)
{
nr++;
for (j=2*i; j<=N; j+=i)
prim[j]=false;
}
}
fout << nr << '\n';
fin.close();
fout.close();
return 0;
}