DCP-277: Boshir Mishtanno Back to All Problems

Easy Math > Basic Math


"***Boshir Mishtanno***" is a famous sweet's shop in *Shikaripara Bazar*. Younus Madbor is a great man lives in neighbouring village. He came to the shop with his grandson Muhammad to buy some sweets. Muhammad likes sweets a lot, so he told his grandpa to buy a full dish of sweets. On an empty dish **"R"** sweets can be placed in a single column and **"C"** sweets in a single row. The dish is rectangular and Muhammad wants the maximum number of sweets can be placed on it. So a sweet can be placed on another sweets when possible as showed in the figure. ![Figure][1] Now, your task is to calculate the total cost of sweets that Younus Madbor had to expend if the cost of a sweet is **15** taka. Input: ------ Input starts with an integer **T (1<=100)**, denoting the number of test cases. Each case contains two integers **R** and **C** separated by a single space **(1 ≤ R, C ≤ 1000).** Output: ------- For each case of input, output the case number followed by the total cost. See sample input and output for more clarification. Sample Input ------------ 3 3 3 4 2 4 4 Sample Output ------------- Case 1: 210 Case 2: 165 Case 3: 450 [1]: https://s3-ap-southeast-1.amazonaws.com/devskillimagestorage/questionimages/74144737-c04b-c49d-83f1-08d45dae8785_bb3be9456fbd417ca4a6fe62cb4e4c1d_W200xH155.png


Problem Setter:

Jayed Al Hasan

Please login to submit solution to this problem.

Problem Limits

Language Time Limit (seconds)
C 0.50
C++ 0.50
C++14 0.50
C# 1.00
Go 1.00
Java 1.00
JavaScript 1.00
Objective-C 1.00
Perl 1.00
PHP 1.00
Python 1.00
Python3 1.00
Ruby 1.00
VB.Net 1.00

Problem Stats

203/503

Solve/Submission

Ranking

# User Language Timing
01 nuhu_iu Cpp14 0.00s
02 habib_rahman Cpp14 0.00s
03 badhansen123 Cpp14 0.00s
04 abinash Cpp14 0.00s
05 astrolion7 Cpp14 0.00s
06 kazinayeem Cpp14 0.00s
07 maxhasan Cpp14 0.00s
08 Ahb_arif Cpp14 0.00s
09 Hasinur_ Cpp14 0.00s
10 sayedgkm Cpp14 0.00s
11 Mohaimin66 Cpp14 0.00s
12 shaft Cpp14 0.00s
13 kamrulashraf Cpp14 0.00s
14 mno123 Cpp14 0.00s
15 shamimjucse Cpp14 0.00s
16 xpo6 Cpp14 0.00s
17 imranziad Cpp14 0.00s
18 adamantium Cpp14 0.00s
19 kzvd4729 Cpp14 0.00s
20 DynamicOvi Cpp14 0.00s
21 7Mahfuz Cpp14 0.00s
22 PKP_007 Cpp14 0.00s
23 sajib_readdd Cpp14 0.00s
24 lsiddiqsunny Cpp14 0.00s
25 chayan_JU Cpp14 0.00s
26 bafar Cpp14 0.00s
27 RezwanArefin01 Cpp14 0.00s
28 SRS_PBM Cpp14 0.00s
29 onucsecu Cpp14 0.00s
30 Sleep_Mode Cpp14 0.00s
31 a_pramanik Cpp14 0.00s
32 Not_Found0001 Cpp14 0.00s
33 aarifshuvo Cpp14 0.00s
34 simantaturja Cpp14 0.00s
35 ArifKhanShubro Cpp14 0.00s
36 souravvv Cpp14 0.00s
37 lazyfahim Cpp14 0.00s
38 Naweed Cpp14 0.00s
39 Dragon_Curve Cpp14 0.00s
40 Puja1409 Cpp14 0.00s
41 _dipu Cpp14 0.00s
42 rezaulhsagar Cpp14 0.00s
43 Digonta Cpp14 0.00s
44 shipon0142 Cpp14 0.00s
45 Bisnu039 Cpp14 0.00s
46 HR_Habib Cpp14 0.00s
47 ____ Cpp14 0.00s
48 Pure_Protea Cpp14 0.00s
49 Kira Cpp14 0.00s
50 Double_O Cpp14 0.00s
Feedback

Your feedback is our precious!



Or call +88 02 9853138 for support