Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

[정기적 해설 추가] 2022年03月23日, 2문제 #4

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
jaewon1676 merged 3 commits into main from codeisneverodd
Mar 23, 2022
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
[풀이 추가] 22-03-22, 1문제, 예상-대진표
  • Loading branch information
codeisneverodd committed Mar 22, 2022
commit d06603d16a68d5211d8b84057b3ae3e56fbbdafb
15 changes: 15 additions & 0 deletions level-2/예상-대진표.js
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
//https://github.com/codeisneverodd/programmers-coding-test
//완벽한 정답이 아닙니다.
//정답 1 - codeisneverodd

function solution(n, a, b) {
let currentRound = 1;
const myNextNumber = (num) => Math.floor((num + 1) / 2)//내가 이긴경우 다음으로 가지게 될 번호
while (a !== b) { // a의 다음 번호가 b의 다음번호와 같아지면 끝난다.
if (myNextNumber(a) === myNextNumber(b)) break
a = myNextNumber(a)
b = myNextNumber(b)
currentRound++
}
return currentRound
}

AltStyle によって変換されたページ (->オリジナル) /