Sort it Hdu 2689の2つの数を置き換えるには、必ずしも中間変数を使用する必要はありません.

Sort it
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2847    Accepted Submission(s): 2056
Problem Description
You want to processe a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. Then how many times it need.
For example, 1 2 3 5 4, we only need one operation : swap 5 and 4.
 
Input
The input consists of a number of test cases. Each case consists of two lines: the first line contains a positive integer n (n <= 1000); the next line contains a permutation of the n integers from 1 to n.
 
Output
For each case, output the minimum times need to sort it in ascending order on a single line.
 
Sample Input

   
   
   
   

    
    
    
    3
1 2 3
4 
4 3 2 1 
   
   
   
   

 
Sample Output

   
   
   
   

    
    
    
    0
6
   
   
   
   

 
Author
WhereIsHeroFrom
偽造ソート
中間で2つの数字を交換したとき、私は中間変数を使っていませんでした.
整形実型と文字型では中間変数を必要とせずに順序を変えることができます

#include<stdio.h>
#include<string.h>

int T,i,j,k;
int num[10005];


int main()
{
     while(scanf("%d",&T) != EOF)
    {
        k = 0;
        for(i =0 ;i < T;i++)
        {
            scanf("%d",&num[i]);
        }
        for(j = 0; j< T ;j++)
        {
            for(i =0 ;i < T -j -1;i++)
            {
                if(num[i] > num[i+1])
                {
                    num[i] = num[i] + num[i+1];//           
                    num[i+1] = num[i] - num[i+1];
                    num[i] = num[i]  - num[i+1];
                    k++;
                }
            }
        }
        printf("%d
",k);

    }
    return 0;
}