POJ 1745 Divisibility
来源:互联网 发布:数据加密保密性 编辑:程序博客网 时间:2024/05/18 02:24
Divisibility
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9151 Accepted: 3187
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 717 5 -21 15
Sample Output
Divisible
直接递推做出来的
#include<cstdio>#include<cstring>using namespace std;const int MAXN=111;int d[12222][122];int main(){int N,K;int i,j,num,tmp;while(scanf("%d%d",&N,&K)==2){memset(d,0,sizeof(d));d[0][0]=1;for(i=1;i<=N;i++){scanf("%d",&num);num=(num%K+K)%K;for(j=0;j<=K;j++){if(d[i-1][j]==true){d[i][((j+num)%K+K)%K]=true;d[i][((j-num)%K+K)%K]=true;}}}if(d[N][0]==true)printf("Divisible\n");elseprintf("Not divisible\n");}return 0;}
- poj 1745 Divisibility
- POJ 1745 Divisibility
- POJ 1745 Divisibility
- POJ 1745 Divisibility
- POJ 1745 Divisibility
- poj 1745 Divisibility
- poj 1745 Divisibility
- poj 1745 Divisibility dp
- POJ 1745 Divisibility DP
- poj 1745 Divisibility
- poj 1745-Divisibility
- POJ 1745 Divisibility
- poj 1745 Divisibility (dp)
- poj 1745 Divisibility dp
- 【DP】POJ-1745 Divisibility
- poj 1745 Divisibility 【DP】
- poj 1745(Divisibility)
- 【POJ 1745 Divisibility】
- 使用ffmpeg进行视频文件转换成FLV整理
- MyEclipse 下配置WebLogic10 服务器
- 关于Linux中的链接
- webservice soap hessian
- FTP大附件上传解决方案
- POJ 1745 Divisibility
- Codeforces Beta Round #35 (Div. 2) E. Parade(成段更新)
- Android Bander设计与实现 - 设计篇
- jdk5 多线程
- bzoj 2298: [HAOI2011]problem a
- JS日期操作
- 我有想法
- Gridview的stretchMode详解附自动宽度
- 我的Android进阶之旅------>Android中解析XML 技术详解---->SAX解析、DOM解析、PULL解析