Cod sursa(job #630479)
Utilizator | Data | 5 noiembrie 2011 17:06:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i=2;
int mult=2;
int j=2;
int nr=0;
f>>n;bool x[n];
while (j<=n){
if (x[j]==false){
nr++;
x[j]=true;
mult=j;
i=j*j;
while (i<=n){
i=j*(mult++);
x[i]=true;
}
} else {
j++;
}
}
g<<nr;
return 0;
}