Cod sursa(job #2224905)
Utilizator | Data | 25 iulie 2018 15:08:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char A[2000005];
int N,i,j,nrPrime = 0;
int main()
{
long N;
f >> N;
for(i=2; i<=N; i++)
A[i] = 1;
for(i=2; i<=N; i++)
{
if(A[i])
{
nrPrime++;
for(int j=i+i; j<=N; j+=i)
A[j] = 0;
}
}
g << nrPrime;
return 0;
}