PROBLEM LINK:
Contest Division 1
Contest Division 2
Contest Division 3
Contest Division 4
Setter: Srikkanth R
Tester: Abhinav Sharma, Manan Grover
Editorialist: Lavish Gupta
DIFFICULTY:
Cakewalk
PREREQUISITES:
None
PROBLEM:
Chef has invented 1-minute Instant Noodles. As the name suggests, each packet takes exactly 1 minute to cook.
Chef’s restaurant has X stoves and only 1 packet can be cooked in a single pan.
How many customers can Chef serve in Y minutes if each customer orders exactly 1 packet of noodles?
EXPLANATION:
Because Chef has X stoves and only 1 packet can be cooked in a single pan, Chef can serve X customers in one minute, given that each customer orders exactly 1 packet of noodles.
Therefore, in Y minutes, Chef can server X \cdot Y customers.
TIME COMPLEXITY:
O(1) for each test case.
SOLUTION:
Editorialist's Solution
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll ,ll>
using namespace std ;
const ll z = 998244353 ;
int main()
{
int x , y ;
cin >> x >> y ;
cout << x*y << endl ;
return 0;
}