- 2

Can you help me?

Write a program that uses your function to culculate how many times give letter meets int the given sequesnce. Use Š”-style string (without string library). The length of the string is not more that 20 symbols. You have to perform developed function N times. Note:Use pointers. Input: First line contains N(1<=N<=100). Then N lines are given in the following format : "one char" a space and that char array. Output: N lines in the following format: < number of occurrence > < character itself > in < given string > Samples: ā„– Input Output 1 2 a abracadabra b babaluba 5 a in abracadabra 3 b in babaluba

16th Oct 2020, 1:07 PM
Nurlan
Nurlan - avatar
1 Answer
0
Š¢Ń‹ ŠæŠ¾Ń…Š¾Š“у Š¾Š±Š»Š¾Š¼Š°Š»ŃŃ Š“Š°Š¶Šµ Š½Š¾Ń€Š¼Š°Š»ŃŒŠ½Š¾ сŠŗŠ¾ŠæŠøрŠ¾Š²Š°Ń‚ŃŒ?
17th Oct 2020, 8:24 PM
Rustam Yumagujin
Rustam Yumagujin - avatar