What's+Cryptanalysis

Cryptanalysis is the process of breaking someone else's cryptographic writing. This sometimes involves some kind of statistical analysis of a passage of (encrypted) text. Your task is to write a program which performs a simple analysis of a given text.

Input
The first line of input contains a single positive decimal integer n. This is the number of lines which follow in the input. The next n lines will contain zero or more characters (possibly including whitespace). This is the text which must be analyzed.

Output
Each line of output contains a single uppercase letter, followed by a single space, then followed by a positive decimal integer. The integer indicates how many times the corresponding letter appears in the input text. Upper and lower case letters in the input are to be considered the same. No other characters must be counted. The output must be sorted in descending count order; that is, the most frequent letter is on the first output line, and the last line of output indicates the least frequent letter. If two letters have the same frequency, then the letter which comes first in the alphabet must appear first in the output. If a letter does not appear in the text, then that letter must not appear in the output.

Sample Input
3

This is a test.

Count me 1 2 3 4 5.

Wow!!!! Is this question easy?

Sample Output
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

Source Code code format="java5" import java.util.Arrays;

public class WhatsCryptanalysis { public static void main(String[] args) { String text = "This is a test.\n" + "Count me 1 2 3 4 5.\n" + "Wow!!!! Is this question easy?";

cryptanalysis(text); }

public static void cryptanalysis(String text) { Alphabet[] alphabets = new Alphabet[26];

// ���ĺ� �ʱ�ȭ for(int i = 0; i < alphabets.length; i++) { alphabets[i] = new Alphabet((char)('A' + i)); }

for(int i = 0; i < text.length; i++) { char c = text.charAt(i);

if(Character.isLetter(c)) { c = Character.toUpperCase(c);

alphabets[c - 'A'].increment; }       }

// �������8�� d���Ѵ�. Arrays.sort(alphabets);

// ����Ѵ�. for(Alphabet a : alphabets) { if(a.getCount > 0) { System.out.println(a); }       }    } }

class Alphabet implements Comparable { private char alphabet; private int count;

public Alphabet(char alphabet) { this.alphabet = alphabet; this.count = 0; }

public int getCount { return count; }

public void increment { count++; }

public int compareTo(Alphabet o) { return o.count - count; }

@Override public String toString { return alphabet + " " + count; } } code