解题思路:
时隔两年还在写水仙花数哈哈哈哈,懒得取函数名了,f1判断是不是水仙花数,f2遍历,懒
注意事项:
参考代码:
#include<bits/stdc++.h> using namespace std; bool f1(int num) { int tmp = num; int sum = 0; while (tmp) { sum += pow((tmp % 10), 3); tmp /= 10; } return sum == num; } void f2(int begin, int end) { bool exist = false; for (int i = begin; i <= end; ++i) { if (f1(i)) { cout << i << ' '; exist = true; } } if (!exist) { cout << "no"; } cout << endl; } int main() { int m, n; while (cin >> m >> n) { f2(m, n); } return 0; }
0.0分
0 人评分