299 - Train Swapping

#include <stdio.h>int main(){int N,L,carriages[50],count,temp;scanf("%d",&N);for(int i=0;i<N;i++){count=0;scanf("%d",&L);for(int j=0;j<L;j++)scanf("%d",&carriages[j]);for(int k=0;k<L;k++)for(int l=k+1;l<L;l++)if(carriages[k]>carriages[l]){temp=carriages[k];carriages[k]=carriages[l];carriages[l]=temp;count++;}printf("Optimal train swapping takes %d swaps.\n",count);}}

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=235