Cod sursa(job #837561)
Utilizator | Data | 18 decembrie 2012 09:46:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
#include <math.h>
using namespace std;
int a[2000001];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, i, j, k=0;
f >> n;
for (i=2; i<n; i++)
if(a[i]==0) {
k++;
for(j=i; j<n; j+=i)
a[j]=1;
}
g<<k;
//Calin Farcas
}