Cod sursa(job #1967067)
Utilizator | Data | 15 aprilie 2017 20:57:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
#define nmax 2000002
int n;
bool ciur[nmax];
int main()
{
int i, j, nr=0;
fin>>n; fin.close();
ciur[0]=ciur[1]=-1;
for(i=2; 2*i<=n; i++)
for(j=2*i; j<=n; j+=i)
ciur[j]=1;
for(i=0; i<=n; i++)
if(ciur[i]==0)
nr++;
fout<<nr<<'\n';
fout.close();
return 0;
}