Cod sursa(job #2223771)
Utilizator | Data | 21 iulie 2018 14:52:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
bool nep[2000001];
ifstream fin("ciur.in");
int main()
{
int n;
int cnt=0;
cin>>n;
//int k=sqrt(n);
for(int i=2;i<=n;i++)
{
if(!nep[i])
{
cnt++;
for(int j=1;j<n/i+1;j++)
{
nep[i*j]=true;
}
}
}
cout<<cnt;
return 0;
}