Integers Come In All Sizes in Python - HackerRank Solution

Integers Come In All Sizes in Python - HackerRank Solution
Integers Come In All Sizes in Python - HackerRank Solution


Problem :


Integers in Python can be as big as the bytes in your machine's memory. There is no limit in size as there is: 2^31 - 1 (c++ int) or 2^63 - 1 (C++ long long int).
As we know, the result of a^b grows really fast with increasing b.
Let's do some calculations on very large integers.

Task :
Read four numbers, a, b, c, and d, and print the result of a^b + c^d.



Input Format :

Integers a, b, c, and d are given on four separate lines, respectively.

Constraints :

  • 1 <= a <= 1000
  • 1 <= b <= 1000
  • 1 <= c <= 1000
  • 1 <= d <= 1000

Output Format :

Print the result of  a^b + c^d on one line.



Sample Input :

9
29
7
27

Sample Output :

4710194409608608369201743232

Note: This result is bigger than 2^63 - 1. Hence, it won't fit in the long long int of C++ or a 64-bit integer.



Solution :


 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
# Integers Come In All Sizes in Python - Hacker Rank Solution
# Python 3
# Enter your code here. Read input from STDIN. Print output to STDOUT
# Integers Come In All Sizes in Python - Hacker Rank Solution START
A = int(input())
B = int(input())
C = int(input())
D = int(input())

print((A**B)+(C**D))
# Integers Come In All Sizes in Python - Hacker Rank Solution END





Disclaimer :-
the above hole problem statement is given by hackerrank.com but the solution is generated by the codeworld19 authority if any of the query regarding this post or website fill the following contact form thank you.

Next Post Previous Post
No Comment
Add Comment
comment url