Cod sursa(job #839952)
| Utilizator | Data | 22 decembrie 2012 12:31:27 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 60 |
| 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");
const int maxn=2000005;
long long n;
bool a[maxn];
int ciur(int n)
{
long long i, j, x=sqrt(n);
int nr=0;
for(i=2; i<=x; ++i)
for(j=i*i; j<=n; j+=i) a[j]=1;
for(i=2; i<=n; ++i) if(a[i]==0) ++nr;
return nr;
}
int main()
{
f>>n;
g<<ciur(n)<<"\n";
}
