C++ :: Number Of Permutations

We are considering a word C containing only lowercase. An anagram of the word C is a word formed by the letters of C in another order eventually. E.g.

'armata' is an anagram of the word 'tamara'
but 'maree' is not an anagram of the word 'amare'
A word is an angram of itself.

Determine the number of different anagrams that a word has. Because this number may be very high, there will be posted its decomposition into prime numbers

The input file anagrame.in contains the word C.

The output file anagrame.out will contain the decomposition into prime numbers of the number of anagrams of the word C. On each line there will be a prime factor followed by one space and then its multiplicity(power). The factors will be written in ascending order.

0 < the length of the word <= 1000

e.g
anagrame.in
amar

anagrame.out
2 2
3 1

anagrame.in
informatician

anagrame.out
2 7
3 4
5 2
7 1
11 1
13 1