Cod sursa(job #3216754)
Utilizator | Data | 19 martie 2024 17:24:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool prim[2000001];
int main()
{
int n,cnt=0;
in>>n;
for (int i=2; i<=n; i++)
{
prim[i]=true;
}
for (int i=2; i<=n; i++)
{
if (prim[i])
{
cnt++;
for (int j=i+i; j<=n; j+=i)
{
prim[j]=false;
}
}
}
out<<cnt;
return 0;
}