package yukicoder356; import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args){ Scanner sc=new Scanner(System.in); int t1=sc.nextInt(); int t2=sc.nextInt(); int t3=sc.nextInt(); int lcm=LCM(t1,t2,t3); int[] d={lcm/t1,lcm/t2,lcm/t3}; Arrays.sort(d); for(int i=d[1]-1;i>=1;i--){ if(d[0]%i==d[1]%i&&d[1]%i==d[2]%i){ System.out.println(lcm+"/"+i); return; } } } //最小公倍数 public static int LCM(int t1,int t2,int t3){ return LCM(LCM(t1,t2),t3); } public static int LCM(int t1,int t2){ int a=GCD(t1,t2); int tt1=t1/a; int tt2=t2/a; return tt1*tt2*a; } public static int GCD(int t1,int t2){ if(t1