![](https://img-blog.csdn.net/20150314133922171?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvbHVja2lseXdt/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center)
#include<cstdio>
#include<cmath>
using
namespace
std;
int
main()
{
int
n, m, i, x;
while
(
scanf
(
"%d %d"
,&n,&m)!=EOF)
{
if
(n == 0 && m == 0)
break
;
int
flag = 0, k = 0, a[1001];
for
(i = n; i <= m; i++)
{
x = i;
int
sum = 0;
while
(x)
{
sum = sum +
pow
(x % 10, 3);
x = x / 10;
}
if
(sum == i)
{
flag = 1;
a[k++] = i;
}
}
if
(flag != 0)
{
for
(i = 0; i < k; i++)
printf
(
"%d "
, a[i]);
printf
(
"\n"
);
}
else
if
(flag == 0)
printf
(
"no\n"
);
}
}
这道题就是一个基本的取模与计算并判断问题