Struggling with c++ math related issue

Hey there everybody,
Hope you are well ! First time posting here as i am somewhat new to the programming world. I am currently using C++ and wish to write a code for the following issue. Please study the below and let me know of your thoughts and how you would approach this. Many thanks in advance for having a look.
Kindest Regards

I wish to write down a code which would assist me in finding all the 8 digit numbers that when their each individual digit gets raised on a power (any power) and then summed the initial number would occur. The individual digits would all be raised on the same value power.

Looking forward to your responses on this.

So is this a maths question or a programming question?

For example,

Code:

---

int target_number = 12345678;
int digits[8];

---

Can you code something to get to
digits[0] = 1
digits[1] = 2
etc?

Well actually its a math related, programming issue.

So can you manage the first step or not?

You're not going to get a complete answer, so you're going to have to meet us half way.

I've suggested a first step, let's see how far you can get by yourself before you get stuck.
Then we can answer specific questions.

> Well actually its a math related, programming issue.
Do you know how to solve the problem on paper?
No - it's a maths problem.
Yes - it's a programming problem.

There is no point showing you code if you've no idea how to solve it on paper.

To be honest i actually had it solved on paper way before i posted this hehe. I am now close to finding a way on C++ too. If i require any extra assistance i shall inform although i think i got this on my own.