Logo
(追記) (追記ここまで)

7433번 - Divisibility 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 128 MB65453362.264%

문제

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.

입력

The first line of the input file contains two integers, N and K (1 ≤ N ≤ 10000, 2 ≤ K ≤ 100) separated by a space.

The second line contains a sequence of N integers separated by spaces. Each integer is not greater than 10000 by it's absolute value.

출력

Write to the output file the word "Divisible" if given sequence of integers is divisible by K or "Not divisible" if it's not.

제한

예제 입력 1

4 7
17 5 -21 15

예제 출력 1

Divisible

예제 입력 2

4 5
17 5 -21 15

예제 출력 2

Not divisible

힌트

출처

ICPC > Regionals > Northern Eurasia > Northern Eurasia Finals > NEERC 1999 A번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /