作者查詢 / springman
作者 springman 在 PTT [ C_and_CPP ] 看板的留言(推文), 共147則
限定看板:C_and_CPP
看板排序:
全部Stock19549Gossiping9959Christianity1835ChangHua1760car1751nCoV20191329Lifeismoney1319HatePolitics1305EZsoft786NBA734MobileComm708Tennis705Browsers586VoIP554LaTeX544Disabled511Office454Google433AfterPhD428biker384IME381Broad_Band350Jeremy_Lin296IA293Windows241JesusLove206Instant_Mess150DYU148C_and_CPP147Free_box146Linux143study133AntiVirus130swim115Federer96Math96Badminton95Android93ONE_PIECE89Prob_Solve89Tech_Job87Teacher71Education61Golf50sky44Nets41PhD40Law-Service39ask-why37Programming37NetRumor32FITNESS31Fix-Network24iOS24MLB20Blog19Brethren19teaching16RegExp14AVEncode13AudioPlayer12Chiayi12Hornets11ask10DV10Kaohsiung10Lakers10BigPeitou9BigShiLin9ChungLi9Gov_owned9Hawks9Hsinchu9Keelung9Web_Design9WomenTalk9WorldCup9Ecophilia8Editor8Ajax7Bunco7Japan_Travel6java6JinYong6StockPicket6DSLR5Football5Knicks5GossipPicket4home-sale4joke4L_TalkandCha4LAW4Miaoli4specialman4Test4TW-F-Tennis4CD-R3Insurance3movie3NSwitch3Option3Rockets3SYSOP3tabletennis3UTAH-JAZZ3Wizards3Baseball2Celtics2ChicagoBulls2Facebook2Finance2MenTalk2NTUT_Talk2PHP2Siam-Star2Storage_Zone2Ang_Lee1Conan1Database1Donate-Blood1FCU_COOP1FCU_Talk1gay1HsinTien1Hualien1hwai1I-Lan1MAC1Mavericks1MdnCNhistory1money1MuscleBeach1Nadal1Nangang1NCU_Talk1PACERS1PingTung1Python1Salary1Tainan1TamShui1TW-history1TW-M-Tennis1WorkinChina1WorldCupGG1YoungArtist1<< 收起看板(147)
2F推: 不知 dev-c++ 或 code::blocks 行不行呢?04/26 07:53
29F推: 應該避免寫執行結果是 machine-dependent 的程式碼。04/16 15:29
6F推: 不錯,沒有想過這個做法。04/06 19:26
16F推: for, while, if 是程式設計的核心與關鍵哦!加油!03/23 17:39
17F→: 可以先練習簡單、常見的問題,像:最大公因數, ...03/23 17:40
1F推: 沒問題、已連署!03/16 17:56
7F推: 這需要兩層迴圈,內層的迴圈需要兩個。12/15 15:52
9F推: 我很好奇一個迴圈的做法,可能要算得很精確吧!12/15 17:37
1F推: rep 裡面那行 sco = t; 是做什麼呢?12/03 12:28
4F推: 可是這樣應該是 t=sco; 才對,像您前面寫的。12/03 12:55
3F推: 我也推 OP 大推薦的兩本書,好像有中譯本05/03 16:16
4F→: 若可以看英文的話,英文版應該比較好,只是比較貴。05/03 16:16
2F推: 習題是讓自己再深入去想,更多善用程式,好的問題是04/28 12:41
3F→: 很有用的。至於答案,自己無法用 compiler 找出來嗎?04/28 12:42
4F→: 不過這本書我沒有看過,不知它的習題出得好不好。04/28 12:42
1F推: if (a[i] = a[j]) 改成 if (a[i] == a[j])04/21 05:33
2F→: if (n = 0) 改成 if (n == 0)04/21 05:34
3F→: 您這樣做陣列會最少嗎?04/21 05:34
4F→: 反正不超過 10 個可能就可以,不然重複的元素不必記04/21 05:35