C++ 水仙花数判断算法：找出指定范围内的所有水仙花数

#include #include #include using namespace std;

bool isNarcissisticNumber(int num) { int digit1 = num / 100; int digit2 = (num / 10) % 10; int digit3 = num % 10; int sum = pow(digit1, 3) + pow(digit2, 3) + pow(digit3, 3); return sum == num; }

int main() { int m, n; cin >> m >> n; vector narcissisticNumbers; for (int i = m; i <= n; i++) { if (isNarcissisticNumber(i)) { narcissisticNumbers.push_back(i); } } if (narcissisticNumbers.empty()) { cout << 'no' << endl; } else { for (int i = 0; i < narcissisticNumbers.size(); i++) { cout << narcissisticNumbers[i] << ' '; } cout << endl; } return 0; }