Uva110 Meta-Loopless Sorts

Sorting holds an important place in computer science. Analyzing and implementing various sorting algorithms forms an important part of the education of most computer scientists, and sorting accounts for a significant percentage of the world's computational resources. Sorting algorithms range from the bewilderingly popular Bubble sort, to Quicksort, to parallel sorting algorithms and sorting networks. In this problem you will be writing a program that creates a sorting program (a meta-sorter).

The Problem

The problem is to create several programs whose output is a standard Pascal program that sorts n numbers where n is the only input to the program you will write. The Pascal programs generated by your program must have the following properties:

They must begin with program sort(input,output);
They must declare storage for exactly n integer variables. The names of the variables must come from the first n letters of the alphabet (a,b,c,d,e,f).
A single readln statement must read in values for all the integer variables.
Other than writeln statements, the only statements in the program are if then else statements. The boolean conditional for each if statement must consist of one strict inequality (either < or >) of two integer variables. Exactly n! writeln statements must appear in the program.
Exactly three semi-colons must appear in the programs
1. after the program header: program sort(input,output);
2. after the variable declaration: ...: integer;
3. after the readln statement: readln(...);
No redundant comparisons of integer variables should be made. For example, during program execution, once it is determined that a < b, variables a and b should not be compared again.
Every writeln statement must appear on a line by itself.
The programs must compile. Executing the program with input consisting of any arrangement of any n distinct integer values should result in the input values being printed in sorted order.

For those unfamiliar with Pascal syntax, the example at the end of this problem completely defines the small subset of Pascal needed.

1

3

Sample Output

program sort(input,output);
var
a,b,c : integer;
begin
  readln(a,b,c);
  if a < b then
    if b < c then
      writeln(a,b,c)
    else if a < c then
      writeln(a,c,b)
    else
      writeln(c,a,b)
  else
    if a < c then
      writeln(b,a,c)
    else if b < c then
      writeln(b,c,a)
    else
      writeln(c,b,a)
end.

思路：模拟插入排序，一个一个元素插入，插入元素时从后往前比较。

#include<cstdio>
#include<string>
using namespace std;
int n;
string str;
static const char *indent[] = { "", 
    "  ", "    ", "      ", "        ", "        ", "          ", 
    "            ", "              ", "                " }; 
char alphas[]="abcdefgh";

void dfs(int cur)
{
    if(cur==n)
    {
        printf("%s", indent[cur]);
        printf("writeln(%c", str[0]);
        for (int i = 1; i < n; i++)  
            printf(",%c", str[i]);  
        printf(")
");
        return;
    }
    //从尾部向前插
    for(int i=str.size()-1; i>=0; i--)
    {
        printf("%s", indent[cur]);
        if(i!=(int)str.size()-1)
            printf("else ");
        printf("if %c < %c then
", str[i], alphas[cur]);
        str.insert(i+1, 1, alphas[cur]);
        dfs(cur+1);
        str.erase(i+1, 1);
    }
    //插入到最前面
    printf("%s", indent[cur]);
    printf("else
");
    str.insert(0, 1, alphas[cur]);
    dfs(cur+1);
    str.erase(0, 1);
}

int main()
{
    int T;
    scanf("%d", &T);
    while(T--) {
        scanf("%d", &n);
        printf("program sort(input,output);
var
a");
        for(int i=1;i<n;i++)
            printf(",%c", 'a'+i);
        printf(" : integer;
");
        printf("begin
");
        printf("  readln(a");
        for (int i = 1; i < n; i++)  
            printf(",%c", 'a' + i);  
        puts(");");  
        str="a";
        dfs(1);
        puts("end.");  

        if(T)
            printf("
");
    }
    return 0;
}