8000 [23-03-02] dain.py by da-in · Pull Request #141 · da-in/algorithm-study · GitHub
[go: up one dir, main page]

Skip to content

[23-03-02] dain.py #141

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
merged 5 commits into from
Mar 5, 2023
Merged

[23-03-02] dain.py #141

merged 5 commits into from
Mar 5, 2023

Conversation

da-in
Copy link
Owner
@da-in da-in commented Mar 1, 2023

PR Summary

  • 방의 개수

    • 음... 그래프가 맞긴 한데... 그래프... 음
    • Rule 1 : 기존에 방문한 점과, 새롭게 연결되면 방이 생긴다.
    • Rule 2 :대각선과 대각선이 교차하면 방이 하나 생긴다.
      • 이 두 가지의 if/else 케이스를 정리를 못해서 헤맸습니당
    • 풀고나서 보니 2칸씩 가는 코드가 간결한 방법이 있네요! 이렇게 또 배워갑니다🥳
  • (추가) 오일러 정리 를 이용한 풀이

ISSUE NUMBER

@da-in da-in self-assigned this Mar 1, 2023
@da-in da-in changed the title 📝 Create [그래프] 방의 개수 dain.py [23-03-02] 방의 개수 dain.py Mar 2, 2023
@da-in da-in changed the title [23-03-02] 방의 개수 dain.py [23-03-02] dain.py Mar 2, 2023
@da-in da-in merged commit 9cbb4fd into 8EAB main Mar 5, 2023
@da-in da-in mentioned this pull request Mar 5, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant
0