## Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 – Final Round Div. 2 Edition), problem: (F) Bacterial Melee Solution in C/C++

#include <bits/stdc++.h> using namespace std; const int mod = 1e9+7; long long t[20000]; long long binpow(long long a, long long n){ long long ans = 1; while(n){ if(n&1) ans = ans*a % mod; a = a*a % mod; n >>= 1; } return ans; [...]