1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
import java.util.Scanner;
import java.lang.Math;
public class Main {
public static boolean isNarcissin(int n)
{
int ge = n % 10;
int shi = n / 10 % 10;
int bai = n / 100;
if(Math.pow(ge, 3) + Math.pow(shi, 3) + Math.pow(bai, 3) == n)
{
return true;
}
else
{
return false;
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
int m, n;
boolean flag;
while(in.hasNext())
{
m = in.nextInt();
n = in.nextInt();
flag = false;
for(int i = m; i < n; i++)
{
if(isNarcissin(i))
{
System.out.print(i + " ");
flag = true;
}
}
if(flag == false)
{
System.out.println("no");
}
}
in.close();
}
}