Cod sursa(job #1964980)
| Utilizator | Data | 13 aprilie 2017 21:12:23 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
int N,rez;
bool ciur[2000001];
void fa_ciur()
{
for (int i=2; i*i<=N; i++)
if (ciur[i]==0)
for (int j=i*i; j<=N; j+=i)
ciur[j]=1;
}
int main()
{
fi>>N;
fa_ciur();
for (int i=2; i<=N; i++)
rez+=(1-ciur[i]);
fo<<rez;
fi.close();
fo.close();
return 0;
}
