Cod sursa(job #600056)
| Utilizator | Data | 30 iunie 2011 15:08:50 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#define MaxN 2000001
using namespace std;
bool v[MaxN];
int n;
int ciur();
int main()
{
ifstream fin("ciur.in");
fin>>n;
fin.close();
ofstream fout("ciur.out");
fout<<ciur();
fout.close();
return 0;
}
int ciur()
{
int ct=1,i,j;
for(i=3;i<=n;i+=2)
{
if(!v[i])
{
ct++;
for(j=i+i;j<=n;j+=i)
v[j]=1;
}
}
return ct;
}