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
给你n个数,使他们之间相加或相减,问他们的和能否被k整除。
dp[i][j]表示前i个数相加或相减对k取余为j成立.
因此如果dp[i-1][j]==1,那么如果下一个为'+',则t=(j+a[i])%k,但为了防止负数的出现t=((j+a[i])%k+k)%k,
同理:如果为'+',则t=((j-a[i])%k+k)%k;
最后判断如果dp[n][0]==1,则输出Divisible.
代码如下:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[10010][110];
int a[10010];
int main()
{
int n,i,j,k,t;
while(scanf("%d%d",&n,&k)!=EOF)
{
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
memset(dp,0,sizeof(dp));
dp[0][0]=1;//初始化
for(i=1;i<=n;i++)
{
for(j=0;j<k;j++)
{
if(dp[i-1][j])
{
t=((j+a[i])%k+k)%k;
dp[i][t]=1;
t=((j-a[i])%k+k)%k;
dp[i][t]=1;
}
}
}
if(dp[n][0])
printf("Divisible\n");
else
printf("Not divisible\n");
}
return 0;
}