PROBLEM LINK:
Practice
Contest: Division 1
Contest: Division 2
Contest: Division 3
Contest: Division 4
Author: pranjali_07
Tester: raysh07
Editorialist: iceknight1093
DIFFICULTY:
280
PREREQUISITES:
None
PROBLEM:
In a neighborhood, there are two sectors - one with N people and the other with M.
Each person in the first sector hands out X treats, each in the second hands out Y.
What’s the total number of treats a single person can receive by visiting everyone?
EXPLANATION:
The first sector has N people handing out X treats each, for a total of N\cdot X treats.
The first sector has M people handing out Y treats each, for a total of M\cdot Y treats.
The total number of treats is their sum, that is
N\cdot X + M\cdot Y
TIME COMPLEXITY
\mathcal{O}(1) per testcase.
CODE:
Editorialist's code (Python)
n, m = map(int, input().split())
x, y = map(int, input().split())
print(n*x + m*y)