void solve(int a,int b) {
int state = query(a,n-1,0,n-1,1);
if(0 == state) {
cout << "Can not put any one." << endl;
return ;
}
int first = ffir(a);
int second;
if(state < b)
second = fsec(a,state);
else
second = fsec(a,b);
put(first,second,0,n-1,1);
printf("%d %d\n",first,second);
}
/**
* Stop given timer.
*
* @deprecated This function shall be removed soon, since
* it is not related to the hashing library main functionality.
*
* @param timer the timer to stop
* @return number of seconds timed
*/
double rhash_timer_stop(timedelta_t* timer)
{
timedelta_t end;
get_timedelta(&end);
#ifdef _WIN32
*timer = end - *timer;
#else
timer->tv_sec = end.tv_sec - timer->tv_sec - (end.tv_usec >= timer->tv_usec ? 0 : 1);
timer->tv_usec = end.tv_usec + (end.tv_usec >= timer->tv_usec ? 0 : 1000000 ) - timer->tv_usec;
#endif
return fsec(timer);
}
