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"] 1b:I[48988,["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"],"TestCaseDisplay"] 1a:T5cc,#include using namespace std; using ui = unsigned int; ui visit_cnt = 0; void z_recursion(ui row, ui col, ui N) { //base condition if(0 == row && 0 == col) { cout << visit_cnt; return; } else if(0 == row && 1 == col) { cout << visit_cnt + 1; return; } else if(1 == row && 0 == col) { cout << visit_cnt + 2; return; } else if(1 == row && 1 == col) { cout << visit_cnt + 3; return; } ui middle_val = 1; ui d_sum = 1; // middle value : (2^n-1) - 1 middle_val <<= (N-1); --middle_val; d_sum <<= (2*(N-1)); ui offset_row = row - middle_val; ui offset_col = col - middle_val; if(offset_row <= 0 && offset_col <= 0) { z_recursion(row, col, N-1); } else if (offset_row <= 0 && offset_col

제출 #16380

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: