A8922 | Nearest Fraction
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given three positive integers $x,y,n$ . Your task is to find the nearest fraction to fraction  whose denominator is no more than $n$ .
Formally, you should find such pair of integers $a,b$ $(1<=b<=n; 0<=a)$ that the value  is as minimal as possible.
If there are multiple "nearest" fractions, choose the one with the minimum denominator. If there are multiple "nearest" fractions with the minimum denominator, choose the one with the minimum numerator.
Formally, you should find such pair of integers $a,b$ $(1<=b<=n; 0<=a)$ that the value  is as minimal as possible.
If there are multiple "nearest" fractions, choose the one with the minimum denominator. If there are multiple "nearest" fractions with the minimum denominator, choose the one with the minimum numerator.
输入格式
A single line contains three integers $x,y,n$ $(1<=x,y,n<=10^{5})$ .
输出格式
Print the required fraction in the format " $a$ / $b$ " (without quotes).
输入输出样例
输入 #1
3 7 6
输出 #1
2/5
输入 #2
7 2 4
输出 #2
7/2
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted