蓝桥杯 1500: [蓝桥杯][算法提高VIP]分数统计 Easy only once *数位各数字统计和打表问题

#include<iostream>
#include<stdlib.h>
#include<stdio.h>
#include<vector> 
#include<string>
#include<math.h>
#include<algorithm>
#include<cstring>
#include<map>
using namespace std;

vector<int>vec(10);

void init() {
    for (int i = 0; i < vec.size(); i++) {
        vec[i] = pow(i, 5);
    }
}

int main(){
    init();
    for (int i = 2; i < 999999; i++) {
        int cnt = 0;
        int temp = i;
        while (temp!=0){
            cnt += vec[temp % 10];
            temp /= 10;
        }
        if (cnt == i)
            cout << i << endl;
    }
    return 0;
}