DCP-221: Maximum and Minimum Back to All Problems

Beginner Beginners Problems > Ad-hoc


Ashik is a little boy. He is curious about how to find maximum and minimum number from a list of numbers. But he is unable to find it. So he needs your help to find out the maximum and minimum number. Now it is your task to create a program that can help ashik. Input: ------ First line contains an integer T(1<=T<=100) denoting the number of test cases.The following T lines contain a list of positive integer numbers. There are at least 2 numbers and at most 50 numbers are in the list. Numbers are seperated by a single space. There are at most 3 digits in each number of the list. Output: ------- For each test case print the case number first and then print how many numbers on that list and the maximum and minimum number of the list. See the sample output for more details. Sample Input ------------ 3 12 783 2 916 46 5 7 189 29 67 892 6 7 8 190 56 289 34 177 182 67 2 Sample Output ------------- Case 1: Among 9 numbers 916 is maximum and 2 is minimum Case 2: Among 11 numbers 892 is maximum and 6 is minimum Case 3: Among 2 numbers 67 is maximum and 2 is minimum


Problem Setter:

Md.Ashraful Islam Shohag

Please login to submit solution to this problem.

Problem Limits

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

Problem Stats

251/541

Solve/Submission

Ranking

# User Language Timing
01 shamiul_pust Cpp14 0.00s
02 anowar1112 Cpp14 0.00s
03 rana_cse Cpp14 0.00s
04 inzamamdu Cpp14 0.00s
05 cse_nazmul Cpp14 0.00s
06 ash12 Cpp14 0.00s
07 Koushik_12 Cpp14 0.00s
08 akib9ctg Cpp14 0.00s
09 Roll_Number_27 Cpp14 0.00s
10 nuhu_iu Cpp14 0.00s
11 duronto20 Cpp14 0.00s
12 nakib_ruet Cpp14 0.00s
13 xpo6 Cpp14 0.00s
14 shawon100 Cpp14 0.00s
15 Titanium_Owner Cpp14 0.00s
16 Unseen Cpp14 0.00s
17 Puja1409 Cpp14 0.00s
18 Gang_Of_Three_01 Cpp14 0.00s
19 Jubayer_Hasan Cpp14 0.00s
20 sakib_ruet_13 Cpp14 0.00s
21 ssavi Cpp14 0.00s
22 absa1am Cpp14 0.00s
23 badhansen123 Cpp14 0.00s
24 subhashis_cse Cpp14 0.00s
25 aseem_cu Cpp14 0.00s
26 codebreaker007 Cpp14 0.00s
27 yakin Cpp14 0.00s
28 Nazmul_WUB Cpp14 0.00s
29 mamunparvez Cpp14 0.00s
30 zyyxxx Cpp14 0.00s
31 Jisancse Cpp14 0.00s
32 emrul Cpp14 0.00s
33 rifat_cse Cpp14 0.00s
34 FahimSifnatul Cpp14 0.00s
35 tariqiitju Cpp14 0.00s
36 sazal_dev Cpp14 0.00s
37 7Mahfuz Cpp14 0.00s
38 Najat Cpp14 0.00s
39 plab0n Cpp14 0.00s
40 Nur_Alam39 Cpp14 0.00s
41 t0whid Cpp14 0.00s
42 Knight_King Cpp14 0.00s
43 Santho07 Cpp14 0.00s
44 maxhasan Cpp14 0.00s
45 robin_aust Cpp14 0.00s
46 saiful130104 Cpp14 0.00s
47 MRITuhin Cpp14 0.00s
48 prodipdatta7 Cpp14 0.00s
49 joy25896 Cpp14 0.00s
50 Flash_DS Cpp14 0.00s
Feedback

Your feedback is our precious!



Or call +88 02 9853138 for support