题目链接:点击打开链接
Divisibility
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 11557 | Accepted: 4150 |
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.
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 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.
The second line contains a sequence of N integers separated by spaces. Each integer is not greater than 10000 by it's absolute value.
Output
Write to the output file the word "Divisible" if given sequence of integers is divisible by K or "Not divisible" if it's not.
Sample Input
4 7 17 5 -21 15
Sample Output
Divisible
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n,k;
int a[10010];
bool dp[10010][110];// dp[i][j] = true 表示处理到第 i 个数对 k 取余为 j 是成立的
int main()
{
while(~scanf("%d %d",&n,&k))
{
memset(dp,false,sizeof(dp));
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
dp[1][( (a[1] % k) + k ) % k]=true;// 这里用了同余定理 (a+b)%c=(a%c+b%c)%c,a[1]对 k 取余为 ( (a[1] % k) + k ) % k是显然成立的
for(int i=2;i<=n;i++)
{
for(int j=0;j<k;j++)
{
if(dp[i-1][j]) // 还是同余定理,j 就是前 i-1 个数对 k 取余的结果,它为真,自然下面的式子就也为真了
{
dp[i][ ( (j + a[i]) % k + k ) % k ]=true;
dp[i][ ( (j - a[i]) % k + k ) % k ]=true;
}
}
}
printf(dp[n][0]?"Divisible\n":"Not divisible\n");
}
return 0;
}