POJ 1745 Divisiblity
来源:互联网 发布:朱元璋书法 知乎 编辑:程序博客网 时间:2024/05/18 16:16
Divisibility
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 12386 Accepted: 4421
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
Source
Northeastern Europe 1999
背包:
#include <iostream>#include <cmath>#include <cstring>#include <cstdio>#include <algorithm>#include <map>#define maxn 1010using namespace std;typedef long long ll;ll s[maxn];ll dp[maxn][110];int main(){ int n; int k; ll sum=0; while(scanf("%d",&n)==1) { scanf("%d",&k); sum=0; memset(dp,0,sizeof(dp)); int a; bool flag=false; for(int i=1;i<=n;i++) { scanf("%d",&a); s[i]=(a+k*10000)%k; } dp[1][s[1]]=1; for(int i=2;i<=n;i++) { for(int j=k-1;j>=0;j--) { if(dp[i-1][j]) { dp[i][(j+s[i])%k]=1; dp[i][(j-s[i]+k)%k]=1; } } } if(dp[n][0]) { printf("Divisible\n"); } else printf("Not divisible\n"); } return 0;}
- POJ 1745 Divisiblity
- codeforces876B Divisiblity of Differences
- Codeforces876B-Divisiblity of Differences
- - Divisiblity of Differences CodeForces
- Codeforces 876B. Divisiblity of Differences
- Codeforces Round #441 B.Divisiblity of Differences
- Codeforces 876 B Divisiblity of Differences
- CF B. Divisiblity of Differences【water+WA9】
- codeforces round #441 B. Divisiblity of Differences
- CodeForces 876B Divisiblity of Differences
- Codeforces Round #441 B. Divisiblity of Differences
- Codeforces 876B Divisiblity of Differences
- Codeforces Round #441 B. Divisiblity of Differences
- codeforces 876B Divisiblity of Differences
- Codeforces 876B Divisiblity of Differences 题解
- CodeForces-876B Divisiblity of Differences
- Codeforces Round #441 Div 2 B. Divisiblity of Differences
- Codeforces-876B-Divisiblity of Differences(取模)
- 第五章 引用类型(下)
- Spark缘起
- 暑期集训之统计同成绩同学的人数
- HDU1506Largest Rectangle in a Histogram(单调栈)
- IDEA基础入门
- POJ 1745 Divisiblity
- 14 Three.js绘制字体模型
- B1036
- 【Redis进阶】redis.conf详解
- Opencv--Mat笔记
- MST
- Knight Tournament CodeForces
- OpenGL 绘制二维图形
- [BZOJ2237]龙珠雷达