Clock
Notice that the answer must be not more 180 and not less than 0
for each case,one line include the time
0≤hh<24,0≤mm<60,0≤ss<60
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <bitset>
#include <string>
#include <vector>
#include <iomanip>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int a,b,c;
scanf("%d:%d:%d",&a,&b,&c);
if(a>12)
{
a-=12;
}
int num1=(60*b+c+3600*a);
int num2=(12*c+720*b);
int num3=(720*c);
int ans1;
int ans2;
int ans3;
if(num1>num2)
{
ans1=num1-num2;
}
else
{
ans1=num2-num1;
}
//cout<<num1<<" "<<num2<<" "<<num3<<endl;
if(num1>num3)
{
ans2=num1-num3;
}
else
{
ans2=num3-num1;
}
if(num2>num3)
{
ans3=num2-num3;
}
else
{
ans3=num3-num2;
}
if(ans1>360*120)
{
ans1=-360*120+ans1;
}
if(ans2>360*120)
{
ans2=-360*120+ans2;
}
if(ans3>360*120)
{
ans3=-360*120+ans3;
}
//cout<<ans1<<" "<<ans2<<" "<<ans3<<endl;
if(ans1>180*120)
{
ans1=360*120-ans1;
}
if(ans2>180*120)
{
ans2=360*120-ans2;
}
if(ans3>180*120)
{
ans3=360*120-ans3;
}
//cout<<ans1<<" "<<ans2<<" "<<ans3<<endl;
int gcd1=__gcd(ans1,120);
int gcd2=__gcd(ans2,120);
int gcd3=__gcd(ans3,120);
if(gcd1==120)
{
printf("%d ",ans1/120);
}
else
{
printf("%d/%d ",ans1/gcd1,120/gcd1);
}
if(gcd2==120)
{
printf("%d ",ans2/120);
}
else
{
printf("%d/%d ",ans2/gcd2,120/gcd2);
}
if(gcd3==120)
{
printf("%d ",ans3/120);
}
else
{
printf("%d/%d ",ans3/gcd3,120/gcd3);
}
printf("\n");
}
return 0;
}