Cod sursa(job #2859641)
Utilizator | Data | 1 martie 2022 18:08:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool ciur[2000001];
int main()
{
int n,s=0;
in>>n;
for(int i=2;i*i<=n;i++)
{
if(ciur[i]==0)
{
for(int j=i;j*i<=n;j++)
ciur[i*j]=1;
}
}
for(int i=2;i<=n;i++)
{
if(ciur[i]==0)
s++;
}
out<<s;
return 0;
}