747:Divisibility

最新推荐文章于 2021-05-23 14:20:36 发布

touristourist

最新推荐文章于 2021-05-23 14:20:36 发布

阅读量364

点赞数

CC 4.0 BY-SA版权

分类专栏： openjudge 文章标签： dp

本文链接：https://blog.youkuaiyun.com/touristourist/article/details/90553080

该博客讨论如何确定一个整数序列是否可以通过添加加减运算符使其结果能被K整除。采用动态规划的方法，用dp[i][j]记录前i个数组合得到的余数为j的可能性。博客提供了输入输出示例，并提到了C++中处理负数模运算的注意事项。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

Consider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expressions that evaluate to different values. Let us, for example, take the sequence: 17, 5, -21, 15. There are eight possible expressions: 17 + 5 + -21 + 15 = 16
17 + 5 + -21 - 15 = -14
17 + 5 - -21 + 15 = 58
17 + 5 - -21 - 15 = 28
17 - 5 + -21 + 15 = 6
17 - 5 + -21 - 15 = -24
17 - 5 - -21 + 15 = 48
17 - 5 - -21 - 15 = 18
We call the sequence of integers divisible by K if + or - operators can be placed between integers in the sequence in such way that resulting value is divisible by K. In the above example, the sequence is divisible by 7 (17+5+-21-15=-14) but is not divisible by 5.

You are to write a program that will determine divisibility of sequence of integers.

Input

The first line