3497. 水仙花数
Description
若三位数ABC满足ABC=A3+B3+C3,则称ABC为水仙花数. 例如153就是一个水仙花数. 编程找出100~999范围内的所有水仙花数.
Input
无
Output
输出所有水仙花数,每个水仙花数占一行.
Problem Source
林瀚
// source code of submission 955534, Zhongshan University Online Judge System
#include <iostream>
using namespace std;
int main ()
{
for (int num = 100;num <= 999;num ++)
{
int a = num / 100;
int b = (num % 100) / 10;
int c = ((num % 100) % 10);
if (a*a*a+b*b*b+c*c*c == num)
cout << num << endl;
}
return 0;
}