Submission #1180588

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>

using namespace std;

typedef long long int lld;

const lld mod = 1e9+7;
const lld INF = 1e9;
const lld MAXW = 1e3;

int main()
{
	lld w,h;
	lld dp[MAXW][MAXW] = {0};

	cin >> w >> h;

	for(int i = 0; i < w; i++)
	{
		dp[0][i] = 1;
	}
	for(int i = 0; i < h; i++)
	{
		dp[i][0] = 1;
	}

	for(int i = 1; i < h; i++)
	{
		for(int j = 1; j < w; j++)
		{
			dp[i][j] = dp[i-1][j] % mod + dp[i][j-1] % mod;
		}
	}

	// for(int i = 0; i < h; i++)
	// {
	// 	for(int j = 0; j < w; j++)
	// 	{
	// 		cout << dp[i][j] << " ";
	// 	}
	// 	cout << endl;
	// }

	cout << dp[h-1][w-1] % mod << endl;

	return 0;
}
	

Submission Info

Judge Result