作者查詢 / suhorng
作者 suhorng 在 PTT [ Grad-ProbAsk ] 看板的留言(推文), 共59則
限定看板:Grad-ProbAsk
看板排序:
全部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)
2F→:第一題不如寫個程式算02/10 23:42
3F→:最短路≠最小生成樹 用任一種最短路徑演算法算也可以02/10 23:45
1F→:還要處理刪除的情況02/10 11:21
1F→:ln(1+π/6)02/09 20:28
1F→:1.BST的中序順序就是排序後的順序02/09 16:11
2F→:1.Complete Binary Tree所以除了葉子外都是滿的 照著填02/09 16:12
1F推:那種做法必須是tree (也就是undirected acyclic graph)02/09 14:52
2F→:若DAG就照拓樸順序DP02/09 14:54
4F推:dst[v] = 1 + max{dst[u] | (v,u)∈E}02/09 15:43
12F→:harmonic series + 102/09 08:42
1F推:2. arctan在0的泰勒展開, x^99 項係數的 99! 倍02/08 22:23
2F→: 對 1/(1+t^2) 從 0 積到 x. 先展開再積.02/08 22:23
3F→:3.交換積分順序或分部積分02/08 22:23
6F→:4.泰勒展開後發現極限不存在02/08 22:25
1F→:ax=1(mod n)<=> ax + ny = 1 for some x,y <=> gcd(a,n)=102/08 22:08
2F推:樓上正解 開個 5|V| 的陣列替代heap02/08 22:14
2F推:(7,29)=1 => 7^(29-1)≡1. 若 7^d≡1,d<29-1,則d|(29-1)02/06 23:00
3F→: ^^^^^因為29是質數,否則是φ(29)02/06 23:00