#include <iostream> using namespace std; int main() { // 10个洞，1~10号，初始都没访问 bool vis[11]; // 基础循环手动初始化，不用memset for (int i = 1; i <= 10; i++) { vis[i] = false; } // 循环1000次寻找 for (int k = 1; k <= 1000; k++) { // 求和 1+2+...+k，强转long long防溢出 long long total = (long long)k * (k + 1) / 2; int num = total % 10; int hole; if (num == 0) { hole = 10; } else { hole = num; } vis[hole] = true; } cout << "兔子藏在："; // 输出没被找到的洞 for (int i = 1; i <= 10; i++) { if (vis[i] == false) { cout << i << " "; } } cout << endl; return 0; }