Pagini recente » Cod sursa (job #122976) | Istoria paginii runda/info_test_2 | Cod sursa (job #356721) | Cod sursa (job #2038769) | Cod sursa (job #201950)
Cod sursa(job #201950)
#include <iostream>
#include <fstream>
// Ciurul lui Erastotenes
using namespace std;
int main()
{
int n;
ifstream f ("ciur.in");
f>>n;
f.close();
char b[2000000];
int i,j;
for (i=1;i<=n;i++)
b[i] = '1';
i=1;
while (i <= n/2)
{
j=1;
while (j <= n/(2*i))
{
b[(2*i+1)*(2*j+1)] = '0';
j++;
}
i++;
}
b[1] = 0;
long cont=1;
for (i=1;i<=n/2;i++)
if ((b[2*i+1] == '1') && (2*i+1<=n))
cont+=1;
ofstream g ("ciur.out");
g<<cont<<"\n";
g.close();
return 0;
}