Problem2266--Distinct Strings

2266: Distinct Strings

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MB

SubmitSolved: 3Submit Num: 5Statistics

Description

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : 100100 points

Problem Statement

You are given a string SS of length 33 consisting of lowercase English letters.
How many different strings can be obtained by permuting the characters in SS?

Constraints

  • SS is a string SS of length 33 consisting of lowercase English letters.

Input

Input is given from Standard Input in the following format: 
SS

Output

Print the number of different strings that can be obtained by permuting the characters in SS.

Sample Input Copy 

aba

Sample Output Copy 

3

HINT

By permuting the characters in S=S= aba, three different strings can be obtained: aab, aba, baa.

Source/Category

AtCoder 
Submit