全排列(next_permutation)
代码如下:
#include <bits/stdc++.h>
using namespace std;
#define PI 2*acos(0.0)
int main ()
{
int t, cnt = 1;
scanf("%d", &t);
while(t--)
{
int k, n, sum = 0;
scanf("%d %d", &k, &n);
printf("Case %d:\n", cnt++);
char s[30];
for(int i = 0;i < k;i++)
s[i] = i+'A';
s[k] = 0;
do{
puts(s);
sum++;
if(sum == n) break;
}while(next_permutation(s, s+k));
}
return 0;
}