PKU3187-Backward Digit Sums
题目大意
§
1
到
N(N<=10)
的全排列中
,
按下面方式累加和为
sum
的字典序最小的排列
§
3
1 2 4
4 3 6
7 9
16
4 3 6
7 9
16
思路
¡
字典序
¡
N
很小
¡
全排列
N
!,
10
!
= 3,628,800
按字典序输出所有全排列,计算排列的三角形累加和,判断是否为
M
代码
#include <functional>
#include <algorithm>
#include <stdexcept>
#include <iostream>
#include <sstream>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <cctype>
#include <vector>
#include <string>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <ctime>
#include <list>
#include <map>
#include <set>
#include <cstdio>
#include <deque>
using namespace std;
#define PB push_back
#define MP make_pair
#define FU(i,x,y) for(i=x;i<y;i++)
#define FD(i,x,y) for(i=x;i>=y;i--)
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<double> VD;
typedef pair<int,int> PII;
typedef long long LL;
typedef unsigned long long ULL;
int sum;
int visit[10];
int permutation(int *a,int k,int n){
int i,j,tag;
if(k==n){
int b[10];
for(i=0;i<n;i++) b[i] = a[i];
for(i=0;i<n-1;i++) for(j=0;j<n-i-1;j++) b[j] = b[j]+b[j+1];
if(b[0]==sum){
for(i=0;i<n-1;i++) cout << a[i] << ' ';
cout << a[i] << endl;
return 1;
}
return 0;
}
else{
for(i=1;i<=n;i++){
if(!visit[i-1]){
a[k] = i;
visit[i-1] = 1;
if(permutation(a,k+1,n)) return 1;
visit[i-1] = 0;
}
}
return 0;
}
}
int main(){
int a[10],n;
cin >> n >> sum;
permutation(a,0,n);
return 0;
}
用next_permutation的代码
#include <functional>
#include <algorithm>
#include <stdexcept>
#include <iostream>
#include <sstream>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <cctype>
#include <vector>
#include <string>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <ctime>
#include <list>
#include <map>
#include <set>
#include <cstdio>
#include <deque>
using namespace std;
#define PB push_back
#define MP make_pair
#define FU(i,n) for(i=0;i<n;i++)
#define FD(i,n) for(i=n-1;i>=0;i--)
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<double> VD;
typedef pair<int,int> PII;
typedef long long LL;
typedef unsigned long long ULL;
int main(){
int n,sum,a[10],b[10],i,j;
cin >> n >> sum;
FU(i,n) a[i] = i+1;
do{
FU(i,n) b[i] = a[i];
FU(i,n-1) FU(j,n-i-1) b[j] = b[j]+b[j+1];
if(b[0] == sum){
FU(i,n-1) cout << a[i] << ' ';
cout << a[i] << endl;
break;
}
}while(next_permutation(a,a+n));
return 0;
}