Last Updated：2025/12/06
Sentence
プレイヤーの一覧からランダムな単一サイクル置換を生成するために、配列全体の任意の順列ではなく長さnの最大長のサイクルを一様に生成するフィッシャー＝イェーツ・シャッフルの変法を実装しました。
Quizzes for review
For generating a random single-cycle permutation of a list of players, we implemented Sattolo's algorithm.
See correct answer
For generating a random single-cycle permutation of a list of players, we implemented Sattolo's algorithm.
音声機能が動作しない場合はこちらをご確認ください
Related words
Sattolo's algorithm
Proper noun
Japanese Meaning
Fisher‐Yatesシャッフルの変種で、配列全体の順列ではなく、最大長 n の一様分布のサイクル（循環）を生成するアルゴリズム
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
