题库练习 Modulo Sum
← 上一题 下一题 →

A10019 | Modulo Sum

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

You are given a sequence of numbers $a_{1},a_{2},...,a_{n}$ , and a number $m$ .

Check if it is possible to choose a non-empty subsequence $a_{ij}$ such that the sum of numbers in this subsequence is divisible by $m$ .

输入格式

The first line contains two numbers, $n$ and $m$ ( $1<=n<=10^{6}$ , $2<=m<=10^{3}$ ) — the size of the original sequence and the number such that sum should be divisible by it.

The second line contains $n$ integers $a_{1},a_{2},...,a_{n}$ ( $0<=a_{i}<=10^{9}$ ).

输出格式

In the single line print either "YES" (without the quotes) if there exists the sought subsequence, or "NO" (without the quotes), if such subsequence doesn't exist.

输入输出样例

输入 #1
3 5
1 2 3
输出 #1
YES
输入 #2
1 6
5
输出 #2
NO
输入 #3
4 6
3 1 1 3
输出 #3
YES
输入 #4
6 6
5 5 5 5 5 5
输出 #4
YES
C++ 编辑器
输入
输出