博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
poj 1837 Balance
阅读量:4608 次
发布时间:2019-06-09

本文共 2982 字,大约阅读时间需要 9 分钟。

Balance
Time Limit: 1000MS   Memory Limit: 30000K
Total Submissions: 8754   Accepted: 5320

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.

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.

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

Source

// 递推   #include 
#include
#include
#include
#include
#include
using namespace std;#define MOD 1000000007int dp[30][15010];// dp[i][j] 表示在用了 i个砝码后 天平平衡度为 j 时的总数int M[30][30]; // 列 表示砝码 行是挂钩int main(){ int C,G; while(scanf("%d %d",&C,&G)!=EOF){ int i,j,k; for(i=1;i<=C;i++) scanf("%d",&M[0][i]); int len=7500;//开始脑残的把len写成 M[i][j]的正或负数累加和 、、、 for(i=1;i<=G;i++) scanf("%d",&M[i][0]); for(i=1;i<=G;i++) for(j=1;j<=C;j++){ M[i][j]=M[0][j]*M[i][0]; } for(i=1;i<=G;i++) for(j=0;j<=2*len;j++) dp[i][j]=0; for(i=1;i<=C;i++) if(M[1][i]>=0) dp[1][M[1][i]]=1; else dp[1][-M[1][i]+len]=1; int temp; for(i=2;i<=G;i++) for(j=1;j<=C;j++) for(k=0;k<=2*len;k++){ if(dp[i-1][k]){ if(k>len) temp=len-k+M[i][j]; else temp=k+M[i][j]; if(temp<0) temp=-temp+len; dp[i][temp]+=dp[i-1][k]; } } printf("%d\n",dp[G][0]); } return 0;}

 

转载于:https://www.cnblogs.com/372465774y/p/3184360.html

你可能感兴趣的文章
IP报文格式及各字段意义
查看>>
(转载)rabbitmq与springboot的安装与集成
查看>>
C2. Power Transmission (Hard Edition)(线段相交)
查看>>
STM32F0使用LL库实现SHT70通讯
查看>>
Atitit. Xss 漏洞的原理and应用xss木马
查看>>
MySQL源码 数据结构array
查看>>
(文件过多时)删除目录下全部文件
查看>>
T-SQL函数总结
查看>>
python 序列:列表
查看>>
web移动端
查看>>
pythonchallenge闯关 第13题
查看>>
linux上很方便的上传下载文件工具rz和sz使用介绍
查看>>
React之特点及常见用法
查看>>
【WEB前端经验之谈】时间一年半,或沉淀、或从零开始。
查看>>
优云软件助阵GOPS·2017全球运维大会北京站
查看>>
linux 装mysql的方法和步骤
查看>>
poj3667(线段树区间合并&区间查询)
查看>>
51nod1241(连续上升子序列)
查看>>
SqlSerch 查找不到数据
查看>>
集合相关概念
查看>>