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
用了同余定理还有动态规划;
dp[i][j]表示处理到第i个数对k取余为j为真;
其中用到了怎么处理负数取余。若(j+a[i])为负,则(a[i]+J)%k为负,而余数范围为(0,k-1); 所以要用这种形式( (a[i]+j)%k +k)%k;
其中(a[i]+j)%k+k是为了保证的得到的数是个正数,然后再对k取余的得到余数。若直接是(a[i]+j+k)%k则不能保证a[i]+j+k是个正数,所以要先取余再加 k;
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
bool dp[10010][110];
int a[10010];
int main()
{
int n,k;
while(scanf("%d%d",&n,&k)!=EOF)
{
memset(dp,false,sizeof(dp));
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
dp[1][(a[1]%k+k)%k]=true;
for(int i=2;i<=n;i++)
{
for(int j=0;j<k;j++)
{
if(dp[i-1][j])//先找到第i-1个数对k取余的余数,然后a[i]加上或减去余数再对k取余得到前i个数对k取余的结果;
{
dp[i][((j+a[i])%k+k)%k]=true;
dp[i][((j-a[i])%k+k)%k]=true;
}
}
}
if(dp[n][0])//处理完n个数对k取余为0即是ap[n][0],判断其是否为真;
{
printf("Divisible\n");
}
else
printf("Not divisible\n");
}
return 0;
}