KAMIL - Kamil

no tags 

Some kids cannot pronounce all letters, some of them they sometimes pronounce correctly and sometimes incorrectly. Kamil sometimes says T instead of K, but he never says K instead of T. Similarly he sometimes says D instead of G. Instead of R he sometimes says L and sometimes F. Of course it happens that he pronounces the letter correctly. Kamil's father always thinks how many words can mean the word spoken by his son (it doesn't matter if they are real English words).

Task

Write a program which

  • reads from standard input the words spoken by Kamil
  • counts how many different words can that mean
  • writes the outcome on standard output

 

Input

Ten test cases (given one under another, you have to process all!). Every test case is a single line - a word spoken by Kamil. Only 26 capital leters are used. The length of the word is at most 20.

Output

For every testcase write an integer in a single line with a single integer, denoting the number of words which Kamil's word can mean.

Score

The score awarded to your program is the number of bytes the source code you submit. The fewer points you score, the better. Submissions are not allowed to exceed 256 bytes.

Remark. It may turn out impossible to solve this problem in some languages.

Example

Input:
FILIPEK
[and 9 test cases more]

Output:
4
[and 9 test cases more]


hide comments
shashank: 2013-07-23 08:49:55

First program in python!!
WOOOPPPPPPPPPPPPPPPPPPPPPP..

Vaibhav Yenamandra: 2013-07-16 19:05:10

Damn! its so hard to get Perl to go under 28 in this!!

rfczzz: 2013-07-01 07:58:09

101b in C# - How is it possible??

(Tjandra Satria Gunawan)(曾毅昆): 2013-06-29 05:48:27

Yeah! 168B in BF language! ;-)

VV: 2013-05-23 05:44:50

This bug seems to be present in couple of more problems! DDATE and SIZECON are some I am aware as of now.

Mitch Schwartz: 2013-05-23 04:08:31

There's some bug, and it's been reported to SPOJ admins. Top score of 0 always makes it so nobody gets any points, but those solutions will be rejudged or disqualified once the bug has been fixed so things can return to normal. Thanks for your patience.

Ouditchya Sinha: 2013-05-23 03:22:04

How is a '0' score possible???
The solver James Woodpecker didn't get the 3 points for best solution & my points were reduced. Weird...

Last edit: 2013-05-23 03:25:04
Mostafa 36a2: 2012-08-24 13:20:12

Is Thats right :
TDLF______16
MOSTAFA____4
WHAT_______2

Last edit: 2012-08-24 14:38:44
Venkatesh Ganesan: 2012-04-29 15:53:06

Last edit: 2012-04-29 15:56:05
eXerigumo Clanjor: 2012-04-09 11:17:07

I've made it into 22B, wondering if I can make it into 20B.

Last edit: 2012-04-09 12:00:03

Added by:Adam Dzedzej
Date:2004-06-08
Time limit:3s
Source limit:256B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS OBJC PERL6 SQLITE VB.NET
Resource:Internet Contest Pogromcy Algorytmow (Algorithm Tamers) Round I, 2003