问题 I: Sequence

内存限制：64 MB 时间限制：6 S 标准输入输出

题目类型：传统评测方式：文本比较上传者：

提交：1 通过：1

Given m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear that we may get n ^ m this kind of sequences. Then we can calculate the sum of numbers in each sequence, and get n ^ m values. What we need is the smallest n sums. Could you help us?

The first line is an integer T, which shows the number of test cases, and then T test cases follow. The first line of each case contains two integers m, n (0 < m <= 100, 0 < n <= 2000). The following m lines indicate the m sequence respectively. No integer in the sequence is greater than 10000.

For each test case, print a line with the smallest n sums in increasing order, which is separated by a space.

3 3 4

ACM实验室训练集-基本数据结构

题目描述

输入格式

输出格式

输入样例复制

输出样例复制

分类标签