UVa 10008

From Algorithmist
Jump to: navigation, search

10008 - What's Cryptanalysis?[edit]

Summary[edit]

Given lines of string, count the number of occurrences of A to Z, ignoring case.

Explanation[edit]

Go through each line, and increment if it's within the range. Sort the characters afterwards. Trivial String and Sorting problem.

Input[edit]

3
This is a test.
Count me 1 2 3 4 5.
Wow!!!!  Is this question easy?

Output[edit]

S 7
T 6
I 5
E 4
O 3
A 2
H 2
N 2
U 2
W 2
C 1
M 1
Q 1
Y 1

Solutions[edit]

http://codealltheproblems.blogspot.com/2015/06/uva-10008-whats-cryptanalysis.html