Skip to content

Solve #23 (달팽이는올라가고싶다), #25 (루트 2) by Junhui Kim #24

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.

Sign up for GitHub

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

Jump to bottom
Open
hihiboss wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Solve #23 (달팽이는올라가고싶다), #25 (루트 2) by Junhui Kim #24

hihiboss wants to merge 2 commits into from

Conversation

@hihiboss
Copy link
Contributor

@hihiboss hihiboss commented Apr 3, 2019 •
edited
Loading

  1. Algorithm
  • Just.. calculation...?
  • Binary Search
  1. Time Complexity
  • O(1)
  • O(log N)

#23 #25

boohyunsik
boohyunsik reviewed Apr 3, 2019
View reviewed changes
junhuikim/2869-달팽이는올라가고싶다.cpp Outdated
Copy link
Contributor

@boohyunsik boohyunsik Apr 3, 2019

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

엥 이거 이렇게 풀림?????

Copy link
Contributor

@boohyunsik boohyunsik Apr 3, 2019

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

이러면 시간초과 날텐데

@hihiboss hihiboss changed the title Solve baekjoon no.2869 by Junhui Kim Solve #23 (달팽이는올라가고싶다), #25 (루트 2) by Junhui Kim Apr 5, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

@boohyunsik boohyunsik boohyunsik left review comments

Assignees

No one assigned

Labels

None yet

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

2 participants

@hihiboss @boohyunsik