水仙花数

代码:

 1 #include <iostream>
 2 #include <string>
 3 using namespace std;
 4 
 5 #define MaxSize 100
 6 
 7 void judgefun(int m,int n)
 8 {
 9     int flag=false;
10     int k;
11     for(k=m;k<=n;k++)
12     {
13         int bit1;
14         int bit2;
15         int bit3;
16 
17         bit1=k%10;
18         bit2=k/10%10;
19         bit3=k/100;
20 
21         int tempans;
22         tempans=bit1*bit1*bit1+bit2*bit2*bit2+bit3*bit3*bit3;
23         if(tempans==k)
24         {
25             cout<<k<<" ";
26             flag=true;
27         }
28     }
29     if(!flag)
30     {
31         cout<<"no"<<endl;
32     }
33 }
34 
35 
36 int fun(string s)
37 {
38     int m=0;
39     int n=0;
40 
41     m=m*10+s[0]-'0';
42     m=m*10+s[1]-'0';
43     m=m*10+s[2]-'0';
44 
45     n=n*10+s[4]-'0';
46     n=n*10+s[5]-'0';
47     n=n*10+s[6]-'0';
48 
49     judgefun(m,n);
50     return 0;
51 }
52 
53 
54 
55 int main()
56 {
57     string str[MaxSize];
58     int count=0;
59     string temp;
60     while(getline(cin,temp))
61     {
62         str[count]=temp;
63         count++;    
64     }
65 
66 
67 
68     for(int i=0;i<count;i++)
69     {
70         fun(str[i]);
71     }
72     
73     
74     system("pause");
75     return 0;
76 }

运行截图:

posted @ 2015-09-10 17:27  vpoet  阅读(122)  评论(0)    收藏  举报