POJ 1837 Balance
来源:互联网 发布:个人简介网站html源码 编辑:程序博客网 时间:2024/05/21 13:59
Balance
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 11138 Accepted: 6917
Description
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.
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
题意:天平的臂长是15,给出挂钩的数量和位置及砝码的数量和质量,求满足天平平衡的方案数量
#include <iostream>#include <stdio.h>#include <math.h>#include <string.h>using namespace std;int s[50],w[50];int dp[50][15010];//DP[i][j]其中i代表砝码的数量,j代表平衡状态,但因其不能为负数,又15*20*25=7500,故将7500作为平衡点int main(){ int n,m; while(scanf("%d%d",&n,&m)!=EOF) { memset(dp,0,sizeof(dp)); for(int i=1; i<=n; i++) { scanf("%d",&s[i]);//挂钩位置 } for(int i=1; i<=m; i++) { scanf("%d",&w[i]);//砝码质量 } dp[0][7500]=1; for(int i=1; i<=m; i++) { for(int j=0; j<=15000; j++) { for(int k=1; k<=n; k++) { dp[i][j+s[k]*w[i]]+=dp[i-1][j];//状态方程 } } } printf("%d\n",dp[m][7500]); } return 0;}
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
- VS.NET版本与VC版本对应关系
- 黑马程序员-OC语言类和对象
- 标准CC++获取当前时间(毫秒级)
- jsoi2012省队集训:集合计数
- ADI CCES将不支持VDK,而是使用ucOS替代
- POJ 1837 Balance
- A. Fox And Snake
- 国际化string.xml,字符串显示的载体Label
- 外挂技术-回城补给设计与补给条件测试
- Foxmail新建文件夹后,邮件连同文件夹都找不到了
- localtime和localtime_r
- HTTP 错误 404.13 - Not Found 请求筛选模块被配置为拒绝超过请求内容长度的请求。
- 数据转换(字节数组转文件、文件转字节数组、16进制字符转字节数组、字节数组转16进制字符)
- 《链表总结》