Cod sursa(job #1149413)
| Utilizator | Data | 21 martie 2014 20:24:34 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define NMax 2000001
ifstream in("ciur.in");
ofstream out("ciur.out");
int n;
char v[NMax];
int how_many()
{
int i,j;
int count=0;
for(i=2;i<=n;++i)
{
v[i]=1;
}
for(i=2;i<=n;++i)
{
if(v[i])
{
++count;
for(j=i+i;j<=n;j+=i)
v[j]=0;
}
}
return count;
}
int main()
{
in>>n;
out<<how_many();
return 0;
}
