Skip to content

[20260128] BOJ / G4 / 트리의 지름(물음표) / 이인희 #1851

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
ShinHeeEul merged 1 commit into from
Jan 28, 2026
Merged

[20260128] BOJ / G4 / 트리의 지름(물음표) / 이인희 #1851

ShinHeeEul merged 1 commit into from
Jan 28, 2026

Conversation

@LiiNi-coder
Copy link
Contributor

@LiiNi-coder LiiNi-coder commented Jan 28, 2026 •
edited
Loading

🧷 문제 링크

https://www.acmicpc.net/problem/30391

🧭 풀이 시간

50 분

👀 체감 난이도

  • 상
  • 중
  • 하

✏️ 문제 설명

  • 1부터 n까지의 정점을 가지는 그래프에 n-1개의 간선으로 트리를 만들때, 차수 K개 이하룰 가지면서 가장 짧은 트리의 지름을 가지도록하는 트리를 출력

🔍 풀이 방법

  • 풀다 시간없어서 올립니다

⏳ 회고

  • 풀다 시간없어서 올립니다

@LiiNi-coder LiiNi-coder added the fail 😢 해설을 보고 풀었거나, 못 풀었을 때 label Jan 28, 2026
@ShinHeeEul ShinHeeEul merged commit d33599e into main Jan 28, 2026
1 check passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

No reviews

Assignees

@LiiNi-coder LiiNi-coder

Labels

fail 😢 해설을 보고 풀었거나, 못 풀었을 때

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

3 participants

@LiiNi-coder @ShinHeeEul