第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-981 过河马

#include<stdio.h>

int num[105][105];
int main()
{
	int n,m;
	scanf("%d %d",&n,&m);
	num[2][3]=num[3][2]=1;
	int i,j;
	for( i = 1;i <= n;i++)
	{		
		for( j = 1;j <= m;j++)
		{
			if(i-1 >=1 && j-2 >= 1)
			{
				num[i][j] += num[i-1][j-2];
				num[i][j] %= 1000000007;
			} 
			if(i-2 >=1 && j-1 >= 1)
			{
				num[i][j] += num[i-2][j-1];
				num[i][j] %= 1000000007;
			} 
			if(i-2 >=1 && j+1 <= m)
			{
				num[i][j] += num[i-2][j+1];
				num[i][j] %= 1000000007;	
			} 
			if(i-1 >=1 && j+2 <= m)
			{
				num[i][j] += num[i-1][j+2];
				num[i][j] %= 1000000007;	
			} 
		}
	}
	printf("%d",num[n][m]);
	return 0;
 } 

#include<iostream>
using namespace std;
#include<queue>

const int MOD = 1000000007;
bool flag[110][110];
int cnt[110][110];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	flag[1][1] = true;
	cnt[1][1] = 1;
	int m, n;
	cin >> m >> n;
	for (int i = 2; i <= m; ++i) {
		for (int j = 1; j <= n; ++j) {
			if (i - 1 > 0 && j - 2 > 0 && flag[i - 1][j - 2]) {
				cnt[i][j] = (cnt[i][j] + cnt[i - 1][j - 2]) % MOD;
				flag[i][j] = 1;
			}
			if (i - 2 > 0 && j - 1 > 0 && flag[i - 2][j - 1]) {
				cnt[i][j] = (cnt[i][j] + cnt[i - 2][j - 1]) % MOD;
				flag[i][j] = 1;
			}
			if (i - 2 > 0 && j + 1 <= n && flag[i - 2][j + 1]) {
				cnt[i][j] = (cnt[i][j] + cnt[i - 2][j + 1]) % MOD;
				flag[i][j] = 1;
			}
			if (i - 1 > 0 && j + 2 <= n && flag[i - 1][j + 2]) {
				cnt[i][j] = (cnt[i][j] + cnt[i - 1][j + 2]) % MOD;
				flag[i][j] = 1;
			}
		}
	}
	cout << cnt[m][n];
	return 0;
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;

public class Main {
	static BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
	public static void main(String[] args) throws NumberFormatException, IOException {
		String[]strs=bf.readLine().split(" ");
		int n=Integer.valueOf(strs[0]);
		int m=Integer.valueOf(strs[1]);
		int mod=1000000007;
		long ans=0;
		long[][]d=new long[n+1][m+1];
		d[1][1]=1;
		int di[][]= {{-1,-2},{-2,-1},{-1,2},{-2,1}};
		for(int i=1;i<=n;i++) {
			for(int j=1;j<=m;j++) {
				for(int k=0;k<4;k++) {
					int nx=i+di[k][0];
					int ny=j+di[k][1];
					if(nx>=1&&nx<=n&&ny>=1&&ny<=m) {
						d[i][j]=(d[nx][ny]+d[i][j])%mod;
					}
				}
			}
		}
		System.out.println(d[n][m]);
		
	}
	private static void sortAndSelect() throws IOException {
		int n=Integer.valueOf(bf.readLine());
		int[]arr=new int[n];
		String[]strs=bf.readLine().split(" ");
		HashSet<Integer>set=new HashSet();
		for(int i=0;i<n;i++) {
			arr[i]=Integer.valueOf(strs[i]);
		}
		int ans=0x3f3f3f3f;
		Arrays.sort(arr);
		for(int i=0;i<n-1;i++) {
			ans=Math.min(ans, Math.abs(arr[i]-arr[i+1]));
		}
		System.out.println(ans);
	}
}

n,m=list(map(int,input().split()))
ans=[]
for i in range(n+1):
    temp=[0]*(m+1)
    ans.append(temp)
ans[2][3]=1
ans[3][2]=1
for i in range(1,n+1):
    for j in range(1,m+1):
        if  i-1>=1 and j-2>=1:
            ans[i][j]+=ans[i-1][j-2]
            ans[i][j]%=1000000007
        if  i-2>=1 and j-1>=1:
            ans[i][j]+=ans[i-2][j-1]
            ans[i][j]%=1000000007
        if  i-1>=1 and j+2<=m:
            ans[i][j]+=ans[i-1][j+2]
            ans[i][j]%=1000000007
        if  i-2>=1 and j+1<=m:
            ans[i][j]+=ans[i-2][j+1]
            ans[i][j]%=1000000007
print(ans[n][m])