Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: 8 ms\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: 15.17 MB\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> circularGameLosers(int n, int k) {\n        std::vector<int> res;\n        int l = 1, y = 1;\n        std::unordered_map<int, int> play;\n        for (int r = 0; r != n; ++r) {\n            play[r + 1] = 0;\n        }\n        for (bool i = true; i; ++y) {\n            ++play[l];\n            if (play[l] == 2) {\n                i = false;\n                break;\n            }\n            l += (y * k);\n            for (; l > n; ) {\n                l -= n;\n            }\n        }\n        for (const auto& [play, ball] : play) {\n            if (ball == 0) {\n                res.push_back(play);\n            }\n        }\n        std::sort(res.begin(), res.end());\n        return res;\n    }\n};\n```
['C++']