Cod sursa(job #1103476)
Utilizator | Radu Cebotari radu_cebotari | Data | 9 februarie 2014 16:07:17 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
using namespace std;
long int ciur(long int n)
{
bool v[n+1];
long int k,i,prim=0;
for(i = 1 ; i<=n ;i++ )
v[i] = false;
for(i = 1 ; i<=n ; i++)
{
if (v[i] == false)
{
prim++;
for(k = 2*i ; k <= n ; k+=i )
v[i] = true;
}
}
return prim;
}
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
long int n;
in>>n;
out<<ciur(n);
in.close();
out.close();
return 0;
}