F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

sum

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 6890    Accepted Submission(s): 2428


Problem Description
Given a sequence, you're asked whether there exists a consecutive subsequence whose sum is divisible by m. output YES, otherwise output NO
 

Input
The first line of the input has an integer T ($1 \leq T \leq 10$), which represents the number of test cases.
For each test case, there are two lines:
1.The first line contains two positive integers n, m ($1 \leq n \leq 100000$, $1 \leq m \leq 5000$).
2.The second line contains n positive integers x ($1 \leq x \leq 100$) according to the sequence.
 

Output
Output T lines, each line print a YES or NO.
 

Sample Input
2 3 3 1 2 3 5 7 6 6 6 6 6
 

Sample Output
YES NO
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-22 13:11:39, Gzip enabled