Submission #449736

#	Time	Username	Problem	Language	Result	Execution time	Memory
449736		fuad27	Calvinball championship (CEOI15_teams)	C++14	0 / 100	114 ms	65544 KiB

teams

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000007
#define z 10010
int memo[10010][10010] = {0};
int f(int a, int b) {
	return memo[a][b];
}
void k() {
for(int i = 0;i<=z;i++) {
	for(int j = z-i-1;j>=0;j--) {
		if(i == 0)memo[i][j] = 1;
		else {
			memo[i][j] = (((j%mod)*(memo[i-1][j]%mod))%mod + memo[i-1][j+1]%mod)%mod;
		}
	}
}
}
int32_t main () {
	k();
	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))%mod;
	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