Cod sursa(job #1907320)
Utilizator | Data | 6 martie 2017 18:48:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int n,i,k,j,x;
bool viz[2000008];
int main()
{
for(i=2;i<=NMax;i++)
if(viz[i]==0)
for(j=2;j*i<=NMax;j++)
viz[j*i]=1;
f>>n;
k=0;
for(i=2;i<=n;i++)
if(viz[i]==0)
k++;
g<<k;
return 0;
}