当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1969:Count on Canton

题目描述
One of the famous proofs of modern mathematics is Georg Cantor's demonstration that the set of rational numbers is enumerable. The proof works by using an explicit enumeration of rational numbers as shown in the diagram below.
1/1 1/2 1/3 1/4 1/5 ...

2/1 2/2 2/3 2/4
3/1 3/2 3/3
4/1 4/2
5/1

In the above diagram, the first term is 1/1, the second term is 1/2, the third term is 2/1, the fourth term is 3/1, the fifth term is 2/2, and so on.
输入解释
The input list contains a single number per line and will be terminated by endof-file.
输出解释
You are to write a program that will read a list of numbers in the range from 1 to 10^7 and will print for each number the corresponding term in Cantor's enumeration as given below.
输入样例
3
14
7
输出样例
TERM 3 IS 2/1
TERM 14 IS 2/4
TERM 7 IS 1/4

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-1969

最后修改于 2020-10-29T06:19:19+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 30000