DCP-59: Permutation Back to All Problems

Easy Math > Counting

You are given a string. You have to answer how many permutations are possible of that string. Suppose the string is "aab", then the 3 possible permutations are "aab", "aba" and "baa". Input: ------ Input starts with an integer **T (1<=100000)**, denoting the number of test cases. Each of next T lines describes a new test case. Each case contains a string of lower case letters not more than 20 characters. Output: ------- You should output T lines each of which indicates the answer for the corresponding query. Check the sample output for clarification. Sample Input ------------ 2 ab aab Sample Output ------------- 2 3

Problem Setter:

Feroz Ahmmed

Please login to submit solution to this problem.

Problem Limits

Language Time Limit (seconds)
C/C++ 1.00
Java 2.00
C# 2.00
PHP 2.00

Problem Stats




# User Language Timing
01 anik_JU Cpp 0.04s
02 tariqiitju Cpp 0.06s
03 mahrahat Cpp 0.07s
04 Indro_BU Cpp 0.07s
05 noshin_ju Cpp 0.07s
06 smriad Cpp 0.13s
07 Core_i14 Cpp 0.14s
08 sadia2427 Cpp 0.14s
09 emrul Cpp 0.15s
10 a_rahman Cpp 0.17s
11 onucsecu Cpp 0.19s
12 nazmul_bzs Cpp 0.20s
13 haasib Cpp 0.21s
14 Ansarul_14 Cpp 0.26s
15 seyedssz Cpp 0.30s
16 ammasum Cpp 0.36s
17 Masum_ice Cpp 0.50s
18 moshiur_cse15 Cpp 0.61s
19 rayhan50001 Cpp 0.70s
20 7Mahfuz Cpp 0.74s
21 subhashis_cse Cpp 0.80s
22 duronto20 Cpp 0.81s
23 mahbub07 Cpp 0.82s
24 jualahmed Cpp 0.84s
25 rana_cse Cpp 0.98s
26 mhsjaber CSharp 1.03s
27 jabir_hstu Cpp 1.13s
28 ImagineWarrior Cpp 1.22s
29 froghramar Cpp 1.36s
30 ahqmrf Cpp 1.38s
31 Zayed Cpp 1.58s
32 Mahir Cpp 1.60s
33 imunir Cpp 1.60s
34 Pabon_SEC Cpp 1.61s
35 smjlord068 Cpp 1.62s
36 faisalxn Cpp 1.63s
37 arsho Cpp 1.68s
38 Ihtiaz Cpp 1.70s
39 fsshakkhor Cpp 1.79s
40 nsbzhd Cpp 1.97s
41 math10 Cpp 2.02s
42 mamun4122 Cpp 2.07s
43 sumon23 Cpp 2.14s
44 Skyfall009 Cpp 2.17s
45 rofi93 Cpp 2.19s
46 Koushik_12 Cpp 2.19s
47 mtmohim Cpp 2.20s
48 Mahmudul_Tushar Cpp 2.20s
49 mrz_Rafsanjani Cpp 2.23s
50 WronggAnswer Cpp 2.25s

Your feedback is our precious!

Or call +88 02 9853138 for support