add 4 files with queen problem solution and complexity.md with comments#1
Open
dfdf11-cpu wants to merge 1 commit intomainfrom
Open
add 4 files with queen problem solution and complexity.md with comments#1dfdf11-cpu wants to merge 1 commit intomainfrom
dfdf11-cpu wants to merge 1 commit intomainfrom
Conversation
Godrik0
suggested changes
Dec 2, 2025
Comment on lines
+7
to
+15
| available = ((1 << n) - 1) & ~(columns | d1 | d2) | ||
|
|
||
| while available: | ||
| position = available & -available | ||
| available -= position | ||
|
|
||
| count += solve( | ||
| row + 1, columns | position, (d1 | position) << 1, (d2 | position) >> 1 | ||
| ) |
There was a problem hiding this comment.
Для такой сложной логики обязательно нужны комментарии с пояснениями
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
это домашнее задание про расстановку ферзей.
в файле queen_pereborka.py - переборное решение;
в файле queen_recursion.py - рекурсивное решение;
в файле queen_fast.py - самое быстрое решение;
в файле complexity.md - описание сложности данных решений.