Cod sursa(job #2908296)
Utilizator | Data | 2 iunie 2022 18:16:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
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 ciur[2000000];
int main()
{
long long n, cnt=0, i, j;
in>>n;
for (i=2; i<=n; i++)
{
if (ciur[i]==0)
{
for (j=i+i; j<=n; j=j+i)
{
ciur[j]=1;
}
}
}
for (i=2; i<=n; i++)
{
if (ciur[i]==0) cnt++;
}
out<<cnt;
}