Cod sursa(job #1011589)
Utilizator | Data | 16 octombrie 2013 23:17:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 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++)
if(x[i]==0)
{
nr++;
for(k=i*2;k<=n;k+=i)
x[k]=1;
}
cout<<nr;
cin.close();
cout.close();
return 0;
}