[理工] [離散] 99成大
題目大意:
共有4個女生跟5個男生
1號女生不喜歡1或3或5號男生
2號女生不喜歡2或4號男生
3號女生不喜歡3或5號男生
4號女生不喜歡4號男生
請問有幾種方法可使這4個女生都找到合適的男生?
考慮過女生當箱子,男生當球的想法
但完全不知道這樣的解法x要取幾次方的係數才是所要的方法數
請高手指導這題該怎麼寫了,謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 112.105.134.242
推
02/09 23:39, , 1F
02/09 23:39, 1F
推
02/09 23:40, , 2F
02/09 23:40, 2F
→
02/09 23:40, , 3F
02/09 23:40, 3F
→
02/09 23:41, , 4F
02/09 23:41, 4F
→
02/09 23:41, , 5F
02/09 23:41, 5F
→
02/09 23:41, , 6F
02/09 23:41, 6F
→
02/09 23:42, , 7F
02/09 23:42, 7F
→
02/09 23:44, , 8F
02/09 23:44, 8F
→
02/09 23:45, , 9F
02/09 23:45, 9F
推
02/09 23:45, , 10F
02/09 23:45, 10F
→
02/09 23:46, , 11F
02/09 23:46, 11F
→
02/09 23:58, , 12F
02/09 23:58, 12F
→
02/09 23:59, , 13F
02/09 23:59, 13F
→
02/10 08:08, , 14F
02/10 08:08, 14F
→
09/11 14:13, , 15F
09/11 14:13, 15F
討論串 (同標題文章)