Thursday, 21 February 2013

PROBLEM #2


Here is your second problem DCLites.

Ever wondered about longest words in english(or any other long sequences) and about counting the number of distinct characters and frequency of those characters in that word or sequence?

Let us take example of this one of  the longest words in english

‘Pneumonoultramicroscopicsilicovolcanoconiosis’

Seems to be onerous task  to count the repititions of ‘a’,’o’,’c’ and etc. in this rubbbish lung disease ! But for your computer processors it is not so,so use it.


Problem Statement:

You have to take string or a number sequence or a combination of both  as input and have to output the frequency of diifferent characters or numbers in the input.



New Submission Rule:
1.Send your solutions as a zip(or rar) file to us.
Your rar file should have name in this format, "your dclid_problem_number".For example:
if participant with dclid 'DCLHS201' is sending its solution for 'Problem 2' to us then rar file should have name in this  format "DCLHS201_problem_2.rar".
2.Don't write your source code in the body of mail and don't send us your source code in .doc file.Source code files must be in their respective extensions.E.g : for a C++ file .cpp,C# file .cs and so  is for other languages.

Sample: