Cod sursa(job #839483)
Utilizator | Diana Sarpe Diana69 | Data | 21 decembrie 2012 21:20:32 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main () {
int n,k=0;
ifstream fd("ciur.in");
ofstream df("ciur.out");
fd>>n;
bool a[n+1];
for (int i=2;i<=n-1;i++){
a[i]=true;
}
for (int j=2;j<=n-1;j++){
if (a[j]){
k=k+1;
for (int i=j;i<=n-1;i=i+j){
a[i]=false;
}
}
}
df <<k<<" ";
fd.close();
df.close();
return (0);
}