ZOJ 1730 Crazy Tea Party

ZOJ 1730 Crazy Tea Party (5418)

Test instructions: People sit around the round table and ask how many times they need to exchange a group of people at least to get everyone in the opposite order.

Idea: One pair means and can only be exchanged for two people next to each other. Bubble sort. But 1 2 3 4 5 does not need to become 5 4 3 2 1, 5 to 1 after the back, into 2 1 5 4 3, is the minimum number of times. The number of people is odd and even two cases, the number of exchanges formula X = N (n-1)/2;.

Code:

#include <stdio.h>
int main () {
	int n,i,x,a,t;
	scanf ("%d", &n);
	for (i = 1;i<=n;i++) {
		scanf ("%d", &x);
		if (x%2==0) {
			t = X/2;
			A = t* (t-1);
			printf ("%d\n", a);
			Continue;
		}
		if (x%2==1) {
			t = (x+1)/2;
			A = t* (t-1)/2+ (t-1) * (t-2)/2;
			printf ("%d\n", a);
			Continue;
		}
	}
	return 0;
}