poj 3187 Backward Digit Sums 【全排列变形题】
来源:互联网 发布:软件 设计说明书 编辑:程序博客网 时间:2024/06/04 00:30
Backward Digit Sums
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5356 Accepted: 3093
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:
Write a program to help FJ play the game and keep up with the cows.
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.
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
思路:
输入n和sum,然后将1到n这n个数进行全排列,然后找出所有的排序中进行题上的计算之后等于sum的最小的字典序的那个序列!
代码:
方法1:(自己的方法)
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int n,sum;int a[15];int b[15];int c[15];int vis[15];int flag;void dfs(int pos,int n){if(flag==1)//剪枝!没有会超时 return;if(pos==n&&flag==0){for(int i=0;i<n;i++){c[i]=b[i];}for(int j=n-1;j>=1;j--){for(int i=0;i<j;i++){c[i]+=c[i+1];}}if(c[0]==sum){for(int i=0;i<n-1;i++){printf("%d ",b[i]);}printf("%d\n",b[n-1]);flag=1;}}for(int i=0;i<n;i++){if(!vis[i]){vis[i]=1;b[pos]=a[i];dfs(pos+1,n);vis[i]=0;}}}int main(){scanf("%d%d",&n,&sum);for(int i=0;i<n;i++){a[i]=i+1;}memset(vis,0,sizeof(vis));flag=0;dfs(0,n);return 0;}
方法2:(利用全排列函数进行全排列)
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int N,sum;int b[15];int c[15];int vis[15];int flag;void dfs(int pos,int n){do{for(int i=0;i<n;i++){c[i]=b[i];}for(int j=n-1;j>=1;j--){for(int i=0;i<j;i++){c[i]=c[i]+c[i+1];}}if(c[0]==sum){for(int i=0;i<n-1;i++){printf("%d ",b[i]);}printf("%d\n",b[n-1]);flag=1;}}while(next_permutation(b, b+n)&&flag==0);}int main(){scanf("%d%d",&N,&sum);for(int i=0;i<N;i++){b[i]=i+1;}memset(vis,0,sizeof(vis));flag=0;dfs(1,N);return 0;}
0 0
- poj 3187 Backward Digit Sums 【全排列变形题】
- poj 3187 Backward Digit Sums(全排列变形)
- poj 3187 Backward Digit Sums (全排列)
- poj 3178 Backward Digit Sums (全排列)
- POJ 3187 Backward Digit Sums (DFS 全排列)
- POJ 3187 Backward Digit Sums (dfs全排列)
- poj 3187 Backward Digit Sums (全排列)
- poj Backward Digit Sums 3187 (全排列)
- POJ 3187-Backward Digit Sums【全排列+找规律】
- POJ 3187 Backward Digit Sums【杨辉三角】【全排列】
- POJ-3187(Backward Digit Sums)(全排列+dfs())
- POJ 3187 Backward Digit Sums (全排列)
- POJ 3187- Backward Digit Sums(DFS+全排列)
- poj 3187 Backward Digit Sums STL排列
- Backward Digit Sums --- DFS+全排列
- Backward Digit Sums (全排列 + 暴力)
- POJ3187 Backward Digit Sums【全排列+暴力】
- Backward Digit Sums(全排列next_permutation)
- codevs 1033蚯蚓的游戏 (最大费用流
- 图形的绘制(包括线段 圆形 矩形等) swift编写
- codevs1356 bzoj2746 jsoi2012
- bzoj3689 luogu p1337
- java设计模式-迭代器模式(Iterator)
- poj 3187 Backward Digit Sums 【全排列变形题】
- JS中的闭包
- mongodb sharding原理分析
- 计算器
- HTML5 中的事件监听
- gdb调试linux可执行程序
- 【leetcode】【75】Sort Colors
- java中不同的ORM框架实现对数据库批量插入数据库的方式与技巧
- 定位new(placement new)