当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
5912：Fraction
题目描述
Mr. Frog recently studied how to add two fractions up, and he came up with an evil idea to trouble you by asking you to calculate the result of the formula below:
As a talent, can you figure out the answer correctly?
As a talent, can you figure out the answer correctly?
输入解释
The first line contains only one integer T, which indicates the number of test cases.
For each test case, the first line contains only one integer n ($n\leq 8$).
The second line contains n integers: $a_1, a_2,\cdots a_n (1\leq a_i \leq 10$).
The third line contains n integers: $b_1, b_2,\cdots ,b_n (1\leq b_i \leq 10)$.
For each test case, the first line contains only one integer n ($n\leq 8$).
The second line contains n integers: $a_1, a_2,\cdots a_n (1\leq a_i \leq 10$).
The third line contains n integers: $b_1, b_2,\cdots ,b_n (1\leq b_i \leq 10)$.
输出解释
For each case, print a line “Case #x: p q”, where x is the case number (starting from 1) and p/q indicates the answer.
You should promise that p/q is irreducible.
You should promise that p/q is irreducible.
输入样例
1 2 1 1 2 3
输出样例
Case #1: 1 2
提示
Here are the details for the first sample: 2/(1+3/1) = 1/2
来自杭电HDUOJ的附加信息
| Recommend | wange2014 |
最后修改于 2020-10-25T23:26:40+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
| 时间上限 | 内存上限 |
| 2000/1000MS(Java/Others) | 65536/65536K(Java/Others) |
登陆或注册以提交代码