Cod sursa(job #1415933)
Utilizator | Data | 6 aprilie 2015 21:33:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
bool v[2000001];
int ciur(int n)
{
int i,j,nr=0;
for(i = 2; i <= n; i++)
{
if(v[i] == 0)
{
for(j=i+i; j<= n; j=j+i)
{
v[j] = 1;
}
}
}
}
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int nr=1,n,i;
fin>>n; ciur(n);
for(i = 3; i <= n; i=i+2)
{
if(v[i] == 0) nr++;
}
fout<<nr<<'\n';
}