订阅以下载
X TO THE POWER OF Y

I was able to use Allon's hints to come up with an even better solution at 5/268/9
tricks: Jumping takes a lot of power, so don't jump, instead just let the whole program loop. Use @ to set an initial condition state.

Great! Thanks! First attempt: 8/623/14

Fun! My (first) solution is clearly an inferior one, but hey, it's mine: 10/1.1K/21: two MC6000s; the first takes the base and sends it to the second, then keeps the exponent for itself; the first prompts the second to iterate the multiplication as it decrements the exponent and then sends the final result when it gets to 0. The only reason I needed an MC6000 for the first chip was that I needed more lines of code for it. Time to see what others did, I'm sure I have a lot to learn. I also have an idea for my own puzzle now...

score: 5/320/9
components: MC4000X, 200P-14
tricks: use ROM for counter , use ROM address pin for X storage , hook up both input and output to one of the pins so you can use both tricks

I found a 7 / 268 / 9 solution that use a ROM to iterate and identify how many remaining steps to go
https://psteamcommunity.yuanyoumao.com/sharedfiles/filedetails/?id=3016494638

Although I also had a solution with a RAM , I thought I still need two MC's to take track of all the values. Turns out, one MC and a RAM will also do the trick.
Improved to a 7/373/13 or a 7/349/14

thanks!
7/427/14
very unoptimized solution that abuses RAM for iteration count

Fun little puzzle, thanks!
My first shot: 8/678/15