Cod sursa(job #604671)
| Utilizator | Data | 24 iulie 2011 13:15:22 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
main(){
int n,s;
ifstream inp;
inp.open("ciur.in");
ofstream oup;
oup.open("ciur.out");
inp >> n;
s=n-1;
bool a[n];
for(int i=2; i<=n; i++)a[i]=true;
for(int i=2; i*i<=n; i++){
if(a[i]){
for(int j=i*i; j<=n; j+=i){
if(a[j]){
a[j]=false;
s--;
};
};
};
};
oup << s;
};
