HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Chapter 3. Repetition structures > problem:


06. X to the power of Y

Volume problems

• Sum until 0
• Sum less than N
• Sum of N numbers
• The power of 2
• 01. How many digits?
• 02. How many divisors?
• 04. Train
• 05. Factorial
• 06. X to the power of Y
• 07. Fibonacci Series
• 08. Binary to decimal
• 09. Decimal to binary
• 10. Maximum
• 11. Perfect numbers
• 12. Wonder primes
• 13. Round numbers
• 14. Tower of Happiness

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 1000/1000/1000/1000 ms. Memory limit 65000/65000/65000/65000 Kb.

Problem description

Write a program that computes X raised to the power Y (XY) where X and Y are both integer numbers and Y is non-negative. X is the base (mantissa) and Y is the exponent value.
To get the result we have to multiply X, Y times. For example for X=5 and Y=3, the result will be 5*5*5 = 125.

Input

There are two integers X and Y on the first line of input (0 ≤ Y, |XY| < 263 ).

Output

Write value of XY.

Example

stdin stdout

3 2

9

Для отправки решений необходимо выполнить вход.

www.contester.ru