Cod sursa(job #1851232)
Utilizator | Data | 19 ianuarie 2017 15:37:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
bool v[2000005];
int main()
{
int n,i,j,c=0;
f>>n;
int sq=sqrt(n);
for(i=2;i<=sq;i++)
{
if(v[i]==0)
{
for(j=2*i;j<=n;j+=i)
v[j]=1;
}
}
for(i=2;i<=n;i++)
if(v[i]==0)
c++;
g<<c;
return 0;
}