题目:http://www.lightoj.com/volume_showproblem.php?problem=1023
题意:给出数字n k,输出前n个大写字母的前k个排列
思路:为了省事用next_permumation函数写的,改天自己写个全排列
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int N = 110;
int cas;
int work(int m)
{
int sum = 1;
for(int i = 1; i <= m; i++) sum *= i;
return sum;
}
int main()
{
int t, a, b;
char s[N];
scanf("%d", &t);
while(t--)
{
scanf("%d%d", &a, &b);
memset(s, 0, sizeof s);
for(int i = 0; i < a; i++) s[i] = 'A' + i;
printf("Case %d:\n", ++cas);
printf("%s\n", s);
if(a < 5) b = min(b, work(a)); //如果k大于排列总数时,输出总数即可
for(int i = 1; i < b; i++) next_permutation(s, s + a), printf("%s\n", s);
}
return 0;
}