Cod sursa(job #751607)
| Utilizator | Data | 26 mai 2012 14:05:16 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int N=2000000;
bool c[N];
int ciur (int n)
{
int nr = 0;
for (int i=2;i*i<=n;i++)
if (!c[i])//i prim/*
for(int j=i*i; j<=n;j+=i)
c[j]=true;
for (int i=2;i<=n;i++)
if (!c[i]) nr++;
return nr;
}
int main()
{
int nr , n ;
in>>n;
nr = ciur (n);
out<<nr;
return 0;
}
