In C

Knights There are several knights on a chessboard and you are to determine how many squares they are guarding. Write a program that reads positions of knights and prints the number of squares that are guarded by these knights. A square is guarded if it is either occupied by a knight or is reachable by a knight by a single move. A knight move is always by two squares in one direction and by one square ir perpendicular direction. Eg. by two squares in horizontal direction and by one square in vertical direction. 4 Example of input: cle2 Corresponding output: 10 Example of input: cie2d4c717h6 Corresponding output: 30 30