| 1 | ll slow(vector<ll> init, vector<ll> c, ll n, ll mod) { |
| 2 | while (n >= init.size()) { |
| 3 | ll cur = 0; |
| 4 | for (int i = 0; i < c.size(); i++) { |
| 5 | cur += c[i] * init[(int)init.size()-1-i] % mod; |
| 6 | if (cur >= mod) cur -= mod; |
| 7 | } |
| 8 | init.push_back(cur); |
| 9 | } |
| 10 | return init[n]; |
| 11 | } |
| 12 | |
| 13 | void test() { |
| 14 | // Field testing: Project Euler 258 |