정화 코딩

https://www.acmicpc.net/problem/10830 #include #include using namespace std;int n;long long b;int mod = 1000;vector> mpow(vector> a, long long c) { vector> res(n, vector(n)); if (c == 1) { return a; } else if (c % 2 == 0) { vector> tmp = mpow(a, c / 2); for (int i = 0; i > tmp = mpow(a, c - 1); for (int i = 0; i > n >> b; vector> a(n, vector(n)); for (i..