POJ-1745 Divisibility
来源:互联网 发布:java中public的翻译 编辑:程序博客网 时间:2024/05/21 10:38
Divisibility
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11509 Accepted: 4124
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
Source
Northeastern Europe 1999
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int dp[11000][110];//处理到第i个数 ,对k取余=j是成立的;int a[11000];int main(){int n,k,i,j;while(scanf("%d%d",&n,&k)!=EOF){for(i=1;i<=n;i++) scanf("%d",&a[i]);memset(dp,0,sizeof(dp));dp[1][((a[1]%k)+k)%k]=1;for(i=2;i<=n;i++){for(j=0;j<k;j++){if(dp[i-1][j]==1){dp[i][((j+a[i])%k+k)%k]=1;dp[i][((j-a[i])%k+k)%k]=1;}}}if(dp[n][0]==1) printf("Divisible\n");else printf("Not divisible\n");}return 0; }
0 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】
- POJ 3666
- c/c++常见知识点
- iOS 事件处理机制与图像渲染过程
- HDU 5813 Elegant Construction (构造有向图)
- JAVA成员变量和局部变量的区别
- POJ-1745 Divisibility
- MFC---多种方式显示位图
- 使用Http访问网络
- 判断素数的几种方法 杭电OJ 1397
- Hibernate实体类注解配置与xml配置
- ButterKnife使用详解
- Android概述、Common Layout介绍
- javascript数组去重
- java源码分析之集合架构 Collection 02