Cod sursa(job #2740628)
Utilizator | Data | 13 aprilie 2021 17:36:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[20000005];
int ciur(int n)
{
int i,j,cnt=0;
for(i=2;i<=n;++i)
v[i]=1;
for(i=2;i<=n;++i)
{
if(v[i])
{
cnt++;
for(j=i*i;j<=n;j=j+i)
v[j]=0;
}
}
return cnt;
}
int main()
{
int n;
in>>n;
out<<ciur(n);
return 0;
}