Cod sursa(job #661325)
Utilizator | Data | 14 ianuarie 2012 12:22:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,n,j,r;
bool q[2005000];
int main()
{
f>>n;
for(i=2; i<=sqrt(n); i++)
if (q[i]==0)
for(j=i*i; j<=n; j+=i) q[j]=1;
for(i=2;i<=n;i++)
if (q[i]==0) r++;
g<<r<<'\n';
f.close();
g.close();
return 0;
}