Cod sursa(job #1989646)
Utilizator | Data | 8 iunie 2017 14:13:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
#define MAX 2000001
bool isPrime[MAX];
int main(){
ifstream in; ofstream out;
in.open("ciur.in"); out.open("ciur.out");
out.clear();
int n,i,j,no=0;
in>>n;
for(i=2;i<=n;i++){
if(isPrime[i]==0){
no++;
for(j=i*i;j<=n;j=j+i) isPrime[j]=1;
}
}
out<<no;
in.close(); out.close();
return 0;
}