C语言：从n个整数中精准找出含数字8最多的幸运数

```c #include <stdio.h> int ndigit(int n, int k) { int count = 0; while (n > 0) { if (n % 10 == k) { count++; } n /= 10; } return count; } int main() { int n, maxCount = 0, luckyNumber = -1; scanf("%d", &n); for (int i = 0; i < n; i++) { int num; scanf("%d", &num); int eightCount = ndigit(num, 8); if (eightCount > maxCount) { maxCount = eightCount; luckyNumber = num; } } if (luckyNumber == -1) { printf("no"); } else { printf("%d", luckyNumber); } return 0; } ``` ######[AI写代码神器 | 227点数解答 | 2024-11-18 21:16:17]