Skip to content

Instantly share code, notes, and snippets.

@ctylim
Created December 17, 2017 12:07
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
Star You must be signed in to star a gist
Save ctylim/e9413ebbea44878f10ad07c5f8e00b75 to your computer and use it in GitHub Desktop.
Code Festival 2017 Final G Mancala
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _repargs(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 2000000007
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p = 0) {
if(p) cout << fixed << setprecision(p) << a << "\n";
else cout << a << "\n";
}
// end of template
ll pow_mod(ll a, ll b, ll m){
ll ret = 1;
while (b > 0) {
if (b & 1) {
ret = ret * a % m;
}
a = a * a % m;
b >>= 1;
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
// source code
ll N, K;
cin >> N >> K;
ll sum = K * (K + 1) / 2;
(sum *= N) %= mod;
(sum *= pow_mod(K + 1, N - 1, mod)) %= mod;
vector<vector<ll>> dp(N + 2, vector<ll>(10010, 0));
dp[N + 1][0] = 1;
for(int i = (int)N; i >= 1; i--){
rep(j, 5100){
rep(k, K + 1){
if(k <= i){
(dp[i][j + (k + j) / i] += dp[i + 1][j]) %= mod;
}
else {
(dp[i][j] += dp[i + 1][j]) %= mod;
}
}
}
}
ll sub = 0;
rep(i, N * N + 1){
(sub += (dp[1][i] * i) % mod) %= mod;
}
output((sum - sub + mod) % mod);
return 0;
}
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _repargs(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 2000000007
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p = 0) {
if(p) cout << fixed << setprecision(p) << a << "\n";
else cout << a << "\n";
}
// end of template
bool check(vector<int> &A){
rep(i, A.size()){
if(A[i] == i + 1){
return true;
}
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
// source code
int N = 100;
vector<int> A(N);
rep(i, N){
A[i] = i + 1;
}
int cnt = 0;
while(check(A)){
rep(i, N){
if(A[i] == i + 1){
A[i] = 0;
rep(j, i){
A[j]++;
}
break;
}
}
cnt++;
}
output(cnt); // 3281
return 0;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment