F. Zero Remainder Sum---Codeforces Round #677 (Div. 3)--题解

RTFIL

于 2020-11-07 16:44:53 发布

阅读量204

点赞数

分类专栏： # codeforces

本文链接：https://blog.csdn.net/qq_43516113/article/details/109548803

版权

这篇博客介绍了Codeforces Round #677 (Div. 3)中的一道题目——F. Zero Remainder Sum。内容包括如何在限制条件下选择矩阵元素，使每行不超过一半元素的和能被k整除，并求出最大这样的和。博主通过观察样例和直觉发现了一种规律，并验证了其正确性。

摘要由CSDN通过智能技术生成

F. Zero Remainder

F. Zero Remainder Sum

You are given a matrix a of size n×m consisting of integers.

You can choose no more than ⌊m2⌋ elements in each row. Your task is to choose these elements in such a way that their sum is divisible by k and this sum is the maximum.

In other words, you can choose no more than a half (rounded down) of elements in each row, you have to find the maximum sum of these elements divisible by k.

Note that you can choose zero elements (and the sum of such set is 0).

Input
The first line of the input contains three integers n, m and k (1≤n,m,k≤70) — the number of rows in the matrix, the number of columns in the matrix and the value of k. The next n lines contain m elements each, where the j-th element of the i-th row is ai,j (1≤ai,j≤70).

Output
Print one integer — the maximum sum divisible by k you can obtain.

Examples
inputCopy
3 4 3
1 2 3 4
5 2 2 2
7