Cod sursa(job #1863739)
| Utilizator | Data | 31 ianuarie 2017 10:02:10 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include<fstream>
using namespace std;
const int N=1000000;
bool C[N+1];
int ciur(int n)
{
int i,nr=0,j;
for(i=2; i*i<=n; i++)
{
if(!C[i])
{
for(j=i*i; j<=n; j+=i)
{
C[j]=true;
}
}
}
for(i=2; i<=n; i++)
{
if(!C[i])
{
nr++;
}
}
return nr;
}
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
int n;
in>>n;
out<<ciur(n);
}
