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

64/224

Solve/Submission

Ranking

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

Your feedback is our precious!



Or call +88 02 9853138 for support