作者查詢 / BlazarArc
作者 BlazarArc 在 PTT [ Tech_Job ] 看板的留言(推文), 共48則
限定看板:Tech_Job
看板排序:
全部MusicGame3412OverWatch3090C_and_CPP441Magic381Soft_Job164DIABLO131CFantasy123Japandrama101HwangYih64Tech_Job48WOW46NTUEE10744NTUEE107HW38NTU_BOTDorm234TNFSH921932StarTrek30Little-Games22NBA15GameDesign13TaiwanDrama11movie10nCoV20199NtuDormM39StarCraft9Gossiping8HarryPotter7Hunter7C_Sharp5emprisenovel5Programming4AHQ3Ahqwestdoor3joke3KR_Entertain3PokeMon3WorldCup3eSports2FlashWolves2Instant_Mess2NCKU-PH982Office2Olympics_ISG2ACMCLUB1C_Chat1CMU_M491CodeJob1ComGame-Plan1consumer1dorm1eWriter1Gintama1graduate1Hsinchu1iOS1JapaneseRock1Key_Mou_Pad1kochikame1KS92-3131NDS1NTTU_CSIE991NTUcourse1ONE_PIECE1PACERS1PublicIssue1Salary1Stock1streetfight1TigerBlue1TW-language1Wine1<< 收起看板(70)
9F推:推11/26 09:18
22F推:2N個號碼只要買C(N,3)就可確保一定中,不用C(2N,3)11/23 00:26
23F→:忘了加上前提,至少3個號碼在2N中11/23 00:27
24F推:已知:至少3個號碼在1~24中11/23 00:29
25F→:把1~24分成G1:1~12跟G2:13~2411/23 00:30
26F→:每張買G1 C(12,3)3個號碼跟G2 3個,比如(1,7,8,13,19,2011/23 00:31
27F→:G1 G2怎麼對應不是重點,只要G2 C(12,3)都存在11/23 00:31
30F→:然後舉證, 3個號碼在(G1,G2)是(3,0) or (0,3)已經被包含11/23 00:33
31F→:(1,2)跟(2,1) 因為你已經列舉 C(12,3) 必定能找到一組11/23 00:33
32F→:剛好對應 這三個的組合,所以也必中11/23 00:34
33F→:"如果他在1~24中有3個" 那一定可以cover的買數是C(12,3)11/23 00:35
34F→:所以要C(12,3)*2啊 XD11/23 00:36
18F推:有沒有搞不清楚題意的八卦...11/22 12:53
5F推:推Prob_Solve高手11/22 00:54
2F推:推11/13 13:25
34F推:推07/13 03:20
69F推:推!06/06 14:07
25F噓:...01/10 19:32
2F推:這篇說得很好啊01/03 09:55
17F推:XDDDDDDD12/22 17:03