编程介的小学生
2017-05-03 05:37
采纳率: 92.7%
浏览 1.0k
已采纳

Last Digit

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.

Input

In each test case you have a string S (1 <= |S| <= 1000000), all characters in the string are lowercase.

Output

For each test case print the last nonzero digit.

Sample Input

aaba
aaabababababa
abbzazzazzalzalzzaaaaazlalzaazlalzla
w
Sample Output

4
7
8
1
Hints

For example for the first test case the permutation are:
aaab
aaba
abaa
baaa

  • 写回答
  • 关注问题
  • 收藏
  • 邀请回答

1条回答 默认 最新

相关推荐 更多相似问题