💻💻💻💻CHALLENGE💻💻💻💻

Question

Suppose x is a number.x is called 'n-Capricus' if the last n digits of x powers to x.
Eg. 625 : 25 last two digit and square(25)=625 hence '625 is 2-Capricus' n=2;
625 is also a 1-capricus as 5^4=625
25: 5 is last digit and square(5)=25 hence 1-Capricus
64 4 is last digit and cube(4)=64 hence 1-Capricus.

Write a program that accepts a numbers and checks if its a Capricus and prints n.

Answer 1

https://code.sololearn.com/cF9MFW79n7rL/?ref=app

Answer 2

Suppose x is a number.x is called 'n-Capricus' if the last n digits of x powers to n.
//might here n in place of x
//btw U must post it as an assignment in lesson factory

Answer 3

I googled Caprirus numbers but I didn't find anything about them. I just wanted to find more numbers. Anyway it works well with numbers 625 , 25 and 64 😃

https://code.sololearn.com/co5u8Pk4eEc5/?ref=app

Answer 4

gaurav agrawal I have posted it

Answer 5

no my teacher gave it as an assignment.

Answer 6

https://code.sololearn.com/c38j0UIvfqC0/?ref=app
FINALLY DONE😊😊😊😊

Answer 7

https://code.sololearn.com/chVNHmc82135/?ref=app

Answer 8

Thanks for the challenge, Neelarghya Kundu! It was fun to code for a beginner like me!

Here is my piece (Python): https://code.sololearn.com/cj5a5g49j0H8/#py