UVA 299 - Train Swapping

用冒泡排序计算变量交换的次数。好久没写冒泡排序了...

#include<stdio.h>

int main()
{
    int n, s[55];
    int cas;
    scanf( "%d", &cas);
    while( cas --)
    {
        scanf( "%d", &n);
        int ans = 0;
        for( int i = 0; i < n; i ++)
            scanf( "%d", &s[i]);
        for( int i = 0; i < n; i ++)
            for( int j = i + 1; j < n; j ++)
            {
                if( s[i] > s[j])
                {
                    ans ++;
                    int t = s[i];
                    s[i] = s[j];
                    s[j] = t;
                }
            }
        printf( "Optimal train swapping takes %d swaps.\n", ans);
    }
    return 0;
}