2019.3.9 提高B组 T3 JZOJ 4745 看电影

$Description$

期望猴子选大王

---

$Solution$

都说了是公平公正，显然是$k/n$

---

$Code$

#include<cstdio>
#include<algorithm>
using namespace std;int n,k,id,t;
signed main()
{
	scanf("%d%d%d",&n,&k,&id);
	if(!k) return printf("0/1")&0;
	t=__gcd(n,k);
	n/=t;k/=t;
	printf("%d/%d",k,n);
}