12-26标程

取数游戏

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int f[10][10], a[10][10], maxx = 0;
int n, m, t;
void dfs(int sum, int x, int y)
{
    if (x > n)
    {
        maxx = max(maxx, sum);
        return;
    }
    int yy = y + 1, xx = x;
    if (yy > m)
    {
        yy = 1;
        xx = x + 1;
    }
    if (!f[x - 1][y - 1] && !f[x - 1][y] && !f[x - 1][y + 1] && !f[x][y - 1] && !f[x][y + 1] && !f[x + 1][y - 1] && !f[x + 1][y] && !f[x + 1][y + 1])
    {
        f[x][y] = 1;
        dfs(sum + a[x][y], xx, yy);
        f[x][y] = 0;
    }
    dfs(sum, xx, yy);
}
int main()
{

    cin >> t;
    while (t--)
    {
        maxx=0;
        memset(f, 0, sizeof(f));
        cin >> n >> m;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                cin >> a[i][j];
        dfs(0,1,1);
        cout<<maxx<<endl;
    }

    return 0;
}

阶乘数码

#include <iostream>
#include <cstring>
#include <algorithm>
 
using namespace std;
int sum[100010];
int tail; //记录sum数组的长度 

void mul(int x){
	// sum * x 
	int t=0;
	for(int i=0;i<tail;i++){
		t += sum[i] * x;
		sum[i] = t%10;
		t /= 10; 
	}
	
	while(t){
		sum[tail++] = t%10;
		t/=10;
	}
}

int main()
{
	int t,n,a;
	cin>>t;
	while(t--){
		cin>>n>>a;
		tail=0;
		sum[tail++]=1;
		for(int i=2;i<=n;i++){
			mul(i);
		}
		
		// sum n!  
		int ans=0;
		for(int i=tail-1;i>=0;i--){
			if(sum[i] ==a){
				ans++;
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}

阶乘之和

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
const int N=100010;
int sum[N],ans[N]; 
int tail1,tail2;
// sum 阶乘
// ans 阶乘的和，sum 
void mul(int x){
	// sum * x 
	int t=0;
	for(int i=0;i<tail1;i++){
		t += sum[i] * x;
		sum[i] = t%10;
		t /= 10; 
	}
	
	while(t){
		sum[tail1++] = t%10;
		t/=10;
	}
}

// ans = ans + sum;
void add(){
	int t = 0;
	for(int i=0;i<tail1;i++){
		t += ans[i] + sum[i];
		ans[i] = t%10;
		t /=10;
	}
	tail2= tail1;
	// + 
	// 两数相加，最终长度最多之比长的数多一位 
	while(t){
		ans[tail2++] = t%10;
		t/=10;
	}
}

int main()
{
	int n;
	cin>>n;
	sum[tail1++]=1;
	
	for(int i=1;i<=n;i++){
		mul(i);
		add();
	}
	
	for(int i=tail2-1;i>=0;i--){
		cout<<ans[i];
	}
	cout<<endl;
	
	return 0;
}

跳马问题
思路一 dfs搜索

#include <algorithm>
#include <cstring>
#include <iostream>

using namespace std;

int next_x[4] = {-2, -1, 1, 2};
int next_y[4] = {1, 2, 2, 1};
int n, m;
int sum[20][20];

void dfs(int x, int y) {
    sum[x][y] += 1;
    for (int i = 0; i < 4; i++) {
        int xx = x + next_x[i];
        int yy = y + next_y[i];
        if (xx >= 0 && xx <= n && yy >= 0 && yy <= m) {
            dfs(xx, yy);
        }
    }
}

int main() {
    cin >> n >> m;
    dfs(0, 0);
    cout << sum[n][m] << endl;
    return 0;
}

思路二 递推

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;
int next_x[4]={-2,-1,1,2};
int next_y[4]={-1,-2,-2,-1};

int sum[20][20];


int main(){
    int n,m;
    cin>>n>>m;
    sum[0][0]=1;
    for(int j=0;j<=m;j++){
        for(int i=0;i<=n;i++){
            for(int l=0;l<4;l++){
                int xx = i + next_x[l];
                int yy = j + next_y[l];
                if(xx>=0&&xx<=n&&yy>=0&&yy<=m){
                    sum[i][j]+=sum[xx][yy];
                }
            }
        }
    }
    cout<<sum[n][m]<<endl;
    return 0;
}