Cod sursa(job #1911560)
Utilizator | Data | 7 martie 2017 20:53:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
int n,cnt;
char prim[2000005];
ifstream f("ciur.in");
ofstream g("ciur.out");
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]) {
++cnt;
for (j = i+i; j <= n; j += i)
prim[j] = 0;
}
g<<cnt;
return 0;
}