19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"CodeViewer"] 1a:T50d,#include int main() { int dp[21][21][21]; for (int x = 0; x < 21; x++) { for (int y = 0; y < 21; y++) { for (int z = 0; z < 21; z++) { if(x == 0 || y == 0 || z == 0) dp[x][y][z] = 1; else dp[x][y][z] = 0; } } } for (int x = 1; x < 21; x++) { for (int y = 1; y < 21; y++) { for (int z = 1; z < 21; z++) { if (x < y && y < z) { dp[x][y][z] = dp[x][y][z-1] + dp[x][y-1][z-1] - dp[x][y-1][z]; } else { dp[x][y][z] = dp[x-1][y][z] + dp[x-1][y-1][z] + dp[x-1][y][z-1] - dp[x-1][y-1][z-1]; } } } } while(1) { int A, B, C; std::cin >> A >> B >> C; if (A == -1 && B == -1 && C == -1) { break; } std::cout << "w(" << A << ", " << B << ", " << C << ") = " ; else if (A > 20 || B > 20 || C > 20) { A = 20; B = 20; C = 20; }else if (A <= 0 || B <= 0 || C <= 0) { A = 0; B = 0; C = 0; } std::cout << dp[A][B][C] << std::endl; } return 0; }

제출 #21480

제출 정보

제출 결과

제출 코드

찾은 반례