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

66/233

Solve/Submission

Ranking

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

Your feedback is our precious!



Or call +88 02 9853138 for support