Cod sursa(job #2403836)
Utilizator | Data | 11 aprilie 2019 21:59:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N;
int i,j, nc=0;
fin>>N;
int A[N+6];
for(i=2; i<=N; ++i)
A[i]=0;
for(i=2;i<N;++i)
{
if(A[i] == 0)
{
++nc;
int p=2;
while(i*p<=N)
{
A[i*p] = 1;
++p;
}
}
}
fout<<nc;
return 0;
}