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:T6b8,#include #include #include #include #include using namespace std; vector vis(10000, 0); int ans; int D(int x){ return (x*2)%10000; } int S(int x){ if(x-1 == 0) return 9999; else return x-1; } int L(int x){ int tho = x/1000; int hun = (x/100)%10; int ten = (x%100)/10; int one = x%10; return hun*1000 + ten*100 + one*10 + tho; } int R(int x){ int tho = x/1000; int hun = (x/100)%10; int ten = (x%100)/10; int one = x%10; return one*1000 + tho*100 + hun*10 + ten; } void bfs(int x){ queue> q; q.push(make_pair(x,"")); //m[x] = ""; vis[x] = true; while(!q.empty()){ int nx = q.front().first; string st = q.front().second; q.pop(); if(nx == ans) { cout << st << "\n";

제출 #32452

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: