HDU1455&&POJ1011-Sticksa
2016-10-31 10:18
148 查看
Sticks
Time Limit: 2000/1000 MS (Java/Others) Memory Limit:65536/32768 K (Java/Others)
Total Submission(s): 9759 Accepted Submission(s): 2900
Problem Description
George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had originally and how long they were originally. Please help him
and design a program which computes the smallest possible original length of those sticks. All lengths expressed in units are integers greater than zero.
Input
The input contains blocks of 2 lines. The first line contains the number of sticks parts after cutting, there are at most 64 sticks. The second line contains the lengths of those parts separated by the space. The last line of the file contains zero.
Output
The output file contains the smallest possible length of original sticks, one per line.
Sample Input
9
5 2 1 5 2 1 5 2 1
4
1 2 3 4
0
Sample Output
6
5
Source
ACM暑期集训队练习赛(七)
题意: n根木棍,要求还原为原木棍,且原木棍等长,问最短长度是多少。
</pre><pre name="code" class="cpp">#include <iostream> #include <cstdio> #include <cmath> #include <cstring> #include <algorithm> #include <stack> #include <queue> #include <vector> #include <set> using namespace std; int a[110],n,sum,cnt,visit[110],flag; int cmp(int x,int y) { return x>y; } void dfs(int sum,int x,int length,int pos) { if(x==cnt) { flag=1;return ; } for(int i=pos;i<n;i++) { if(visit[i]) continue; if(sum+a[i]<length) { visit[i]=1; dfs(sum+a[i],x,length,i+1); if(flag) return ; visit[i]=0; if(sum==0) return ; while(a[i]==a[i+1]) i++; } else if(sum+a[i]==length) { visit[i]=1; dfs(0,x+1,length,0); if(flag) return ; visit[i]=0; } } } int main() { while(~scanf("%d",&n)&&n) { sum=0;flag=0; for(int i=0;i<n;i++) { scanf("%d",&a[i]); sum+=a[i]; } sort(a,a+n,cmp); memset(visit,0,sizeof visit); for(int i=a[0];;i++) { if(sum%i!=0) continue; cnt=sum/i; dfs(0,1,i,0); if(flag){printf("%d\n",i);break;} } } return 0; }
相关文章推荐
- POJ 2362 square &&POJ 1011 Sticks 记忆化搜索 DFS
- POJ 1011 递归 &amp; 回溯
- nk 1207 &&poj 1011
- hdu1455 && poj1011 Sticks(深度优先搜索 DFS 经典剪枝 详解)
- POJ 2362 && POJ 1011【深搜】
- HDU_1455 && POJ_1011 Sticks (dfs)
- ACM: 一题DFS(深搜,剪枝) poj 1011
- POJ--2388 Who's in the Middle (续)
- poj 1699 Best<script type=
- poj 1011 Sticks解题报告【DFS+剪枝】
- POJ 1904 King's Quest
- POJ 1163 The Triangle & POJ 3176 Cow Bowling(DP动态规划)
- Poj 1011 解题报告
- 点连通度 边连通度 最大流最小割 最小割点集 最小割边集 & POJ 1966 Cable TV Network
- poj 1141 Brackets Sequence 【DP&&备忘录】
- POJ 1659 Frogs' Neighborhood
- 离散化+线段树 POJ 2528 (Mayor's posters)
- 金额转换,阿拉伯数字的金额转换成中国传统的形式如:(¥1011)->(一千零一拾一元整)输出。
- poj 2492 A Bug's Life(并查集)
- POJ 1011 Sticks