第四届吉林省大学生程序设计大赛个人解题报告 Problem H: New Feature in Windows 7

               Problem H: New Feature in Windows 7

Windows 7 is one version of Microsoft Windows Family; a series of operating systems produced by Microsoft running on personal computers, including home and business desktops, laptops, notebooks, tablet PCs, and media center PCs. Windows 7 was released to manufacturing on July 22, 2009, and reached general retail availability on October 22, 2009. Windows 7 studies and includes some features from some other successful operating systems, such as Mac OS and Linux. It is said that Windows 7 is more user-friendly than its predecessors especially than Vista, using which you may be forced to click “OK” four times just for copying files. For example, you can find something more interesting when sorting files. Of course, files will be sorted by their names in alphabetical order in some version of previous Windows. However, it may bring unexpected results. Suppose that there are some files named as “Lesson1”, “Lesson2”, …, “Lesson9”, ”Lesson10” and “Lesson11”, in which the numbers describe the sequence of lessons. Then, in previous version the numbers in filenames are ranked by alphabetical place and the sorted results are “Lesson1”, ”Lesson10”, “Lesson11”, “Lesson2”, …“Lesson9”. Obviously, it is not what you want, because the numbers should be ranked by their values. Now, Windows 7 realizes this. Now your task is to sort these filenames from small to large like Windows7. Exactly speaking, if two filenames are same before certain position including start, the order should be decided by these conditions:

a) If both of them are alphabets, the result depends on the alphabet order.
b) If one is alphabet and the other is number, the number is smaller.
c) If both of them are numbers, the result depends on number values.

To simplify the problem, firstly, only filenames excluding extensions are given. Secondly, only alphabets ‘A’-‘Z’, ‘a’-‘z’, digits ‘0’-‘9’ are used in filenames. Finally, there is no such number whose first digit is ‘0’.  

Input
The first line of each case is an integer n (2<=n<=100), which is the number of
the following filenames. The end of input is indicated by n=0.
There is only one filename in each following lines. The length of filename is no
more than 100 characters.

Output
For each case, sort these filenames according to the above rules. Print the results on every line. Output a blank line after each case.

Sample Input
3
Lesson11
Lesson2
Lesson1
5
A101b
A1
B1
A2a
A99b
0

Sample Output
Lesson1
Lesson2
Lesson11
 
A1
A2a
A99b
A101b
B1 

 

    这是本次比赛最让人纠结的模拟题，主要让人纠结的是当时这道题的数据是错的...所以很多人都栽到了这道题之上。我也是其中之一。

    知道模拟题主要模拟的是Win7的文件排序，可以在 a1 a2 a10 a11 a3 这样的字符串序列排成 a1 a2 a3 a10 a11。如果用原始的字符串比较的话，会出现 a1 a10 a11 a2 a3这样的结果。其他的细节都在题目中，那些细节很显然，就是这个数字数字的比较，有可能数字很大，所以比较需要逐位比较。

下面贴出我为验证正确性的代码(比赛时候敲的那份被孔哥删了...)

#include<iostream> #include<algorithm> #include<cctype> #include<string> using namespace std; const int MAXN = 105; bool cmp(string a,string b) { int lena = a.length(), lenb = b.length() ; for(int i = 0 , j = 0 ; i != lena && j != lenb ; i++ , j++) { if( isalpha(a[i]) && isalpha(b[j]) && a[i] != b[j] ) return a[i] < b[j] ; else if(isdigit(a[i]) && isdigit(b[j])) { string suma , sumb; for( ; i < lena && isdigit(a[i]); i++) suma += a[i]; for( ; j < lenb && isdigit(b[j]);j++) sumb += b[j]; if(suma.length() != sumb.length()) return suma.length() < sumb.length(); else for(int k = 0 ; k < suma.length() ; k++) if(suma[k] != sumb[k]) return suma[k] < sumb[k]; if(suma == sumb) i--,j--; } else if(isdigit(a[i]) && isalpha(b[j])) return 1; else if(isdigit(b[j]) && isalpha(a[i])) return 0; } return lena < lenb; } int main() { string filename[MAXN];int n; while(scanf("%d",&n),n) { for(int i = 0 ; i < n ; i ++) cin >> filename[i] ; sort(filename,filename+n,cmp); for(int i = 0 ; i < n ; i ++) cout<< filename[i] <<endl; cout << endl; } return 0; }