ZOJ Problem Set - 3108
The number of permutation without repetition that has a string S is so big, but in this problem you just need to print the last nonzero digit of it.
In each test case you have a string S (1 <= |S| <= 1000000), all characters in the string are lowercase.
For each test case print the last nonzero digit.
aaba aaabababababa abbzazzazzalzalzzaaaaazlalzaazlalzla w
4 7 8 1
HintsFor example for the first test case the permutation are:
Source: The 2007 ACM Mexico and Central America Programming Contest