Cod sursa(job #1317855)
Utilizator | Data | 15 ianuarie 2015 11:58:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char prim[2000005];
int n,nr=0;
int main()
{ int i,j;
f>>n;
for (i=2;i<=n;i++)
{ prim[i]=1;
for(i=2;i<=n;i++)
{ if (prim[i])
{ nr++;
for (j = i+i; j <= n; j += i)
prim[j] = 0;
}
}
g<<nr;
return 0;
}