暑假选拔赛01 ---- Chufa
来源:互联网 发布:linux最新内核版本 编辑:程序博客网 时间:2024/05/18 17:56
Problem Description
给出两个正整数m、n,输出m/n的精确值。
如果m/n是整数或有限小数,那么直接输出它的值。
如果m/n是无限小数,那么输出小数点后到第一个最小循环节为止,并用”()”把最小循环节括起来。
比如,4/2=2,输出”2”;1/5=0.2,输出”0.2”;5/6=0.833333…,输出”0.8(3)”。
Input
输入第一行为一个正整数T,表示有T组测试数据。
接下去T行,每行为一组数据。每行两个个正整数m、n,含义如上。
1<=m<=6,1<=n<=8。
Output
每个样例一行,输出答案。
Sample Input
3
4 2
1 5
5 6
Sample Output
2
0.2
0.8(3)
解题思路
总共n*m=48种情况,直接打表!
参考代码
#include <stdio.h>const char* p[8][6] = {"1","2","3","4","5","6","0.5","1","1.5","2","2.5","3","0.(3)","0.(6)","1","1.(3)","1.(6)","2","0.25","0.5","0.75","1","1.25","1.5","0.2","0.4","0.6","0.8","1","1.2","0.1(6)","0.(3)","0.5","0.(6)","0.8(3)","1","0.(142857)","0.(285714)","0.(428571)","0.(571428)","0.(714285)","0.(857142)","0.125","0.25","0.375","0.5","0.625","0.75"};int main(){ int T; scanf("%d",&T); while (T--){ int n,m; scanf("%d %d",&m,&n); printf("%s\n",p[n-1][m-1]); } return 0;}
0 0
- 暑假选拔赛01 ---- Chufa
- 暑假选拔赛01 ---- Prime
- 暑假选拔赛01 ---- code
- 暑假选拔赛01 ---- 数字问题
- 暑假选拔赛02 ---- Ysequence
- 暑假选拔赛02 ---- money
- 暑假选拔赛02 ---- 可行方案
- 暑假选拔赛02 ---- 最大乘积
- 暑假培训选拔赛的一道题
- 暑假选拔赛02 ---- an easy problem
- 2010-zzuli暑假集训选拔赛四场总结
- 2013年暑假队内选拔赛题解1
- 2013年暑假队内选拔赛题解2
- 2013年暑假队内选拔赛题解3
- 2013年暑假队内选拔赛题解4
- 组队选拔赛01 ---- trener
- 组队选拔赛01 ---- kusac
- 组队选拔赛01 ---- volim
- python tornado 搭建webServer
- LinearLayout测量过程分析
- poj 3122 pie
- Git bisect/blame
- 关于自适应屏幕,设置子元素浮动,父div不能包裹子div,子元素中内容溢出的问题。
- 暑假选拔赛01 ---- Chufa
- Unity 对象池
- CONST
- 分类——逻辑回归模型
- 黑马程序员_JAVA之GUI与Socket
- cocos2d学习之旅(零)
- Python监控进程性能数据并绘图保存为PDF文档
- C++运算符优先级
- windows 文件或文件夹权限问题