HackerRank Mod Divmod problem solution in Python

HackerRank Mod Divmod problem solution in Python – In this Mod Divmod solution, we need to develop a Python program that can read an integer input containing two lines. And then we need to print the division and module operator on the output screen.

Task
Read in two integers, a and b, and print three lines.
The first line is the integer division a//b (While using Python2 remember to import division from __future__).
The second line is the result of the modulo operator: a%b.
The third line prints the divmod of a and b.

HackerRank Mod Divmod problem solution in Python 2.

a = int(raw_input())
b = int(raw_input())
print a/b
print a%b
print divmod(a,b)

Mod Divmod problem solution in Python 3.

# Enter your code here. Read input from STDIN. Print output to STDOUT
print('{0}n{1}n({0}, {1})'.format(*divmod(int(input()), int(input()))))

Problem solution in pypy programming.

# Enter your code here. Read input from STDIN. Print output to STDOUT
from __future__ import division

a = input()
b = input()
print a//b
print a%b
print divmod(a,b)

Problem solution in pypy3 programming.

# Enter your code here. Read input from STDIN. Print output to STDOUT
a = int(input())
b = int(input())

print(a//b)
print(a%b)
print(divmod(a,b))