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