C++ 程序：找出所有 N 位水仙花数

#include #include using namespace std;

int main() { int N; cin >> N;

int start = pow(10, N-1);
int end = pow(10, N) - 1;

for (int i = start; i <= end; i++) {
    int num = i;
    int sum = 0;
    while (num > 0) {
        int digit = num % 10;
        sum += pow(digit, N);
        num /= 10;
    }
    if (sum == i) {
        cout << i << endl;
    }
}

return 0;

}