문제1032--Ultra Quick Sort

1032: Ultra Quick Sort

실행시간 제한: 4 Sec  메모리사용 제한: 128 MB
제출: 256  통과: 55
[제출] [채점기록] [묻고답하기]

문제 설명

In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. For the input sequence

9 1 0 5 4 ,

Ultra-QuickSort produces the output

0 1 4 5 9 .

Your task is to determine how many swap operations Ultra-QuickSort needs to perform in order to sort a given input sequence.

입력 설명

The input contains several test cases. Every test case begins with a line that contains a single integer n < 500,000 -- the length of the input sequence. Each of the the following n lines contains a single integer 0 ≤ a[i] ≤ 999,999,999, the i-th input sequence element. Input is terminated by a sequence of length n = 0. This sequence must not be processed.

출력 설명

For every input sequence, your program prints a single line containing an integer number op, the minimum number of swap operations necessary to sort the given input sequence.

입력 예시 Copy

5
9
1
0
5
4
3
1
2
3
0


출력 예시 Copy

6
0