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

建议使用的浏览器:

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

1715:Hexadecimal Numbers

题目描述
The base of the hexadecimal system is 16. In order to write down numbers in this system one uses 16 digits 0,1,...,9,A,B,C,D,E,F. The capital letters A,..,F stands for 10,..,15, respectively. For instance the value of the hexadecimal number CF2 is 12 * 162 + 15 * 16 + 2 = 3314 in the decimal system. Let X be the set of all positive integers whose hexadecimal representations have at most 8 digits and do not contain repetitions of any digit. The most significant digit in such a representation is not zero. The largest element in X is the number with the hexadecimal representation FEDCBA98, the second largest is the number FEDCBA97, the third is FEDCBA96 and so forth.
Write a program that: finds the n-th largest element of X;
输入解释
The first line of the file standard input contains integer n in the decimal representation. n does not exceed the number of elements of X.
输出解释
Your program should output the n-th largest element in X in the hexadecimal representation.
输入样例
11
输出样例
FEDCBA87

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

题目来源 CEOI 1997

源链接: POJ-1715

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

共提交 0

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