法里数列--uva

#include <iostream>
#include <set>
#include <cstdio>
#include <map>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
using namespace std;
typedef long long LL;
const double  ans=1e-6;
int main(){
   int time;
   cin>>time;
    while(time--){
        int kase,m;
        double min;
        cin>>kase>>m>>min;
        int x1=0,y1=1,x3=1,y3=1;
        while(1){
            int x2 = (x1 + x3),y2 = (y1+y3);
            if(y2>m) break;
            if(x2*1.0/y2>=min){
                x3=x2;
                y3=y2;
            }else{
                x1=x2;
                y1=y2;
            }
        }
        cout<<kase;
        if(fabs(x1*1.0/y1-min)>=fabs(x3*1.0/y3-min)){
            cout<<" "<<x3<<"/"<<y3<<endl;
        }else{
            cout<<" "<<x1<<"/"<<y1<<endl;
        }
    }

}