19:I[83391,["/_next/static/chunks/01ctw1akxhipf.js","/_next/static/chunks/0es-u.8d.mnrl.js","/_next/static/chunks/0dy1a2.mvnkkn.js","/_next/static/chunks/1490m.ueos6wm.js","/_next/static/chunks/0e0r8s6q6rqo3.js","/_next/static/chunks/06ql-volcxfrm.js"],"ProblemWorkspace",1] 1c:I[27201,["/_next/static/chunks/01xlw8hd842-c.js","/_next/static/chunks/0-mla.nmfqw.d.js"],"IconMark"] 1a:T468,#include using namespace std; int main(){ int K; cin >> K; // 0=Num 1=/ 2=* 3=- 4=7 5=8 6=9 7=+ 8=4 9=5 10=6 11=1 12=2 13=3 14=Enter 15=0 16=Del vector> adj(17); auto addEdge = [&](int a, int b){ adj[a].push_back(b); adj[b].push_back(a); }; addEdge(0,1); addEdge(0,4); addEdge(1,2); addEdge(1,5); addEdge(2,3); addEdge(2,6); addEdge(3,7); addEdge(4,5); addEdge(4,8); addEdge(5,6); addEdge(5,9); addEdge(6,7); addEdge(6,10); addEdge(7,10); addEdge(7,14); addEdge(8,9); addEdge(8,11); addEdge(9,10); addEdge(9,12); addEdge(10,13); addEdge(11,12); addEdge(11,15); addEdge(12,13); addEdge(12,15); addEdge(13,14); addEdge(13,16); addEdge(14,16); addEdge(15,16); vector d(17, 1); for (int step = 2; step <= K; step++) { vector nd(17, 0); for (int x = 0; x < 17; x++) for (int y : adj[x]) nd[x] += d[y]; d = nd; } unsigned long long total = 0; for (int x = 0; x < 17; x++) total += d[x]; cout << total << "\n"; return 0; } 1b:T468,#include using namespace std; int main(){ int K; cin >> K; // 0=Num 1=/ 2=* 3=- 4=7 5=8 6=9 7=+ 8=4 9=5 10=6 11=1 12=2 13=3 14=Enter 15=0 16=Del vector> adj(17); auto addEdge = [&](int a, int b){ adj[a].push_back(b); adj[b].push_back(a); }; addEdge(0,1); addEdge(0,4); addEdge(1,2); addEdge(1,5); addEdge(2,3); addEdge(2,6); addEdge(3,7); addEdge(4,5); addEdge(4,8); addEdge(5,6); addEdge(5,9); addEdge(6,7); addEdge(6,10); addEdge(7,10); addEdge(7,14); addEdge(8,9); addEdge(8,11); addEdge(9,10); addEdge(9,12); addEdge(10,13); addEdge(11,12); addEdge(11,15); addEdge(12,13); addEdge(12,15); addEdge(13,14); addEdge(13,16); addEdge(14,16); addEdge(15,16); vector d(17, 1); for (int step = 2; step <= K; step++) { vector nd(17, 0); for (int x = 0; x < 17; x++) for (int y : adj[x]) nd[x] += d[y]; d = nd; } unsigned long long total = 0; for (int x = 0; x < 17; x++) total += d[x]; cout << total << "\n"; return 0; }