实现一个算法1/2+1/3+1/4+........Hangover问题

#include <iostream>
using namespace std;

int Search(double Hangover[],double temp)
{
int i=0,j=277;
if(temp<Hangover[0])
return 0;
if(temp>Hangover[277])
return 277;
while(i+1 != j)
{
if(temp<Hangover[(i+j)/2])
j = (i+j)/2;
else
i = (i+j)/2;
}
return j;
}

int main()
{
double fOverhang[278];
double sum=0;
int i=0;
int number;
char Overhang[10];
while(i<278)
{
fOverhang[i]=sum;
sum += 1.0/(i+2);
i++;
}
while(scanf("%s",&Overhang))
{
Overhang[4]='/0';
float temp = atof(Overhang);
if(temp<0.0001)
break;
number = Search(fOverhang,temp);
printf("%d card(s)/n",number);
}
return 0;
}