Cod sursa(job #160264)
Utilizator | Data | 14 martie 2008 22:22:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int main() {
bool a[2000009];
long n,nr=0,i,j;
ifstream fin("ciur.in");
fin>>n;
fin.close();
for (i=2; i<=n/2; i++)
if (a[i]==false) {
for (j=i*2; j<=n; j=j+i) {
if (a[j]==false) nr++;
a[j]=true;
}
}
ofstream fout("ciur.out");
fout<<n-nr-1;
fout.close();
}