#include<stdio.h>
int n,N,i,j,p,q,t,s,a[51];
int main()
{
for(i=1;i<=N;i++)
{
s=0;
for(j=1;j<=n;j++)
{
for(j=1;j<=n-1;j++) /// bubble sort....
{
for(p=1;p<=n-1;p++)
{
if(a[p]>a[p+1])
{
t=a[p+1]; a[p+1]=a[p]; a[p]=t; s++;
}
}
}
printf("Optimal train swapping takes %d swaps.\n",s
);
}
return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KaW50IG4sTixpLGoscCxxLHQscyxhWzUxXTsKaW50IG1haW4oKQp7CiAgICBzY2FuZigiJWQiLCZOKTsgZ2V0Y2hhcigpOwogICAgZm9yKGk9MTtpPD1OO2krKykKICAgIHsKICAgICAgICBzPTA7CiAgICAgICAgc2NhbmYoIiVkIiwmbik7IGdldGNoYXIoKTsKICAgICAgICBmb3Ioaj0xO2o8PW47aisrKQogICAgICAgIHsKICAgICAgICAgICAgc2NhbmYoIiVkIiwmYVtqXSk7CiAgICAgICAgfSBnZXRjaGFyKCk7IGFbbisxXT0nXDAnOwogICAgICAgIGZvcihqPTE7ajw9bi0xO2orKykgICAvLy8gYnViYmxlIHNvcnQuLi4uCiAgICAgICAgewogICAgICAgICAgICBmb3IocD0xO3A8PW4tMTtwKyspCiAgICAgICAgICAgIHsKICAgICAgICAgICAgICAgIGlmKGFbcF0+YVtwKzFdKQogICAgICAgICAgICAgICAgewoKICAgICAgICAgICAgICAgICAgICAgICAgdD1hW3ArMV07IGFbcCsxXT1hW3BdOyBhW3BdPXQ7IHMrKzsKICAgICAgICAgICAgICAgIH0KICAgICAgICAgICAgfQoKICAgICAgICB9CiAgICAgICAgcHJpbnRmKCJPcHRpbWFsIHRyYWluIHN3YXBwaW5nIHRha2VzICVkIHN3YXBzLlxuIixzKTsKCiAgICB9CgogICAgcmV0dXJuIDA7Cn0K