01
02
03
04
05
06
07
08
09
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
 
package algs51; // section 5.0
import stdlib.*;
/* ***********************************************************************
 *  Compilation:  javac Count.java
 *  Execution:    java Count alpha < input.txt
 *
 *  Create an alphabet specified on the command line, read in a
 *  sequence of characters over that alphabet (ignoring characters
 *  not in the alphabet), computes the frequency of occurrence of
 *  each character, and print out the results.
 *
 *  %  java Count ABCDR < abra.txt
 *  A 5
 *  B 2
 *  C 1
 *  D 1
 *  R 2
 *
 *  % java Count 0123456789 < pi.txt
 *  0 99959
 *  1 99757
 *  2 100026
 *  3 100230
 *  4 100230
 *  5 100359
 *  6 99548
 *  7 99800
 *  8 99985
 *  9 100106
 *
 *************************************************************************/



public class Count {
  public static void main(String[] args) {
    Alphabet alpha = new Alphabet(args[0]);
    int R = alpha.R();
    int[] count = new int[R];
    String a = StdIn.readAll();
    int N = a.length();
    for (int i = 0; i < N; i++)
      if (alpha.contains(a.charAt(i)))
        count[alpha.toIndex(a.charAt(i))]++;
    for (int c = 0; c < R; c++)
      StdOut.println(alpha.toChar(c) + " " + count[c]);
  }
}