求任意位数的水仙花数

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

bool isRight(int n){
    vector<int> v;
    int sum = 0, tmp = n;
    while (tmp)
    {
        v.push_back(tmp % 10);
        tmp /= 10;
    }
    for (unsigned i = 0; i < v.size(); i++)
    {
        sum += (int)pow(v[i],v.size());
    }
    return n == sum;
}

int main()
{
    int n;
    cin >> n;
    for(int i = pow(10, n-1); i < pow(10, n); i++)
        if(isRight(i)) cout<<i<<endl;
    return 0;
}

或者扫描到n的水仙花数打印

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

bool isRight(int n){
    vector<int> v;
    int sum = 0, tmp = n;
    while (tmp)
    {
        v.push_back(tmp % 10);
        tmp /= 10;
    }
    for (unsigned i = 0; i < v.size(); i++)
    {
        sum += (int)pow(v[i],v.size());
    }
    return n == sum;
}

int main()
{
    int n;
    cin >> n;
    for(int i = 0; i < pow(10, n); i++)
        if(isRight(i)) cout<<i<<endl;
    return 0;
}