字符串的序号

字符串的序号

Time Limit:1s Memory Limit:1000k
Total Submit:2989 Accepted:1245
下载样例程序(PE)
下载样例程序(ELF)

---

Problem

字符串 acab 含有两个 a ,一个 b ,一个 c ,和 acab 含的字母和每个字母的个数都相等的字符串还有：

aacb,baca等，因为他们也是含有两个 a ,一个 b ,一个 c 。所有满足这个性质的字符串按字典顺序排列后，

acab 是第 5 个，我们就说 acab 的序号是 5 .再如：ba 的序号是 2,aa 的序号是 1.

编程求出给定字符串 S（长度<=100） 的序号 P（保证<=30000）

注意：字符串只含小写字母。

Input

第一行为一整数N，表示有N组测试数据。每组测试数据为一字符串S。

Output

输出P

Sample Input

2
kensta
jyms

Sample Output

274
5

C的求解和结果

#include <stdio.h>
#include <string.h>

void Sort(char* source, int length)
{
    int i, j, temp;
    for(i = 0; i < length; i++)
        for(j = 0; j < length; j++){
            if(i == j) continue;
            if(source[i] < source[j]){
                temp = source[i];
                source[i] = source[j];
                source[j] = temp;
            }
        }
}

int main()
{
    int N, M, temp, i, j, min, first;
    int Length, StartPos, Count;
    char Line[101], Buffer[101];

    scanf("%d", &N);
    gets(Line);
    for(j = 0; j < N; j++){
        gets(Line);
        strcpy(Buffer, Line);
        Length = strlen(Buffer);
        Sort(Buffer, Length);

        if(strcmp(Line, Buffer) == 0){
            printf("1/n");
            continue;
        }

        StartPos = Length - 2;
        Count = 1;
        while(1){
            min = StartPos;
            first = 1;
            for(i = Length - 1; i > StartPos; i--){
                if(first){
                    if(Buffer[min] < Buffer[i]){
                        min = i;
                        first = 0;
                    }
                }else{
                    if(Buffer[min] > Buffer[i]){
                        min = i;
                    }
                }
            }
            if(min == StartPos){
                StartPos--;
                if(StartPos < 0) break;
            }else{
                temp = Buffer[StartPos];
                Buffer[StartPos] = Buffer[min];
                Buffer[min] = temp;

                //Sort(Buffer+StartPos+1, Length-StartPos-1);
                for(i = 0; i < (Length-StartPos-1) / 2; i++){
                    temp = Buffer[StartPos+1+i];
                    Buffer[StartPos+1+i] = Buffer[Length-1-i];
                    Buffer[Length-1-i] = temp;
                }

                StartPos = Length - 2;
                Count++;
                if(strcmp(Buffer, Line) == 0) printf("%d/n", Count);
            }
        }
    }
    return 0;
}

Result: Time Limit Exceeded....