程序设计与算法（二）测验汇总(2019夏季)

003:全排列

#include <iostream>
#include<algorithm>
#include<cstring>
#pragma warning(disable:4996)
using namespace std;
char str[10];
void permutation(char* done,char* left,int index) {
	if (left[0]==0) {
		cout << done << endl;
	}
	for (int i = 0;left[i];i++) {
		char b[10];
		done[index] = left[i];
		memcpy(b, left, 10);
		for (int j = i;left[j];j++)
			b[j] = b[j + 1];
		permutation(done,b,index+1);
	}
}
int main()
{
	//freopen("C:\\Users\\czh\\Desktop\\2.txt", "r", stdin);
	cin >> str;
	int len = strlen(str);
	sort(str, str + len);
	char done[10] = {'/0'};
	permutation(done, str, 0);
	return 0;
}

 

004:2的幂次方表示

#include <iostream>
#include<cmath>
#pragma warning(disable:4996)
using namespace std;
void deploy(int n) {
	if (n == 1)
		cout << "2(0)";
	else if (n == 2)
		cout << "2";
	else {
		int ex = log(n) / log(2);
		int temp = pow(2, ex);
		if (ex == 1)
			cout << "2";
		else {
			cout << "2(";
			deploy(ex);
			cout << ")";
		}
		n -= temp;
		if (n) {
			cout << "+";
			deploy(n);
		}
	}

}

int main()
{
	//freopen("C:\\Users\\czh\\Desktop\\2.txt", "r", stdin);
	int n;
	cin >> n;
	deploy(n);
}