HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Unsorted > problem:


X to the power of Y

Section problems

• Tetris 3D
• Bit Decoder
• Knights of the Rook
• Coins
• Primes
• Providers
• A to the power of B
• A Palace with Many Columns
• X to the power of Y
• A+B
• T-shirts
• SAME OR DIFFERENT
• GCF
• REVERSE ORDER OF WORDS
• Factorial
• Maximum
• Name-Surname

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