Cod sursa(job #1996018)
| Utilizator | Data | 29 iunie 2017 18:26:35 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
int ciur( int n){
bool a[n];
int k=0;
for(long int i=2; i<=n; i++){
a[i]=true;
}
for(long int i=2; i<=n; i++){
if ( a[i] )
for(long int j=2*i; j<=n; j+=i)
a[j]=false;
if ( i*i>n ) break;
}
for(long int i=2; i<=n; i++)
if (a[i]) k++;
return k ;
}
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
long int n;
in>>n;
out<<ciur(n);
return 0;
}
