<cite id="nzhfv"><strike id="nzhfv"><thead id="nzhfv"></thead></strike></cite>
<ins id="nzhfv"><span id="nzhfv"><var id="nzhfv"></var></span></ins><cite id="nzhfv"></cite>
<cite id="nzhfv"><span id="nzhfv"></span></cite>
<ins id="nzhfv"></ins>
<cite id="nzhfv"><video id="nzhfv"></video></cite><cite id="nzhfv"><video id="nzhfv"><var id="nzhfv"></var></video></cite><ins id="nzhfv"><span id="nzhfv"><cite id="nzhfv"></cite></span></ins><ins id="nzhfv"><video id="nzhfv"><var id="nzhfv"></var></video></ins>
<var id="nzhfv"><video id="nzhfv"></video></var>
Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register
Language:
DNA Sorting
Time Limit: 1000MSMemory Limit: 10000K
Total Submissions: 119182Accepted: 47538

Description

One measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For instance, in the letter sequence ``DAABEC'', this measure is 5, since D is greater than four letters to its right and E is greater than one letter to its right. This measure is called the number of inversions in the sequence. The sequence ``AACEDGG'' has only one inversion (E and D)---it is nearly sorted---while the sequence ``ZWQM'' has 6 inversions (it is as unsorted as can be---exactly the reverse of sorted).

You are responsible for cataloguing a sequence of DNA strings (sequences containing only the four letters A, C, G, and T). However, you want to catalog them, not in alphabetical order, but rather in order of ``sortedness'', from ``most sorted'' to ``least sorted''. All the strings are of the same length.

Input

The first line contains two integers: a positive integer n (0 < n <= 50) giving the length of the strings; and a positive integer m (0 < m <= 100) giving the number of strings. These are followed by m lines, each containing a string of length n.

Output

Output the list of input strings, arranged from ``most sorted'' to ``least sorted''. Since two strings can be equally sorted, then output them according to the orginal order.

Sample Input

10 6
AACATGAAGG
TTTTGGCCAA
TTTGGCCAAA
GATCAGATTT
CCCGGGGGGA
ATCGATGCAT

Sample Output

CCCGGGGGGA
AACATGAAGG
GATCAGATTT
ATCGATGCAT
TTTTGGCCAA
TTTGGCCAAA

Source

[Submit]   [Go Back]   [Status]   [Discuss]

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator

国语自产拍在线视频中文,国语自产拍在线观看学生,国语自产精品视频在线视频
<cite id="nzhfv"><strike id="nzhfv"><thead id="nzhfv"></thead></strike></cite>
<ins id="nzhfv"><span id="nzhfv"><var id="nzhfv"></var></span></ins><cite id="nzhfv"></cite>
<cite id="nzhfv"><span id="nzhfv"></span></cite>
<ins id="nzhfv"></ins>
<cite id="nzhfv"><video id="nzhfv"></video></cite><cite id="nzhfv"><video id="nzhfv"><var id="nzhfv"></var></video></cite><ins id="nzhfv"><span id="nzhfv"><cite id="nzhfv"></cite></span></ins><ins id="nzhfv"><video id="nzhfv"><var id="nzhfv"></var></video></ins>
<var id="nzhfv"><video id="nzhfv"></video></var>