作者查詢 / 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推: 對答案二分搜02/27 23:16
2F→: O(n log n log RANGE), 不能說是 o(n^2) 就是...02/27 23:18
3F→: http://tioj.ck.tp.edu.tw/problems/1208 這裡可以傳~02/27 23:18
4F→: ^^^^^ 這邊不確定一個 log 還兩個 log02/28 02:07
6F推: 原來 "莫隊" 做此解阿WWW02/05 00:18
41F→: C++ 的話就完全是 compiler extension 了02/02 01:28
3F→: d 是特別選(計算)的, **要滿足** e*d mod n = 101/06 23:14
1F→: 硬做應該還是可以做到 O(NW1W2W3)?12/17 16:32
1F→: 給原原 PO:strongly connected component 與縮點與 DAG08/11 02:10
4F→:呃...不是什麼可信的原文呀08/07 15:56
16F推:可能沒有. 當然比賽時線段樹可能有模板, 可以直接套.08/04 13:38
17F→:但他常數也可能比較大啦 只不過是 trade-off08/04 13:38
1F推:No, 這是可計算性的問題, 不是**共識**, 是數學事實06/06 23:22
2F→:我們不可能寫出一個程式,使得它對於**任意**其他程式在06/06 23:23
3F→:有限的時間內算出給定的程式會不會在有限的時間內終止06/06 23:23
4F→:但我是不瞭解這個在自動/或AI那一方面的意義....06/06 23:28
5F→:至少我覺得它給我的感覺,跟Godel不完備定理的感覺一樣06/06 23:28
1F推:因為key取一樣就可以變 (1)DES03/28 22:53
2F→:一種電路,兩種用法,賺!03/28 22:53