I have a problem with solving this problem...

Question

There is a program to write this: when I input some natural numbers X, N and K, then I have to find the last K digits of number X^N.
Now, I don't really know how to store those K digits and then print them...

Answer 1

I would do smthg like :

#include <string> std::string s = std::to_string(X^N);

Then take the last K characters of that string

Answer 2

Hi. First you have to calculate x^n by pow (x,y) and save it in string format then if it lengths is equal or grather than k return this section by substr(savedStr.length-k.length) function.

Answer 3

Thank you both. I solved this with for-loop like for(int i = 0; i < K; i++) {
F[i] = number % 10;
number /= 10;
reversednumber = reversednumber * 10 + F[i];
}
The name number is actually that X^N.
Then I converted that reversednumber into string and reversed it again, because of loaded zeros. It works for me perfectly. Maybe it is a bit complicated but it works haha.

Answer 4

As long as you understand what you did and why you did it it's perfectly fine (at first) we all got our own way of thinking and that's why there is a bunch of way to resolve the same problem
But sharing your code and/or coding with other is a good way to improve one skill and learn new ways to improve and optimize one's code (never forget that coding means we have to evolve constantly)