众数-半数集问题-全排列-集合划分

众数问题

#include<stdio.h>
const int maxn = 10000001;
int a[maxn] = {0};
int main() {
	int n,m;
	int max = 0,temp;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &m);
		a[m]++;
	}
	for (int i = 0; i < maxn; i++) {
		if (a[i] > max) {
			max = a[i];
			temp = i;
		}
	}
	printf("%d %d", temp, a[temp]);
}

半数集问题

#include<stdio.h>
int ban(int n) {
	int sum = 1;
	for (int i = 1; i <= n / 2; i++) {
		sum += ban(i);
	}
	return sum;
}
int main() {
	int n;
	scanf("%d", &n);
	int sum = ban(n);
	printf("%d", sum);

}

全排列

#include<stdio.h>
#include<string.h>
void swap(char* a, char* b) {
	char temp = *a;
	*a = *b;
	*b = temp;
}
int Findsame(char list[], int k, int m) {
	for (int i = k; i < m; i++) {
		if (list[i] == list[m]) return 1;
	}
	return 0;
}
void perm(char a[], int k, int m) {
	if (k == m) {
		for (int i = 0; i <= m; i++) 
		printf("%c", a[i]);
		printf("\n");
	}
	else {
		
		for (int i = k; i <= m; i++) {
			if (Findsame(a, k, i) == 1)
			continue;
			swap(a + i, a + k);
			perm(a, k + 1, m);
			swap(a + i, a + k);
		}
	}
}
int main() {
	char a[10001];
	int n;
	scanf("%d", &n);
	getchar();
	gets_s(a);
	perm(a, 0, n-1);
}

集合划分问题

#include<stdio.h>
int q(int n, int m) {//n个数分成m个非空集合
	if (m > n || m == 0) return 0;
	if (n == 1||m == 1 || n == m) return 1;
	if (n > m) return (q(n - 1, m - 1) + m * q(n - 1, m));
}
int main() {
	int n; int count = 0;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		count += q(n, i);
	}
	printf("%d", count);
	return 0;
}