Cod sursa(job #1268073)
Utilizator | Data | 20 noiembrie 2014 16:40:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[2000005], n, nr, i, j;
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
cin>>n;
for (i=2; i<=n; i++)
v[i]=1;
for (i=2; i<=n; i++)
if (v[i])
{
nr++;
for (j=i+i;j<=n;j+=i)
v[j]=0;
}
cout<<nr<<'\n';
return 0;
}