#include <iostream> using namespace std; int main() { int vis[11] = {0}; int pos = 1; vis[pos] = 1; // 只需循环到周期20，远小于1000，彻底解决TLE for (int k = 2; k <= 20; ++k) { pos = (pos + k - 1) % 10 + 1; vis[pos] = 1; } bool first = true; for (int i = 1; i <= 10; ++i) { if (!vis[i]) { if (!first) cout << " "; cout << i; first = false; } } cout << endl; return 0; }