From 4ae5c13e9355cfdef0d0aed113af6b7a54186011 Mon Sep 17 00:00:00 2001 From: changxiangzhong Date: Wed, 14 Dec 2016 09:54:12 +0100 Subject: [PATCH] Update 02.10.md --- ebook/zh/02.10.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ebook/zh/02.10.md b/ebook/zh/02.10.md index 5e7773590..f53305be3 100644 --- a/ebook/zh/02.10.md +++ b/ebook/zh/02.10.md @@ -2,7 +2,7 @@ ### 题目大意： -You're given k arrays, each array has k integers. There are kk ways to pick exactly one element in each array and calculate the sum of the integers. Your task is to find the k smallest sums among them. +You're given k arrays, each array has k integers. There are k^k ways to pick exactly one element in each array and calculate the sum of the integers. Your task is to find the k smallest sums among them. #### Input There will be several test cases. The first line of each case contains an integer k (2<=k<=750). Each of the following k lines contains k positive integers in each array. Each of these integers does not exceed 1,000,000. The input is terminated by end-of-file (EOF). The size of input file does not exceed 5MB.