hdu 2010 水仙花数

和poj格式稍稍不同；

#include <cstdio>#include <cmath>#include <iostream>#include <cstring>#include <algorithm>#include <queue>#include <stack>#include <vector>#include <map>#include <numeric>#include <set>#include <string>#define INF 0x3f3f3f3ftypedef long long LL;using namespace std;int m,n;bool shui(int x){    int s=0,y=x;    while (y){        s+=(y%10)*(y%10)*(y%10);        y/=10;    }    if (x==s) return true;    else return false;}int main(){    while (~scanf ("%d%d",&m,&n)){        int k=1,q=0;        for (int i=m;i<=n;i++)        {            if (!q&&shui(i)) {printf ("%d",i);q=1;k=0;continue;}            if (shui(i)) {printf (" %d",i);k=0;}        }        printf (k?"no\n":"\n");    }return 0;}