Cod sursa(job #1947129)
Utilizator | Data | 30 martie 2017 19:28:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool c[2000005];
void ciur(int n)
{
int i,j;
c[0]=c[1]=1;
for(i=2; i<=n; i++)
{
if(c[i]==0)
{
for(j=i+i; j<=n; j+=i)
{
c[j]=1;
}
}
}
}
int main()
{
int n,i,j,gogu=0;
in>>n;
ciur(n);
for(i=2;i<=n;i++)
{
if(c[i]==0)
gogu++;
}
out<<gogu;
return 0;
}