easy 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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\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        ios_base::sync_with_stdio(false);\n\n        vector<bool> list(n + 1, false);\n        vector<int> losers;\n        int player = 1, j = 1;\n        list[player] = true;\n        while (true) {\n            player = player+(k * j++);\n            (player > n) ? player %= n ,player==0 ? player=n:0: 0;\n            \n            if (!list[player])   list[player] = true;\n            else    break;\n        }\n        for (int i = 1; i < n + 1; ++i)    if (!list[i])   losers.push_back(i);\n        return losers;\n    }\n};\n```
['C++']