原文:
Candies
1000ms 65536K
描述:
There are N bags. Each bag has some candies. You can take some of the bags. the total number of candies in these bags should be a multiple of K because you want to divide the candies equally between K friends. How many candies can you take at most?
输入:
First line: two positive integers N (N <= 100) and K (K <= 1000).
Second line: N positive integers (<= 1000).
输出:
One integer.
样例输入:
5 3 4 1 5 3 1
样例输出:
12
译文:
糖果
1000ms 65536K
描述:
现在又N个袋子,每个袋子里面有一些糖果,你可以选择拿走一些袋子,并且要保证拿走袋子里的糖果总数要是K的倍数,因为你想把这些糖果平均分给K个朋友,那么你最多可以那多少糖果?
输入:
第一行包含两个正整数N(N <= 100)和K (K <= 1000)
第二行包含N个正整数,用来表示N个袋子里的糖果数
输出:
一个整数,用来表示你所能拿的最大糖果数
样例输入:
5 3 4 1 5 3 1
样例输出:
12