Cod sursa(job #1863671)
Utilizator | Data | 31 ianuarie 2017 09:05:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream cin ("ciur.in");
ofstream cout("ciur.out");
const int N=2000000;
bool c[N+1];
int main()
{
int n, i, j, nr=0;
cin>>n;
for(i=2; i*i<=n; i++)
{
if(!c[i])
{
for(j=i*i; j<=n; j+=i)
{
c[j]=true;
}
}
}
for(i=2; i<=n; i++)
if(!c[i])
nr++;//cout<<i<<' ';
cout<<nr;
return 0;
}