C++实现：在小于1000的n个数中找出禾木喜欢的8的倍数且不含8的数

```cpp #include <iostream> using namespace std; bool isLiked(int num) { if (num % 8 != 0) return false; while (num > 0) { if (num % 10 == 8) return false; num /= 10; } return true; } int main() { int n; cin >> n; int arr[100]; for (int i = 0; i < n; i++) { cin >> arr[i]; } bool first = true; for (int i = 0; i < n; i++) { if (isLiked(arr[i])) { if (!first) cout << " "; cout << arr[i]; first = false; } } return 0; } ``` ######[AI问答 | 206点数解答 | 2026-01-24 20:44:14]