Skip to content

🐜 Study: ν”Όλ‘œλ„#80

Merged
ing-eoking merged 1 commit intoBugShelter:mainfrom
ing-eoking:04/11
Apr 14, 2025
Merged

🐜 Study: ν”Όλ‘œλ„#80
ing-eoking merged 1 commit intoBugShelter:mainfrom
ing-eoking:04/11

Conversation

@ing-eoking
Copy link
Collaborator

πŸ“Œ κ΄€λ ¨ 문제

πŸ“‹ 풀이 μš”μ•½

μˆœμ—΄ 문제

😞 μ‹€νŒ¨ν•œ ν…ŒμŠ€νŠΈ μΌ€μ΄μŠ€

@ing-eoking ing-eoking added Algorithm μ•Œκ³ λ¦¬μ¦˜ 문제 풀이 🐜 Study μ•Œκ³ λ¦¬μ¦˜ 문제 곡뢀 labels Apr 11, 2025
@ing-eoking ing-eoking requested a review from Copilot April 11, 2025 00:08
@ing-eoking ing-eoking self-assigned this Apr 11, 2025
@ing-eoking ing-eoking linked an issue Apr 11, 2025 that may be closed by this pull request
Copy link

Copilot AI left a comment

Choose a reason for hiding this comment

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

Copilot reviewed 1 out of 1 changed files in this pull request and generated no comments.

Comments suppressed due to low confidence (1)

ν”Όλ‘œλ„.py:4

  • [nitpick] Consider renaming variables for improved clarity (e.g., use 'current_fatigue' instead of 't', 'min_required' instead of 'i', and 'cost' instead of 'j') and breaking the one-liner into multiple statements to enhance readability.
return max((lambda t = k: sum((t := t - j) >= 0 and t + j >= i for i, j in p))() for p in permutations(dungeons))

@ing-eoking ing-eoking requested review from Copilot and yongjun-0903 and removed request for Copilot April 11, 2025 00:09

This comment was marked as duplicate.

@ing-eoking ing-eoking merged commit 0f5fd3a into BugShelter:main Apr 14, 2025
github-actions bot pushed a commit that referenced this pull request Apr 14, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

Algorithm μ•Œκ³ λ¦¬μ¦˜ 문제 풀이 🐜 Study μ•Œκ³ λ¦¬μ¦˜ 문제 곡뢀

Projects

None yet

Development

Successfully merging this pull request may close these issues.

[였늘의 μ•Œκ³ λ¦¬μ¦˜] ν”Όλ‘œλ„

2 participants