Cod sursa(job #1996015)
Utilizator | Data | 29 iunie 2017 18:24:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int a[2000005];
int ciur(int n){
for( int i=2; i<=n; i++){
if ( !a[i] )
for( int j=2*i; j<=n; j+=i)
a[j]=1;
if ( i*i>n ) break;
}
int k=0;
for( int i=2; i<=n; i++)
if ( !a[i]) k++;
return k;
}
int main()
{
int n;
in>>n;
out<<ciur(n);
return 0;
}