Divisibility
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 7707 | Accepted: 2644 |
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
Source
分析:这题应该很容易想到把数的和模k,这样就能减少状态,然后就是一个普通的01背包来搞了。。。其实也算不上背包吧,只是个递推= =
代码:
#include<cstdio>
#define get(x) ((x)<0?(-(x))%k:(x)%k)
using namespace std;
const int mm=11111;
int a[mm];
bool f[2][111];
int i,j,g1,g2,n,k;
int main()
{
while(scanf("%d%d",&n,&k)!=-1)
{
for(i=0;i<n;++i)scanf("%d",&a[i]);
for(i=0;i<k;++i)f[0][i]=0;
f[0][get(a[0])]=1;
for(g2=0,g1=i=1;i<n;++i)
{
g1=!g1,g2=!g2;
for(j=0;j<k;++j)f[g2][j]=0;
for(j=0;j<k;++j)
if(f[g1][j])f[g2][get(j+a[i])]=f[g2][get(j-a[i])]=1;
}
if(f[g2][0])puts("Divisible");
else puts("Not divisible");
}
return 0;
}