CustomCC0-1.0#cptp0101400
Cycle Length GCD
Summary
- •Phase 4 / cycle_decomposition, gcd
- •Reasoning-first competitive programming drill
Problem Description
Given a permutation of length n, compute the greatest common divisor (GCD) of the lengths of all cycles.
How to read this problem in plain language:
- This is a Phase 4 reasoning drill focused on cycl, gcd.
- Typical lenses to test first: permutation, cycles, gcd.
- Constraints reminder: 1 ≤
Mini examples for mental simulation:
1) Boundary example: Describe why this case is tricky. Explain expected behavior and why naive logic may fail.
2) Adversarial example: Adversarial case where naive greedy/local decision looks correct but fails globally.
Lite-mode writing target:
- Write 1~2 observations that shrink the search space.
- Name one final algorithm and state target complexity explicitly.
- Validate with at least 2 edge cases and one hand simulation.
Constraints
- •1 ≤
Analysis
Key Insight
The goal is to force explicit intermediate reasoning before revealing more.
permutationcyclesgcd