Cod sursa(job #2794386)
Utilizator | Data | 4 noiembrie 2021 19:26:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000002];
int k=0,val;
void ciur(int x)
{
v[0]=v[1]=1;
k=2;
int i,j;
for(i=4;i<=x;i+=2)
{
v[i]=1;
k++;
}
for(i=3;i*i<=x;i+=2)
{
if(v[i]==0)
for(j=i*i;j<=x;j+=2)
{
v[j]=1;
k++;
}
}
val=x+1-k;
}
int main()
{
int x;
f>>x;
ciur(x);
g<<val;
return 0;
}