8000 [23-02-03] hyuksoon.py by chs98412 · Pull Request #55 · da-in/algorithm-study · GitHub
[go: up one dir, main page]
Skip to content

[23-02-03] hyuksoon.py #55

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

[23-02-03] hyuksoon.py #55

merged 3 commits into from
Feb 5, 2023

Conversation

chs98412
Copy link
Collaborator
@chs98412 chs98412 commented Feb 2, 2023

PR Summary

  • N으로 표현
    dp라는게 안써있었다면 못풀지 않았을까 생각이 들었슴다,,
    첨엔 사실 틀린 점화식을 생각했었어요
    dp[x]=x라는 숫자를 만드는데 필요한 숫자N의 갯수
    로 생각하다가 그러면 너무 커지기도 하고 12의 사칙연산을 다 생각해야한단 점에서 틀렸다는걸 알았고
    어찌저찌 하다가 최대 8개까지만 쓸 수 있다는걸 그제서야 발견해서 풀었습니다.

  • 체육복
    이것도 조이스틱처럼 예전에 풀었었는데 지금은 틀린 코드가 되어있었어요
    그땐 교집합 구하느라 인터섹션 어쩌구 사용했었는데
    익숙한 코드가 아니라서 실전가면 생각 안날까봐 없이 풀어봤슴니다(찾아보기 귀찮아서는 아님 ㅎㅎ,,사실 "a in list" 쓰기 싫어서 첨에 해시로 푼건데 풀다보니까 점점 귀찮아서 그냥 썼어요)

ISSUE NUMBER

@chs98412 chs98412 self-assigned this Feb 3, 2023
@chs98412 chs98412 merged commit 791317c into da-in:main Feb 5, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@da-in da-in Awaiting requested review from da-in da-in is a code owner

@Lee-DoHa Lee-DoHa Awaiting requested review from Lee-DoHa

@lalabulla lalabulla Awaiting requested review from lalabulla lalabulla is a code owner

@seungueonn seungueonn Awaiting requested review from seungueonn

Assignees

@chs98412 chs98412

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@chs98412
0