Cod sursa(job #851745)
Utilizator | Data | 10 ianuarie 2013 13:41:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <fstream>
using namespace std;
int a[2000005];
int main()
{ int n, i, j, k=0;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
f >> n;
for(i=2; i<=n; i++) {if(a[i]==0){ k++; for(j=2*i; j<=n; j=j+i) a[j]=1;}}
g << k;
}