제출 #449625

#제출 시각아이디문제언어결과실행 시간메모리
449625fuad27Calvinball championship (CEOI15_teams)C++14
0 / 100
1090 ms460 KiB
#include<bits/stdc++.h>
using namespace std;
int f(int a, int b) {
	if(a == 0)return 1;
	return b*f(a-1, b)+f(a-1, b+1);
}
int 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;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...