POJ 1837Balance
来源:互联网 发布:linux下oracle安装教程 编辑:程序博客网 时间:2024/06/14 06:28
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int C[21],G[21],dp[21][15001];int main(){ int n,m; while(~scanf("%d%d",&n,&m)) { for(int i=1; i<=n; i++) cin>>C[i]; for(int i=1; i<=m; i++) cin>>G[i]; memset(dp,0,sizeof(dp)); dp[0][7500]=1; for(int i=1; i<=m; i++) for(int j=0; j<=15000; j++) if(dp[i-1][j]) for(int k=1; k<=n; k++) dp[i][j+C[k]*G[i]]+=dp[i-1][j]; cout<<dp[m][7500]<<endl; } return 0;}
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int C[21],G[21],dp[21][15001];int main(){ int n,m; while(~scanf("%d%d",&n,&m)) { for(int i=1; i<=n; i++) cin>>C[i]; for(int i=1; i<=m; i++) cin>>G[i]; memset(dp,0,sizeof(dp)); dp[0][7500]=1; for(int i=1; i<=m; i++) for(int j=0; j<=15000; j++) if(dp[i-1][j]) for(int k=1; k<=n; k++) dp[i][j+C[k]*G[i]]+=dp[i-1][j]; cout<<dp[m][7500]<<endl; } return 0;}
Gigel has a strange "balance" and he wants to poise it. Actually, the device is different from any other ordinary balance.
It orders two arms of negligible weight and each arm's length is 15. Some hooks are attached to these arms and Gigel wants to hang up some weights from his collection of G weights (1 <= G <= 20) knowing that these weights have distinct values in the range 1..25. Gigel may droop any weight of any hook but he is forced to use all the weights.
Finally, Gigel managed to balance the device using the experience he gained at the National Olympiad in Informatics. Now he would like to know in how many ways the device can be balanced.
Knowing the repartition of the hooks and the set of the weights write a program that calculates the number of possibilities to balance the device.
It is guaranteed that will exist at least one solution for each test case at the evaluation.
Input
The input has the following structure:
• the first line contains the number C (2 <= C <= 20) and the number G (2 <= G <= 20);
• the next line contains C integer numbers (these numbers are also distinct and sorted in ascending order) in the range -15..15 representing the repartition of the hooks; each number represents the position relative to the center of the balance on the X axis (when no weights are attached the device is balanced and lined up to the X axis; the absolute value of the distances represents the distance between the hook and the balance center and the sign of the numbers determines the arm of the balance to which the hook is attached: '-' for the left arm and '+' for the right arm);
• on the next line there are G natural, distinct and sorted in ascending order numbers in the range 1..25 representing the weights' values.
• the first line contains the number C (2 <= C <= 20) and the number G (2 <= G <= 20);
• the next line contains C integer numbers (these numbers are also distinct and sorted in ascending order) in the range -15..15 representing the repartition of the hooks; each number represents the position relative to the center of the balance on the X axis (when no weights are attached the device is balanced and lined up to the X axis; the absolute value of the distances represents the distance between the hook and the balance center and the sign of the numbers determines the arm of the balance to which the hook is attached: '-' for the left arm and '+' for the right arm);
• on the next line there are G natural, distinct and sorted in ascending order numbers in the range 1..25 representing the weights' values.
Output
The output contains the number M representing the number of possibilities to poise the balance.
Sample Input
2 4-2 3 3 4 5 8
Sample Output
2
0 0
- POJ 1837 Balance
- poj 1837 Balance
- POJ 1837 Balance
- poj 1837 Balance
- POJ 1837 Balance DP
- poj 1837Balance
- POJ 1837 Balance
- Poj 1837 Balance
- POJ 1837 Balance
- POJ 1837 Balance
- POJ-1837-Balance
- POJ 1837 Balance
- POJ--1837--Balance--DP
- poj 1837 balance
- poj 1837 Balance
- poj 1837 Balance
- POJ 1837 Balance (DP)
- poj 1837-Balance
- 【P1777】引水入城 NOIP2010
- Andriod 通讯录
- __must_check含义及出处
- google In-app Billing FAQ
- Android Launcher3浅析(一)
- POJ 1837Balance
- 对CONTAINING_RECORD的理解
- 用 Hadoop 进行分布式并行编程(三)部署到分布式环境
- linux下用命令查找dos格式的文件
- 化整为零 盛大在换轨
- js 日期函数扩展
- final finally finalize的区别
- iOS中汉字转拼音
- .Net程序员玩转Android开发---(10)帧布局FrameLayout