Problem:
Bubble Sort

Write a program of the Bubble Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:

BubbleSort(A)
1 for i = 0 to A.length-1
2 for j = A.length-1 downto i+1
3 if A[j] < A[j-1]
4 swap A[j] and A[j-1]

Note that, indices for array elements are based on 0-origin.

Your program should also print the number of swap operations defined in line 4 of the pseudocode.

Input

The first line of the input includes an integer N, the number of elements in the sequence.

In the second line, N elements of the sequence are given separated by spaces characters.

Output

The output consists of 2 lines.

In the first line, please print the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.

In the second line, please print the number of swap operations.

Constraints

1 ≤ N ≤ 100

Sample Input 1

5
5 3 2 4 1

Sample Output 1

1 2 3 4 5
8

Sample Input 2

6
5 2 4 6 1 3

Sample Output 2

1 2 3 4 5 6
9

Solution in C# (judge verdict: Accepted)

using System;

#region Program
namespace Program
{
    #region Solver
    public class Solver
    {

        // ?????? ????´???° ??????
        public static int upper = 100;

        // ????´???°
        int N;

        // ??°???
        int[] A = new int[upper];

        #region Solver
        public Solver()
        {
            N = int.Parse(Console.ReadLine());

            /* ?????????????????¨?????????????????? */
            string[] strAryA = Console.ReadLine().Split(' ');

            /* ????????????????????´??°?????????????????? */
            A = Array.ConvertAll<string, int>(
                    strAryA
                    , delegate (string value)
                    {
                        return int.Parse(value);
                    }
                );
        }
        #endregion

        #region Solve
        public void Solve()
        {
            /* ?????????????????? ???????????? */
            int ans = bubbleSort(A, N);
            /* ?????? ?????? */
            trace(A, N);
            /* ?????? ???????????° */
            Console.WriteLine(ans);
        }
        #endregion

        #region bubbleSort
        /* flag ?????¨???????????????????????? */
        public int bubbleSort(int[] A, int N)
        {
            int sw = 0;
            bool flag = true;
            for (int i = 0; flag; i++)
            {
                flag = false;
                for (int j = N - 1; j >= i + 1; j--)
                {
                    if (A[j] < A[j - 1])
                    {
                        /* ??£??\????´???????????????? */
                        swap(ref A[j], ref A[j - 1]);
                        flag = true;
                        sw++;
                    }
                }
            }
            return sw;
        }
        #endregion

        #region swap
        static void swap<T>(ref T a, ref T b)
        {
            var t = a;
            a = b;
            b = t;
        }
        #endregion

        #region trace
        /* ?????????????´??????????????????? */
        public void trace(int[] A, int N)
        {
            int i;
            for (i = 0; i < N; i++)
            {
                if (i > 0)
                {
                    /* ??£??\??????????´??????????1????????????????????? */
                    Console.Write(" ");
                }
                Console.Write(A[i]);
            }
            /* ????°??????????????????? */
            Console.Write(Environment.NewLine);
        }
        #endregion
    }
    #endregion
}
#endregion

#region Execute
class Execute
{
    public static void Main(string[] args)
    {
        new Program.Solver().Solve();
    }
}
#endregion