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 tariqiitju Cpp 0.06s
02 mahrahat Cpp 0.07s
03 Indro_BU Cpp 0.07s
04 sadia2427 Cpp 0.14s
05 emrul Cpp 0.15s
06 nazmul_bzs Cpp 0.20s
07 haasib Cpp 0.21s
08 seyedssz Cpp 0.30s
09 ammasum Cpp 0.36s
10 Masum_ice Cpp 0.50s
11 moshiur_cse15 Cpp 0.61s
12 rayhan50001 Cpp 0.70s
13 subhashis_cse Cpp 0.80s
14 duronto20 Cpp 0.81s
15 mahbub07 Cpp 0.82s
16 jualahmed Cpp 0.84s
17 rana_cse Cpp 0.98s
18 jabir_hstu Cpp 1.13s
19 ImagineWarrior Cpp 1.22s
20 froghramar Cpp 1.36s
21 ahqmrf Cpp 1.38s
22 Zayed Cpp 1.58s
23 Mahir Cpp 1.60s
24 imunir Cpp 1.60s
25 Pabon_SEC Cpp 1.61s
26 smjlord068 Cpp 1.62s
27 faisalxn Cpp 1.63s
28 arsho Cpp 1.68s
29 Ihtiaz Cpp 1.70s
30 fsshakkhor Cpp 1.79s
31 nsbzhd Cpp 1.97s
32 math10 Cpp 2.02s
33 mamun4122 Cpp 2.07s
34 sumon23 Cpp 2.14s
35 Skyfall009 Cpp 2.17s
36 rofi93 Cpp 2.19s
37 Koushik_12 Cpp 2.19s
38 mtmohim Cpp 2.20s
39 Mahmudul_Tushar Cpp 2.20s
40 mrz_Rafsanjani Cpp 2.23s
41 WronggAnswer Cpp 2.25s
42 darkprinx Cpp 2.26s
43 ssavi Cpp 2.29s
44 codehead Cpp 2.31s
45 rafsan_rana Cpp 2.32s
46 shivazi Cpp 2.33s
47 shuvo_iu Cpp 2.45s
48 ih_hira Cpp 2.52s
49 murad_al_wajed Cpp 2.57s
50 sahedsohel Cpp 2.73s

Your feedback is our precious!

Or call +88 02 9853138 for support