Cod sursa(job #689390)
Utilizator | Data | 24 februarie 2012 14:07:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool ciur[2000005];
int n,i,j,nr;
int main() {
f>>n;
for (i=2;i<=n;i++) if (ciur[i]==false) for (j=i+i;j<=n;j+=i) ciur[j]=true;
for (i=2;i<=n;i++) if (!ciur[i]) nr++;
g<<nr;
return 0;
}