作者查詢 / suhorng
作者 suhorng 在 PTT [ Prob_Solve ] 看板的留言(推文), 共337則
限定看板:Prob_Solve
看板排序:
全部C_Chat5350Math2497LightNovel1315C_and_CPP1218NTU423Prob_Solve337trans_math282Programming222CFantasy183NTUcourse143PLT110ck-talk103studyabroad76TOEFL_iBT75b00902HW71Grad-ProbAsk59SENIORHIGH57SMSlife48ASM44b00902xxx37Shana37GRE28NTU-Exam23Soft_Job22DoubleMajor21CSSE19Army-Sir15logic15juniorhigh14PangSir14CSCouncil13C_BOO11CKEISC10b98902xxx9Nangang8PHP8Python8b04902xxx7Gossiping7graduate6KanColle6Kyoto_Ani6b98902HW4b99902HW4b99902xxx4CS_TEACHER4CSIE_WSLAB4joke4KS98-3024LaTeX4love-vegetal4Militarylife4NTUHistory024Sub_CS4SYSOP4AC_In3b01902HW3b01902xxx3BBSmovie3CompilerDev3IdolMaster3NTUMG3Shokugeki3Suckcomic3Translate-CS3AfterPhD2Agr-Football2asciiart2b02902xxx2ck-inforOLD2ck60th1282CodeJob2H-GAME2Isayama2Libra2NTUMEB012NTUSA2specialman2StupidClown2SummerCourse2Ajax1ArakawaCow1ask1Aviation1B00305XXX1B00310XXX1b974060XX1b97902HW1Beauty1bi-sexual1Buddha1Buddhism1Bus1Capricornus1civil971ck58th3241ck61st1031ck61st3221ck61st3261ckbc1ComGame-Plan1CompBook1CSIE_Service1Daan1dog1DragonNest1Electronics1Evangelion1Fallinlove1FCU-EES1FinalFantasy1Gamesale1GetMarry1historia1home-sale1HSNU_11431IMO_Taiwan1Jeremy_Lin1JYPnation1KMSH_MS981KNU1Koei1KS97-3021KS97-3101LamiGirls1Linux1love1LoveLive_Sip1marriage1MCU_Talk1MH1Military1mobilesales1NCCU1NCHU-FT-1011NCHU_CsHsnu1NDHU-LF981NIHONGO1Nogizaka461NPTU1NTU_Service1ntuACCT031ntuACCT041NTUBA041NTUDMCC1NTUEE1151NTUfin061NTUMath1001NTUMEB001NTUmed001NTUSFA1NTUST_Talk1NTUT_EE496B1Pangya1part-time1PC_Shopping1PCSH96_3061piano1Pisces1pity1PuzzleDragon1Queer_drama1Railway1RakutenGirls1sex1sky1SRW1StarTrek1Stock1Suckgame1SuperBike1TakahashiRie1TOEIC1TokyoGhoul1Transfer1transgender1TTU-EE991TTU-I90B1TW-GHONOR1TWopera1uniform1Unlight1USC1VISA1Visual_Basic1Wen-Shan1Windows1WOW1WuYiFan1Yabuki1YZU_EE95B1Zhongzheng1<< 收起看板(192)
1F→:D為什麼對2^n取log阿? 我看你打 2n^2?11/28 22:52
2F→:C的確沒有錯. D即使是2^n跟5^n也不一樣,應該是O(5^n)11/28 22:53
4F→:不可以取log. 回憶定義: f(n)=O(g(n))是 f(n) <= c g(n)11/28 22:54
5F→:forall n >= n011/28 22:54
6F→:log f跟log g只弄出 log(f)<=clog(g), i.e. f <= g^c11/28 22:57
7F→:無論如何遇到不會的都從 f <= c g 的定義去想11/28 22:57
8F→:F. lim_{x→∞} xlog^4(x)/x^2 = 0 by l'Hopital rule11/28 23:04
9F→:因此 n(log^4 n) = O(n^2) //其中一個作法11/28 23:04
1F推:pumping lemma是說 regular => 必定....11/15 00:19
2F→:這題要證regular就直接給個RE或NFA或DFA11/15 00:19
11F推://tioj.redirectme.net:8080/JudgeOnline/showproblem?11/14 00:13
12F→:problem_id=1397 據說是...11/14 00:13
4F→:那不就能肯定永遠不超過該常數了嗎11/09 18:26
1F→:連續三次的加密是指什麼阿10/22 15:27
7F→:原來如此 感謝解惑10/22 20:02
10F推:pigalan的LDS是正解, O(n log n)08/31 21:58
11F→:LDS就是把LIS的increasing改成decreasing08/31 21:59
12F→:不過是跟 Dilworth's theorem 有關嗎orz 不太有印象08/31 22:11
13F→:http://math.stackexchange.com/questions/43898508/31 22:11
14F→:上面這個稍微不太一樣XD08/31 22:11
15F→:等等XDDDD 先當我沒說08/31 22:14
12F→:DEF錯 C看定義是對的 但也許題目敘述有要求要求tightest的06/03 23:47
13F→:上界06/03 23:47
17F→:n^n不包含在O(n!)中阿XD06/04 00:04
18F→:看到什麼都O(n^n)沒什麼意義就是...06/04 00:04
1F推:欸特推一個05/14 00:09
1F→:順序呢? A=ab, B=c, C=cba04/16 23:29
1F→:學Haskell03/27 20:34
9F→:買這本書:「由片語學習 C 程式設計」, 劉邦鋒著03/28 18:45
10F→:Real World Haskell這本書也不錯(逃)03/28 18:47