作者查詢 / MOONRAKER
作者 MOONRAKER 在 PTT [ Visual_Basic ] 看板的留言(推文), 共3665則
限定看板:Visual_Basic
看板排序:
全部Military14258PHP3909Visual_Basic3665C_and_CPP3262Militarylife3191DummyHistory3066Physics2441Warfare2338Programming2035SF514SYSOP501marvel356bicycle354StarWars263sex203Network113Linux98hardware82Stock57java48C_Sharp44Gossiping41LTK29Soft_Job25Option24Browsers22Sub_CS18Web_Design18CodeJob16Flash14DC_SALE12MapleStory12Storage_Zone11PCSH91_30510PDA10Ajax9ForeignEX9GUNDAM9Singapore9sky9ComGame-Plan8Google8RegExp8Wikipedia8MOD7Navy7PC_Shopping7Road7C_Chat6Database6Electronics6Gamesale6HatePolitics6joke6PttSuggest6Violation6Chemistry5Key_Mou_Pad5KoreaStar5KS98-3025Office5Paradox5Tech_Job5Acad-Affairs4AntiVirus4bicycle-tour4biker4EAseries4ESP4ILSH-943134LCD4LightNovel4Marginalman4MP4pccu_physics4PttCurrent4TigerBlue4YiGo3114Bank_Service3comm_and_RF3Eclipse3FJU-EE-PIPO3FJU_physics3HelpBuy3Hsinchu3IA3IELTS3MdnCNhistory3MIS3MoveHouse3NTUSFA3pet3PttLifeLaw3Python3Rent_apart3StarTrek3TVCard3Windows3Army-Sir2Billiard2Cga2CSSE2EarthScience2L_TalkandCha2LoL2NCU97ME-B2NTU2NTUCGM2Railway2SMSlife2SportsShop2TaichungBun2Transport972TY_Research2YUGIOH2AC_In1ADS1Ancient1Android1AndroidDev1AppsForBBS1ASM1Aviation1Christianity1ck61st3081CntrbndList1cosplay1CS_TEACHER1CyberFormula1feminine_sex1FlashWolves1gallantry1GameDesign1GUNNM1happy1HCHS593131HCHS603091historia1image1Japan_Travel1japanavgirls1JunXin1Kaohsiung1Little-Games1ManUtd1MIS_Gbasket1MP3-player1NCCU_thanks1Notebook1NTNU-IAGS1NTUIM-081NTUMRC1NTUSG1phys851PttLaw1PublicServan1PunishRecord1Rozen_Maiden1San-X1Seiya1SFFamily1Simcity1SLG1Suckcomic1Taipei1THUIM-3rd1TKU_EW94B1TOEIC1Wargaming1wearefriends1WomenTalk1<< 收起看板(171)
5F→:你打開巨集錄製,實際插入一個文字方塊,停止錄製04/03 13:59
6F→:然後進去VB editor,把那個巨集的code貼上來給大家看04/03 13:59
8F→:阿~那不行了04/05 03:44
1F→:什摸是 2604/01 00:30
3F→:這題目其實很普通 首先你要(1)開一個夠大的陣列來存因數04/01 00:36
4F→:基本上開100項絕對夠(2)是用一個for迴圈從x跑到204/01 00:37
5F→:其中每一個數可整除x的就是x的因數04/01 00:38
6F→:(3)每找出一個因數就放進陣列,找完累加起來看是否等於x04/01 00:39
7F→:我現在就可以想到3種難度和速度不等的方法04/01 00:40
10F→:不用陣列就是每看到一個因數就拿來加到sum裡面04/01 10:05
11F→:這樣你只需要兩層迴圈就好,i=1..1000; j=1..i; check j04/01 10:06
1F→:(1)不是抓檔案,是open URL。方向要搞對。03/29 21:16
2F→:(2)把RSS的xml存下來用你找到的程式開,看會怎麼樣。03/29 21:18
3F→:(3)你有老師。(4)欲速則不達。03/29 21:18
1F→:昨天才學請耐心看書,欲速則不達03/29 21:14
4F→:我只收暑修一個學分的學分費就好 |D03/24 14:06
2F→:要這樣寫就改用while 不要用for03/23 01:54
1F→:看你課本迴圈的部份03/23 01:53
3F→:要養成好習慣03/23 09:46
1F→:還有bin...怎麼會這麼像啊 XD 的確很有可能03/22 17:54
1F→:為何一定要架2-tier來測試?也可以在同一VM上跑資料庫呀03/22 13:28
4F→:conn string可能會寫在某個大家共通的include file裡吧03/22 13:45
5F→:甚至可能寫成一個DLL 所以改連線字串就要recompile DLL03/22 13:46
1F→:你不需要select case,用多個if寫才是正途03/22 10:47