Cod sursa(job #2391152)
Utilizator | Data | 28 martie 2019 18:11:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int cnt,n;
bool prim[1];
int main()
{
int i,j;
fin>>n;
for(i=3; i<=n; i=i+2)
prim[i]=1;
for(i=3; i<=n; i=i+2)
if(prim[i]!=0)
{
cnt++;
for(j=i+i;j<=n;j+=i)
prim[j]=0;
}
fout<<cnt+1;
return 0;
}