Hello codefoces users.↵
↵
A while ago, I solved CSES problem 2209 ([https://cses.fi/problemset/task/2209](https://cses.fi/problemset/task/2209)) related to combinatorics involving necklaces (https://en.wikipedia.org/wiki/Necklace_(combinatorics)) with a time complexity of O(sqrt(n) + divs(n)^2 * (divs(n) + log(n))). I believe this complexity can be further reduced to O(sqrt(n) + divs(n) * (2^(nOfPrimes(n)) * log(divs(n)) + log(n))).↵
↵
Upon reading the editorial, I discovered that the official solution utilizes Burnside's Lemma and has a time complexity of O(nlogn). I was unsure if my solution was previously known or not.↵
↵
After conducting some research, I was unable to find a similar solution to mine. Consequently, I considered using this problem with higher constraints in a future contest. However, I am uncertain whether this is a wise decision. Therefore, I have two questions:↵
↵
1. Is there a known solution with a better time complexity for this problem than my approach?↵
2. Would it be advisable to incorporate a classical problem with higher constraints into a contest?↵
↵
Thank you for your assistance.
↵
A while ago, I solved CSES problem 2209 ([https://cses.fi/problemset/task/2209](https://cses.fi/problemset/task/2209)) related to combinatorics involving necklaces (https://en.wikipedia.org/wiki/Necklace_(combinatorics)) with a time complexity of O(sqrt(n) + divs(n)
↵
Upon reading the editorial, I discovered that the official solution utilizes Burnside's Lemma and has a time complexity of O(nlogn). I was unsure if my solution was previously known or not.↵
↵
After conducting some research, I was unable to find a similar solution to mine. Consequently, I considered using this problem with higher constraints in a future contest. However, I am uncertain whether this is a wise decision. Therefore, I have two questions:↵
↵
1. Is there a known solution with a better time complexity for this problem than my approach?↵
2. Would it be advisable to incorporate a classical problem with higher constraints into a contest?↵
↵
Thank you for your assistance.
