原文:
描述
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.
翻译:
有 n 个袋子。每个袋子里有一些糖果。你可以拿一些袋子。这些袋子里的糖果总数应该是 k 的倍数,因为你想在 k 的朋友之间平均分配糖果你最多能拿多少糖果?
输入:
第一行两个正整数N(小于等与100)K(小于等与1000)
第二行:N个正整数(小于等与1000
输出:
一个整数