动态规划 || Divisibility(背包变种)
2018-03-12 12:25
183 查看
Divisibility
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
bool dp[i][j]:前i个数计算完成后,除以k的余数为j的情况是否存在#include <iostream>
#include <stdio.h>
#include <memory.h>
using namespace std;
int n,k;
int a[10005];
bool dp[10005][205];
int main() {
while(~scanf("%d%d",&n,&k)){
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
memset(dp,0,sizeof(dp));
dp[1][a[1]%k]=1;
for(int i=2;i<=n;i++){
for(int j=-k+1;j<k;j++){
if(dp[i-1][j]==1){
dp[i][(j+a[i])%k]=1;
dp[i][(j-a[i])%k]=1;
}
}
}
if(dp
[0])printf("Divisible\n");
else printf("Not divisible\n");
}
return 0;
}
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
bool dp[i][j]:前i个数计算完成后,除以k的余数为j的情况是否存在#include <iostream>
#include <stdio.h>
#include <memory.h>
using namespace std;
int n,k;
int a[10005];
bool dp[10005][205];
int main() {
while(~scanf("%d%d",&n,&k)){
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
memset(dp,0,sizeof(dp));
dp[1][a[1]%k]=1;
for(int i=2;i<=n;i++){
for(int j=-k+1;j<k;j++){
if(dp[i-1][j]==1){
dp[i][(j+a[i])%k]=1;
dp[i][(j-a[i])%k]=1;
}
}
}
if(dp
[0])printf("Divisible\n");
else printf("Not divisible\n");
}
return 0;
}
相关文章推荐
- 动态规划之背包变种
- 动态规划解背包问题/C++/Knapsack problem
- 动态规划-背包问题求解过程【代码 from eason】
- 动态规划 背包问题 C++
- 动态规划之0-1背包问题
- 洛谷 1164——小A点菜(动态规划的背包问题)
- Pick apples(动态规划,难点背包容量太大)
- 动态规划0/1背包问题和数字三角形
- leetcode 279. Perfect Squares 类似背包问题 + 很简单的动态规划DP解决
- 动态规划解决0-1背包问题
- 动态规划之0-1背包问题
- 动态规划之0-1背包问题
- 动态规划之0-1背包问题,钢条切割
- 基于C的动态规划0-1背包问题
- 动态规划之背包问题详解
- 动态规划 (三) 背包问题
- 动态规划解决0-1背包问题
- 01背包问题动态规划详解
- 动态规划7:砝码和种类优化成01背包问题
- 0-1背包问题的动态规划解法