Cod sursa(job #987997)
| Utilizator | Data | 21 august 2013 19:04:42 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int ciur(int n)
{
bool x[n+2];
for(int i=1; i<=n; i++)
x[i] = true;
int count = 0;
for(int i=2; i<=n; i++)
{
if(x[i] == true)
{ count++;
for(int j=2*i; j <= n; j+=i)
x[j] = false;
}
}
return count;
}
int main()
{
int n;
in>>n;
in.close();
out<<ciur(n);
out.close();
return 0;
} 