304 North Cardinal St.
Dorchester Center, MA 02124
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.
Integers a, b, c, and d are given on four separate lines, respectively.
Print the result of a^b + c^d on one line.
9 29 7 27
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.
a=int(input()) b=int(input()) c=int(input()) d=int(input()) print a**b+c**d
# Enter your code here. Read input from STDIN. Print output to STDOUT a,b,c,d = (int(input()) for _ in range(4)) print (pow(a,b)+pow(c,d))
a = int(raw_input()) b = int(raw_input()) c = int(raw_input()) d = int(raw_input()) print a**b + c**d
# Enter your code here. Read input from STDIN. Print output to STDOUT a=int(input()) b=int(input()) c=int(input()) d=int(input()) print(pow(a,b)+pow(c,d))
In our experience, we suggest you solve this Integers come in all sizes Hacker Rank Solution and gain some new skills from Professionals completely free and we assure you will be worth it.
I hope this Integers come in all sizes Hacker Rank Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Hacker Rank, Leetcode, Codechef, Codeforce Solution.
This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.
More Hacker Rank Problem & Solutions >>