POJ 1745 Divisibility
2016-08-10 10:37
489 查看
Divisibility
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld& %llu
SubmitStatusPracticePOJ
1745
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.
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.
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<stdio.h> #include<string.h> #include<algorithm> using namespace std; int a[10010]; bool dp[10010][101];//注意范围问题; int main() { int n,k; while(scanf("%d%d",&n,&k)!=EOF) { memset(dp,0,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]) { dp[i][((j-a[i])%k+k)%k]=true; dp[i][((j+a[i])%k+k)%k]=true; } } } if(dp [0]) printf("Divisible\n"); else printf("Not divisibl 4000 e\n"); } }
相关文章推荐
- poj 1745 Divisibility(DP)
- poj 1745 Divisibility
- POJ---1745 Divisibility【动态规划】
- poj1745 Divisibility(动态规划经典题)
- POJ 1745:Divisibility 枚举某一状态的DP
- poj1745 Divisibility
- poj 1745 Divisibility
- POJ 1745 Divisibility
- POJ 1745:Divisibility 枚举某一状态的DP
- poj 1745 Divisibility
- POJ 1745 Divisibility(Java)
- poj 1745-Divisibility
- POJ 1745 Divisibility (DP)
- POJ 1745 Divisibility 笔记
- poj 1745 Divisibility
- POJ 1745 Divisibility(0,1背包)(好题)
- poj 1745 Divisibility(DP + 数学)
- POJ 1745 Divisibility (线性dp)
- POJ 题目1745 Divisibility(DP)
- POJ 1745 Divisibility