Cod sursa(job #2974280)
Utilizator | Data | 3 februarie 2023 19:25:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
using namespace std;
ifstream fin ("ciur.in")
ofstream fout ("ciur.out")
bool ciur [1000001];
int i,j,n;
int main()
{
fin>>n;
ciur[0]=1;ciur[1]=1;
for (i=2;i*i<=n;i++)
if (ciur[i]==0){
for(j=2;j*i<=n;j++)
ciur[i*j]=1;
}
for (i=1;i<=n;i++)
if(ciur[i]==0)fout<<i<<" ";
return 0;
}