제출 #449650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
449650		fuad27	Calvinball championship (CEOI15_teams)	C++14	0 / 100	344 ms	65540 KiB

teams

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int memo[10010][10010] = {0};
int f(int a, int b) {
	if(memo[a][b]!=0)return memo[a][b];
	if(a == 0)return 1;
	return memo[a][b] = (((b%mod)*(f(a-1, b)%mod))%mod+(f(a-1, b+1)%mod))%mod;
}
int32_t main () {
	int n, ans = 0;
	cin >> n;
	int MAX = 0, a[n];
	for(int i = 0;i<n;i++) {
		cin >> a[i];
	}
	MAX = a[0];
	int i = 0;
	if(n > 1)
		ans = (f(n-i-1, MAX)*(a[i+1]-1));
	else ans = 1;
	cout<<ans<<endl;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10