Cod sursa(job #3285033)
Utilizator | Data | 12 martie 2025 14:25:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,k=0;
bool Ciur[2000001];
int main()
{
fin>>n;
Ciur[1]=1;
for(i=2;i<=n;i++)
{
if(Ciur[i]==0)
{
for(j=2;i*j<=n;j++)
{
Ciur[j*i]=1;
}
}
}
for(i=1;i<=n;i++)
{
if(Ciur[i]==0)
{
k++;
}
}
fout<<k;
return 0;
}