Cod sursa(job #1496011)
| Utilizator | Data | 4 octombrie 2015 03:21:14 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream gout("ciur.out");
int solve(int N)
{
bool *P;
P = new bool[N];
for(int i=0;i<N;i++)
P[i]=false;
for(int i = 2;i<N;++i)
{
if(P[i]==false)
for(int j = i+i; j<N; j+=i)
P[j]=true;
}
int count = 0;
for(int i=2;i<N;++i)
if(P[i]==false)
count++;
return count;
}
int main()
{
int n;
fin>>n;
gout<<solve(n);
return 0;
}
