hdoj1027 Ignatius and the Princess II(全排列)
2017-05-25 20:47
369 查看
要是真的是我去救公主,感觉公主应该早被吃了。。。。
关键就是有个全排列的函数next_permutation()
知道这个函数,问题就特别简单了。#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int a[1005];
int main()
{
int i,n,m;
while(cin>>n>>m)
{
for(i=1;i<=n;i++)
a[i]=i;
for(i=1;i<m;i++)
next_permutation(a+1,a+1+n);
for(i=1;i<n;i++)
{
cout<<a[i]<<" ";
}
cout<<a[i]<<endl;
}
return 0;
}
关键就是有个全排列的函数next_permutation()
知道这个函数,问题就特别简单了。#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int a[1005];
int main()
{
int i,n,m;
while(cin>>n>>m)
{
for(i=1;i<=n;i++)
a[i]=i;
for(i=1;i<m;i++)
next_permutation(a+1,a+1+n);
for(i=1;i<n;i++)
{
cout<<a[i]<<" ";
}
cout<<a[i]<<endl;
}
return 0;
}
相关文章推荐
- hdoj 1027 Ignatius and the Princess II (全排列)
- HDOJ 1027-Ignatius and the Princess II【全排列】
- hdoj 1027 Ignatius and the Princess II(全排列变形)
- hdoj--1027--Ignatius and the Princess II(dfs)
- hdoj Ignatius and the Princess II (全排列)
- HDOJ--1027--Ignatius and the Princess II(利用next_permutation函数去做的)
- HDOJ1027 Ignatius and the Princess II
- HDOJ 1027 Ignatius and the Princess II
- hdoj 1027 Ignatius and the Princess II
- 【HDOJ】1027 Ignatius and the Princess II
- hdoj 1027 Ignatius and the Princess II 【全排列】【STL】
- HDOJ 1027 Ignatius and the Princess II - next_permutation函数
- hdoj--1027--Ignatius and the Princess II(dfs)
- HDOJ 1027 Ignatius and the Princess II
- HDOJ 题目1027 Ignatius and the Princess II(STL)
- hdoj 1027 Ignatius and the Princess II 【逆康托展开】
- HDU 1027 Ignatius and the Princess II(全排列)
- HDOJ 1027 Ignatius and the Princess II
- 【HDU 1027 Ignatius and the Princess II】+ 全排列 + STL
- HDOJ1027 Ignatius and the Princess II&&STL神器