poj 3178 Backward Digit Sums (全排列)
2016-04-14 13:27
120 查看
<div class="ptt" lang="en-US" style="text-align: center; font-size: 18pt; font-weight: bold; color: blue;">Backward Digit Sums</div><div class="plm" style="text-align: center;font-size:14px;"><table align="center"><tbody><tr><td><strong>Time Limit:</strong> 1000MS</td><td width="10px"> </td><td><strong>Memory Limit:</strong> 65536K</td></tr><tr><td><strong>Total Submissions:</strong> 5858</td><td width="10px"> </td><td><strong>Accepted:</strong> 3398</td></tr></tbody></table></div><p class="pst" style="font-size: 18pt; font-weight: bold; color: blue;">Description</p><div class="ptx" lang="en-US" style="font-family: 'Times New Roman', Times, serif;font-size:14px;">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: <pre> 3 1 2 4 4 3 6 7 9 16Behind 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.
Source
USACO 2006 February Gold & Silver
再次用到了全排列,next_permutation()的用法!STL!
代码:
<pre name="code" class="html">#include <iostream> #include <cstdio> #include <algorithm> using namespace std; int main() { int n,s; int a[20],b[20]; while(~scanf("%d%d",&n,&s)) { for(int i=0;i<n;i++) a[i]=b[i]=i+1; do { for(int i=0;i<n;i++) a[i]=b[i]; for(int j=n;j>0;j--) { for(int k=0;k<j-1;k++) { a[k]=a[k]+a[k+1]; } } if(a[0]==s) { for(int i=0;i<n-1;i++) printf("%d ",b[i]); printf("%d\n",b[n-1]); break; } }while(next_permutation(b,b+n)); } return 0; }
相关文章推荐
- Android IPC机制(四):细说Binder连接池
- 厨子与大厨:伊隆·马斯克的独家配方(下)
- android 启动Activity的四种模式
- Aizu 0005 GCD and LCM【辗转相除法】
- json api 接口们地址
- 正则表达式-检测昵称是否是有汉字字母数字下划线组成,6-8位
- Redis资料整理
- Android唤醒屏幕
- 70. Climbing Stairs
- C++vector方法详解
- MySQL修改数据库编码为UTF8
- 厨子与大厨:伊隆·马斯克的独家配方(上)
- spring常用的工具类
- winbuilder安装及使用
- poj1061青蛙的约会
- The Cook and the Chef: Musk’s Secret Sauce
- 二叉搜索树的后序遍历序列
- CDOJ 1135 邱老师看电影 概率dp
- Ubuntu14安装JDK8
- 小欣外贸助手-国际站排名查询工具限量封测了