DCP-30: Count It Back to All Problems

Beginner Beginners Problems > Ad-hoc


In this problem you have to count the letters in a string and print the count. For this problem always consider the string will only contain lowercase English letters that is ‘a’ to ‘z’ only. So there is no space or other invalid character in input. You have to count the frequency of each letter and print the frequency along with the letter. If any letter has zero frequency (zero occurrences) then you should skip printing it. Input: ------ First line of the input will consist of an integer which represent the test case **T (0 < T<= 30)**. Each test case contains a string of only lower case English letters. You can assume the length of the string will be no greater than 100 characters. Output: ------- For each test case first print the test case number as “**Case X:**” where **X** is the test case number. Then print the frequencies of each letter. Each letter should be printed in a line with the format, “**A B**”. Where **A** is the letter and **B** is the frequency. Any frequency of 0 should be avoided from printing. You should print the list in ascending order of the letter that is you should print frequency of ‘a’ first then ‘b’, then ‘c’ up to ‘z’. Sample Input ------------ 3 blabla dragon thisishasan Sample Output ------------- Case 1: a 2 b 2 l 2 Case 2: a 1 d 1 g 1 n 1 o 1 r 1 Case 3: a 2 h 2 i 2 n 1 s 3 t 1


Problem Setter:

MD. Jalal Uddin

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# 2.00
Go 2.00
Java 2.00
JavaScript 2.00
Objective-C 2.00
Perl 2.00
PHP 2.00
Python 2.00
Python3 2.00
Ruby 2.00
VB.Net 2.00

Problem Stats

253/444

Solve/Submission

Ranking

# User Language Timing
01 arifkhan Cpp 0.00s
02 shawon100 Cpp 0.00s
03 zitul_mahmud Cpp14 0.00s
04 MAHRahat Cpp14 0.00s
05 CLown1331 Cpp14 0.00s
06 Saimum_140128 Cpp14 0.00s
07 Alamgir_Hossain Cpp14 0.00s
08 emrul Cpp14 0.00s
09 sherina Cpp 0.00s
10 ronok_cse Cpp14 0.00s
11 Masum_ice Cpp14 0.00s
12 t0whid Cpp14 0.00s
13 maxhasan Cpp14 0.00s
14 gazi93 Cpp14 0.00s
15 Najat Cpp14 0.00s
16 joy25896 Cpp14 0.00s
17 The_Viper Cpp14 0.00s
18 Aman_khan Cpp14 0.00s
19 deder Cpp14 0.00s
20 wizard Cpp 0.00s
21 rakibul1415 Cpp14 0.00s
22 pulak_ict_mbstu Cpp14 0.00s
23 linkon Cpp 0.00s
24 Peregrine_Falcon Cpp14 0.00s
25 afzalul Cpp14 0.00s
26 giash_uddin Cpp14 0.00s
27 Light_Yagami407 Cpp14 0.00s
28 Sabyasachi Cpp14 0.00s
29 mrinmoi Cpp14 0.00s
30 abd007 Cpp14 0.00s
31 junayedmahmud Cpp14 0.00s
32 Tanvirh Cpp 0.00s
33 anik_JU Cpp14 0.00s
34 AlaminJust Cpp14 0.00s
35 leenaiitju Cpp 0.00s
36 gulzar Cpp14 0.00s
37 neel71 C 0.00s
38 nurul_islam Cpp14 0.00s
39 jualahmed Cpp14 0.00s
40 return_SS Cpp14 0.00s
41 Sayma_COU Cpp 0.00s
42 terminator_c Cpp14 0.00s
43 Ashish972 Cpp14 0.00s
44 mahamud_BU Cpp14 0.00s
45 golapraj Cpp14 0.00s
46 Kira Cpp14 0.00s
47 ammasum Cpp14 0.00s
48 SakibAlamin Cpp14 0.00s
49 nazmul_bzs Cpp14 0.00s
50 DynamicOvi Cpp 0.00s
Feedback

Your feedback is our precious!



Or call +88 02 9853138 for support