Skip to content

Mun: 3월 2주차 문제 풀이#25

Open
muncool39 wants to merge 3 commits intomainfrom
mun
Open

Mun: 3월 2주차 문제 풀이#25
muncool39 wants to merge 3 commits intomainfrom
mun

Conversation

@muncool39
Copy link
Member

🔥 해결한 문제

백준


🚒 해결하지 못한 문제

원인 분석

점화식을 세우지 못했습니다.

개선 계획

풀이를 듣고 이해 후, 다시 풀어보겠습니다.


@muncool39 muncool39 self-assigned this Mar 10, 2026
Copy link
Member

@gitseoyeon gitseoyeon left a comment

Choose a reason for hiding this comment

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

이번주차도 고생하셨습니다~ 좋은 풀이 잘 참고했습니다!! 👀

for(int i=0;i<3;i++) {
list[i] = new ArrayList<>();
}
int setNum = Math.min(B, Math.min(C, D));
Copy link
Member

Choose a reason for hiding this comment

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

미리 세트의 개수를 정해두고 추후 계산 하니까 확실히 효율적인거같네요!! 굳입니다.. 👍🏻

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants