https://www.luogu.com.cn/problem/P1002
#include<cstdio>
#include<iostream>
using namespace std;
long long f[25][25];
bool g[25][25];
//用long long就可以了,爆不掉,不需要高精
//x1为棋盘长度 y1为棋盘宽度
//x2为马的横坐标 y2为马的纵坐标
//g数组记录该点是否可走 f数组记录路线
int main() {
int x1, y1, x2, y2;
/*scanf("%d %d", &x1, &y1);
scanf("%d %d", &x2, &y2);*/
cin >> x1 >> y1 >> x2 >> y2;
g[x2][y2] = 1;
//记录马的控制点
if (x2 > 1 && y2 != 0) g[x2 - 2][y2 - 1] = 1;//这里>1与>=2是等效的,下同
if (x2 < 19 && y2 != 0) g[x2 + 2][y2 - 1] = 1;//这里<19与<=18是等效的,下同
if (x2 > 1 && y2 != 20) g[x2 - 2][y2 + 1] = 1;
if (x2 < 19 && y2 != 20) g[x2 + 2][y2 + 1] = 1;
if (x2 != 0 && y2 > 1) g[x2 - 1][y2 - 2] = 1;
if (x2 != 0 && y2 < 19) g[x2 - 1][y2 + 2] = 1;
if (x2 != 20 && y2 > 1) g[x2 + 1][y2 - 2] = 1;
if (x2 != 20 && y2 < 19) g[x2 + 1][y2 + 2] = 1;
//递推过程
for (int i = 0; i <= x1; ++i)
for (int j = 0; j <= y1; ++j)
if (!g[i][j]) { //该点没被马控制
if (i == 0 && j == 0) //递推边界1 f[0][0]=1不是0
f[0][0] = 1;
else if (i == 0 && j > 0)//递推边界2,x=0时;
f[0][j] = f[0][j - 1];
else if (i > 0 && j == 0)//递推边界3,y=0时;
f[i][0] = f[i - 1][0];
else
f[i][j] = f[i - 1][j] + f[i][j - 1];//递推核心
}
//最终i循环到x1位置,j循环到y1位置(x1,y1)即为目标点)则f[x1][y1]就是答案
//printf("%lld\n", f[x1][y1]);//格式化输出(lld不要写成d)
cout << f[x1][y1] << endl;
return 0;//返回值return 0一定要写,不然比赛会出错(windows自动返回0)
}
https://www.luogu.com.cn/problem/P2437
#include<iostream>
using namespace std;
int a[1010][1210];
bool pd = 0;
int main() {
int n, m, k;
cin >> n >> m;
k = m - n;
a[0][0] = 0;
a[1][0] = 1;
a[2][0] = 2;
int i, j;
for (int i = 3; i <= k; i++)//优化
{
for (j = 0; j < 1010; j++) {
a[i][j] += a[i - 1][j] + a[i - 2][j];
while (a[i][j] > 9) {
a[i][j] -= 10;
a[i][j + 1] ++;
}
}
}
for (i = 1010; i >= 0;i--) {//输出技巧 bool pd=0
if (!pd && a[k][i] == 0) {
continue;
}
pd = 1;
cout << a[k][i];
}
cout << endl;
return 0;
}
https://www.luogu.com.cn/problem/P1044
卡特兰数:
h(n)=c(2n,n)-c(2n,n-1) (n=0,1,2,…)(记住这个组合数公式,h(n)为卡特兰数)c(m,n)=c(m-1,n-1)+c(m-1,n)(组合数公式)
#include<iostream>
using namespace std;
int f[60][30];
int main() {
int i, j, n;
cin >> n;
for (i = 0; i < 2 * n; i++) {
f[i][0] = 1, f[i][i] = 1;
}
for (i = 2; i < 2 * n; i++) {
for (j = 1; j < i; j++) {
f[i][j] = f[i-1][j] + f[i - 1][j - 1];
}
}
int num = f[2 * n-1][n-1] - f[2 * n-1][n - 2];
cout << num << endl;
return 0;
}
(从n个数字中选k个数字)https://www.luogu.com.cn/problem/P1036
#include<iostream>
#include<cmath>
using namespace std;
int ans, n, k;
int p[30];
bool prime(int x) {
int i;
if (x == 2 || x == 3) {
return true;
}
else {
for (i = 2; i <= sqrt(x); i++) {
if (x % i == 0) {
return false;
}
}
return true;
}
}
void vec(int x, int num, int st) {
if (x == k && prime(num)) {
ans++;
}
int i;
for (i = st; i < n; i++) {
vec(x+1, num + p[i], i+1);
}
}
int main() {
int i;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> p[i];
}
vec(0, 0, 0);
cout << ans << endl;
return 0;
}
难点(递归):
void vec(int x, int num, int st) {
if (x == k && prime(num)) {
ans++;
}
int i;
for (i = st; i < n; i++) {
vec(x+1, num + p[i], i+1);
//这里不能打成vec(x++,num+p[i],i++)
}
}