Cod sursa(job #238812)
Utilizator | Data | 3 ianuarie 2009 12:44:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
using namespace std;
bool sir[2000000];
int n,total;
fstream fin("ciur.in",ios::in);
fstream fout("ciur.out",ios::out);
int main(){
fin>>n;
for (int i=2;i<=n;i++){
if (!sir[i]) {total++;
for (int j=i*2;j<=n;j=j+i)
sir[j]=true;}
}
fout<<total;
}