Submission #1303063

---

Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1000000007;

ll table[510][510];

void combination() {
	for (int i = 0; i < 510; i++) {
		for (int j = 0; j <= i; j++) {
			if (j == 0 || j == i) {
				table[i][j] = 1LL;
			}
			else {
				table[i][j] = table[i - 1][j - 1] + table[i - 1][j];
				table[i][j] %= MOD;
			}
		}
	}
}

int main() {
	int N, M;
	cin >> N >> M;

	if (M >= N) {
		combination();
		cout << table[N][M % N] << endl;
	}
	else {
		cout << ((M + 1) % MOD)*(N%MOD) << endl;
	}

	return  0;
}

Submission Info

Judge Result