2537 - Assassins of the Three Kingdoms

Discussion around the problems of the COJ.
Forum rules
Remember that posting AC code is not allowed here. If you are going to ask a question or to post a solution, describe your algorithm instead. Posting AC code will be penalized.
Post Reply
User avatar
dovier
Posts: 1143
Joined: 8 years ago
Location: Havana, Cuba
Gender: Male
Cuba

2537 - Assassins of the Three Kingdoms

Post by dovier » 6 years ago




Spartan
Posts: 11
Joined: 8 years ago
Gender: Male
Cuba

Re: 2537 - Assassins of the Three Kingdoms

Post by Spartan » 6 years ago

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?

Centinela
Posts: 2
Joined: 6 years ago
Gender: None specified

Re: 2537 - Assassins of the Three Kingdoms

Post by Centinela » 6 years ago

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

User avatar
EduardoQuintana
Posts: 14
Joined: 8 years ago
Location: Universidad de Cienfuegos (UCf)
Gender: None specified

Re: 2537 - Assassins of the Three Kingdoms

Post by EduardoQuintana » 6 years ago

Prueba usando:
input:
1
3
0 0 1

output
3

ok, fixed
Last edited by EduardoQuintana on Mon Oct 07, 2013 4:38 pm, edited 2 times in total.
L@grang3

Centinela
Posts: 2
Joined: 6 years ago
Gender: None specified

Re: 2537 - Assassins of the Three Kingdoms

Post by Centinela » 6 years ago

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.

Post Reply

Return to “Problem set”