Money Prize - NDDCoder

#include<iostream>

using namespace std;
int a[7];
int n;
int e;
int maxM;

void swap(int arr[], int x, int y){
	int tmp = arr[x];
	arr[x]=arr[y];
	arr[y]=tmp;
}

int calculate(){
	int sum=0;
	for (int i=0;i<n;i++){
		sum=sum*10+a[i];
	}
	return sum;
}

int printArray(){
	for (int i=0;i<n;i++) cout<<a[i]<<" ";
	cout<<endl;
}
 
void Try(int step, int x){
	if (x==n-1){
		int left = (e-step)%2;
		if (left == 1){
			swap(a, n-2, n-1);
		}
		int money = calculate();
		if (money>maxM) maxM=money;
		if (left == 1){
			swap(a, n-2, n-1);
		}
		return;
	}
//	printArray();
	if (step == e){
		int money = calculate();
		if (money>maxM) maxM=money;
		return;
	}
	for (int i=x;i<n-1;i++){
		for (int j=i+1;j<n;j++){
			if (i!=j){
				swap(a, i, j);
				Try(step+1, i+1);
				swap(a, i, j);
			}
		}
	}
}

int main(){
//	freopen("MoneyPrize.txt","r",stdin);
	int T;
	cin>>T;
	for (int tc=1;tc<=T;tc++){
		cout<<"Case #"<<tc<<endl;
		char tmp[8];
		cin>>tmp;
		n=0;
		while (tmp[n]!='\0'){
			a[n]=tmp[n]-'0';
			n++;
		}
		cin>>e;
		maxM = 0;
		Try(0, 0);
		cout<<maxM<<endl;
	}
}