Cod sursa(job #944278)
Utilizator | Data | 27 aprilie 2013 22:30:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
int i,j,h,n;
bool a[2000001];
ifstream f("ciur.in");
ofstream g("ciur.out");
void gen()
{
for (i=2; i<=n; i++)
a[i]=0;
for (i=2; i<=n; i++)
for (j=2*i; j<=n; j+=i)
a[j]=1;
for (i=2; i<=n; i++)
if (a[i]==0) ++h;
g<<h;
}
int main()
{ f>>n;
gen();
return 0;
}