UVA11005 Cheapest Base【数学】

When printing text on paper we need ink. But not every character needs the same amount of ink to print: letters such as ’W’, ’M’ and ’8’ are more expensive than thinner letters as ’i’, ’c’ and ’1’. In this problem we will evaluate the cost of printing numbers in several bases.

As you know, numbers can be expressed in several different bases. Well known bases are binary (base 2; digits 0 and 1), decimal (base 10; digits 0 to 9) and hexadecimal (base 16; digits 0 to 9 and letters A to F). For the general base n we will use the first n characters of the string “0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ”,which means the highest base in this problem is 36. The lowest base is of course 2.

Every character from this string has an associated cost, represented by an integer value between 1 and 128. The cost to print a number in a certain base is the sum of the costs of all characters needed to represent that number. For the numbers given in the input, you will have to calculate the cheapest base(s) to represent this number in. Numbers in any base are printed without leading zeros.

Input

The input has less than 25 test cases. The first line of input file denotes this number of test cases. The description of every test case is given below:

The first 4 lines of every case contain 9 integers each: the costs of the 36 characters in the order given above. Then follows the number of queries on a line by itself. Every query appears on a line by itself and is formed by a number between 0 and 2000000000 in decimal format.

Output

For every case in the input, print one line ‘Case X:’, without the quotes, where X is the case number starting from 1.

For every query within a case print one line ‘Cheapest base(s) for number Y :’ followed by the cheapest base(s) in increasing order, separated by one space. Y is the query in decimal format. Print a blank line between cases.

The numbers in the second sample output are actually all in one line just like the first sample output. Due to lack of horizontal space they are shown broken in two lines.

Sample Input

10 8 12 13 15 13 13 16 9

11 18 24 21 23 23 23 13 15

17 33 21 23 27 26 27 19 4

22 18 30 30 24 16 26 21 21

98329921

12345

800348

873645

1 1 1 1 1 1 1 1 1

100

Sample Output

Case 1:

Cheapest base(s) for number 98329921: 24

Cheapest base(s) for number 12345: 13 31

Cheapest base(s) for number 800348: 31

Cheapest base(s) for number 14: 13

Cheapest base(s) for number 873645: 22

Case 2:

Cheapest base(s) for number 0: 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 1920 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

Cheapest base(s) for number 1: 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 1920 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

Cheapest base(s) for number 10: 11 12 13 14 15 16 17 18 19 20 21 22 23 24 2526 27 28 29 30 31 32 33 34 35 36

Cheapest base(s) for number 100: 11 12 13 14 15 16 17 18 19 20 21 22 23 24 2526 27 28 29 30 31 32 33 34 35 36

问题链接：UVA11005 Cheapest Base

问题简述：（略）

问题分析：

关键是读懂题意！不解释。

程序说明：（略）

题记：把功能封装到函数是个好主意。

参考链接：（略）

AC的C++语言程序如下：

/* UVA11005 Cheapest Base */#include <bits/stdc++.h>using namespace std;const int N = 36;
int costs[N];
int v[N], vcnt;int cost(int n, int m)
{int rtn = 0;if(n) {while(n) {rtn += costs[n % m];n /= m;}}return rtn;
}void calc(int n)
{int min = INT_MAX, t;vcnt = 0;for(int i=2; i<=N; i++) {t = cost(n, i);if(t == min)v[vcnt++] = i;else if(t < min){min = t;vcnt = 0;v[vcnt++] = i;}}
}int main()
{int t, caseno = 0, q, n;scanf("%d", &t);while(t--) {for(int i=0; i<N; i++)scanf("%d", &costs[i]);if(++caseno > 1)putchar('\n');printf("Case %d:\n", caseno);scanf("%d", &q);while(q--) {scanf("%d", &n);calc(n);printf("Cheapest base(s) for number %d:", n);for(int i=0; i<vcnt; i++)printf(" %d", v[i]);putchar('\n');}}return 0;
}

UVA11005 Cheapest Base【数学】相关推荐

Competitive Programming 3题解
题目一览: Competitive Programming 3: The New Lower Bound of Programming Contests(1) Competitive Programm ...
π-Algorithmist分类题目（1）
原题网站:Algorithmist,http://www.algorithmist.com/index.php/Main_Page π-Algorithmist分类题目(1) Sorting UVAL ...
Excel函数词典（483个函数说明 Excel函数公式Excel小技巧
Excel函数词典(483个函数说明 Excel函数公式Excel小技巧函数类别属性新函数说明语法 BETADIST 兼容性函数被替换 BETA.DIST 返回累积 beta 概率密度函 ...
【202105小白训练营】-day02 java基础
后端开发工程师市场最具竞争力,专业技能,随着软件技术成熟,时代发展,软件工程师学习核心重点发生变化 1)早期程序员20年前,学习重点五笔字型(练习打字120),网络建网,语言入门c,vb 2)早期程 ...
高薪聘请2021/2022届本/硕/博数学、物理、统计、计算机、软件等专业 1、量化软件开发工程师(本科211以上)base北上杭深关键词:c++、python、java软件开发
高薪聘请2021/2022届本/硕/博数学.物理.统计.计算机.软件等专业 1.量化软件开发工程师 (本科211以上)base北上杭深关键词:c++.python.java软件开发年40-70万 ...
Python学习笔记17：标准库之数学相关（math包，random包）
前面几节看得真心累.如今先来点简单easy理解的内容. 一 math包 math包主要处理数学相关的运算. 常数 math.e # 自然常数e math.pi # 圆周率pi 运算函数 math ...
Numpy入门教程：04. 数学函数
背景什么是 NumPy 呢? NumPy 这个词来源于两个单词 – Numerical和Python.其是一个功能强大的 Python 库,可以帮助程序员轻松地进行数值计算,通常应用于以下场景: 执 ...
程序员的数学3 线性代数_在编程大佬眼中，线性代数到底是什么样的？
线性代数是什么? 在大学数学学科中,线性代数是最为抽象的一门课,从初等数学到线性代数的思维跨度比微积分和概率统计要大得多.很多人学过以后一直停留在知其然不知其所以然的阶段,若干年之后接触图形编程或机 ...
python数学库的使用方法_浅谈numpy库的常用基本操作方法
NumPy数组的维数称为秩(rank),一维数组的秩为1,二维数组的秩为2,以此类推.在NumPy中,每一个线性的数组称为是一个轴(axes),秩其实是描述轴的数量.比如说,二维数组相当于是一个一维数 ...

UVA11005 Cheapest Base【数学】

UVA11005 Cheapest Base【数学】相关推荐

最新文章

热门文章