poj--3187--Backward Digit Sums(dfs)
2016-03-05 13:36
197 查看
Backward Digit Sums
Description
FJ and his cows enjoy playing a mental game. They write down the numbers from 1 to N (1 <= N <= 10) in a certain order and then sum adjacent numbers to produce a new list with one fewer number. They repeat this until only a single number is left. For example,
one instance of the game (when N=4) might go like this:
Behind FJ's back, the cows have started playing a more difficult game, in which they try to determine the starting sequence from only the final total and the number N. Unfortunately, the game is a bit above FJ's mental arithmetic capabilities.
Write a program to help FJ play the game and keep up with the cows.
Input
Line 1: Two space-separated integers: N and the final sum.
Output
Line 1: An ordering of the integers 1..N that leads to the given sum. If there are multiple solutions, choose the one that is lexicographically least, i.e., that puts smaller numbers first.
Sample Input
Sample Output
Hint
Explanation of the sample:
There are other possible sequences, such as 3 2 1 4, but 3 1 2 4 is the lexicographically smallest.
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 5667 | Accepted: 3281 |
FJ and his cows enjoy playing a mental game. They write down the numbers from 1 to N (1 <= N <= 10) in a certain order and then sum adjacent numbers to produce a new list with one fewer number. They repeat this until only a single number is left. For example,
one instance of the game (when N=4) might go like this:
3 1 2 4 4 3 6 7 9 16
Behind FJ's back, the cows have started playing a more difficult game, in which they try to determine the starting sequence from only the final total and the number N. Unfortunately, the game is a bit above FJ's mental arithmetic capabilities.
Write a program to help FJ play the game and keep up with the cows.
Input
Line 1: Two space-separated integers: N and the final sum.
Output
Line 1: An ordering of the integers 1..N that leads to the given sum. If there are multiple solutions, choose the one that is lexicographically least, i.e., that puts smaller numbers first.
Sample Input
4 16
Sample Output
3 1 2 4
Hint
Explanation of the sample:
There are other possible sequences, such as 3 2 1 4, but 3 1 2 4 is the lexicographically smallest.
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; int vis[20],s[30][30],n,ans; bool f; void dfs(int x) { if(x==n+1) { for(int i=2;i<=n;i++) { for(int j=1;j<=n-i+1;j++) { s[i][j]=s[i-1][j]+s[i-1][j+1]; } } if(s [1]==ans&&!f) { f=true; for(int i=1;i<n;i++) printf("%d ",s[1][i]); printf("%d\n",s[1] ); } } if(f) return ; for(int i=1;i<=n;i++) { if(!vis[i]) { vis[i]=1; s[1][x]=i; dfs(x+1); vis[i]=0; } } } int main() { while(scanf("%d%d",&n,&ans)!=EOF) { f=false; memset(s,0,sizeof(s)); memset(vis,0,sizeof(vis)); dfs(1); } return 0; }
相关文章推荐
- java学习笔记-java泛型
- [疯狂Java笔记]事件处理:Java事件处理模型
- 在head里的CSS link 竟然粗如今body里了?
- 反编译
- C#方法的重载(overload)、重写(override)、隐藏(new)
- hdoj--1027--Ignatius and the Princess II(dfs)
- OpenCV设计模式分析
- Animation动画
- hdoj--1027--Ignatius and the Princess II(dfs)
- 推荐廖雪峰的网站教程
- dialog添加动画效果并且显示圆角
- 交叉移植tesseract过程记述以及总结(在mini2440开发板上运行成功)
- uva10716 - - Evil Straw Warts Live
- Android获取代码Color资源
- 素数算法总结
- linux 数组的简单总结
- hdoj Ignatius and the Princess II (全排列)
- HBase—扫描器
- 地址的层次性
- CocoaPods安装及使用