Cod sursa(job #1011578)
Utilizator | Data | 16 octombrie 2013 22:59:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bool x[2000001];
int n, i, k,nr;
int main()
{
cin>>n;
for(i=2;i<=n;i++)
x[i]=1;
for(i=2;i*i<=n;i++)
if(x[i])
{
nr++;
for(k=i*i;k<=n;k+=i)
x[k]=0;
}
cout<<nr;
cin.close();
cout.close();
return 0;
}