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:T53b,#include #include #include #include #include #include #include #include #include using namespace std; #define MAX(x, y) ((x) > (y)) ? (x) : (y) #define MIN(x, y) ((x) < (y)) ? (x) : (y) typedef long long ll; int cur_ans = 0; int N = 0; int main(){ ios::sync_with_stdio(false); cin.tie(NULL); int r, c; cin >> N >> r >> c; int x = r + 1; int y = c + 1; int n = N; while (n >= 1){ int nsqur = pow(2, n); // N=3일때 8 int alpha = 0, beta = 0, zeta = 0; int cur_squr = nsqur/2; if (x > cur_squr && y > cur_squr){ // 4가 기준 alpha = 1; beta = 1; zeta = 3; } else if (x > cur_squr && y <= cur_squr){ alpha = 1; beta = 0; zeta = 2

제출 #13549

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: