Page 1 of 1

### 2537 - Assassins of the Three Kingdoms

Posted: Sat Oct 05, 2013 6:14 pm

### Re: 2537 - Assassins of the Three Kingdoms

Posted: Sun Oct 06, 2013 12:42 am
The goal is to count the number of permutations in which Pavel chooses first than other players who wants the same card that him, right?

### Re: 2537 - Assassins of the Three Kingdoms

Posted: Sun Oct 06, 2013 1:31 am
Hola:

He probado mi codigo con diferentes test cases, y aun asi siguo obteniendo WA. Quisiera saber si existe algun caso de prueba especial.
Input:
• 5
3
1 2 1
4
1 2 3 1
4
1 1 1 1
5
1 2 1 1 1
8
1 2 3 4 5 6 7 8
Output:
• 3
12
6
30
40320

### Re: 2537 - Assassins of the Three Kingdoms

Posted: Sun Oct 06, 2013 11:45 am
Prueba usando:
input:
1
3
0 0 1

output
3

ok, fixed

### Re: 2537 - Assassins of the Three Kingdoms

Posted: Sun Oct 06, 2013 9:20 pm
Supuse que:
T=1 del test case que me mencionas.
Debido a que el problema especifica que N (2 <= N <= 8)

input:
• 1
3
0 0 1
Output:
• 3
Me da la soluciĆ³n que me mencionas.