Cod sursa(job #631634)
Utilizator | Data | 9 noiembrie 2011 10:34:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
#define NMax 200000
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main ()
{
long int n;
f>>n;
int v[NMax],ex=0;
for (int i=1;i<=n;i++)
v[i]=i;
for (int i=2;i<=n/2;i++)
for (int j=2;j<n/2;j++)
v[i*j]=0;
for(int i=2;i<=n;i++)
if(v[i]!=0)
ex++;
g<<ex;
return 0;
}