Flash寫的小RPG游戲。。。。 # Archive D:\IT\source_code\1game\RPG.rar effect\enemy\0.fla effect\enemy\0.swf effect\enemy effect\hero\1.fla effect\hero\1.swf effect\hero\0.swf effect\hero effect error\error.fla error\error.swf error magic\magic1.fla magic\magic2.fla magic\magic3.fla magic\magic4.fla magic\magic5.fla magic\magic5.swf magic\magic4.swf magic\magic3.swf magic\magic1.swf magic\magic2.swf magic\magic0.fla magic\magic0.swf magic map\0.fla map\3.fla map\2.fla map\5.fla map\4.fla map\1.fla map\8.fla map\6.fla map\7.fla map\8.swf map\7.swf map\6.swf map\3.swf map\1.swf map\0.swf map\2.swf map\4.swf map\5.swf map sound\002.mid sound\001.mid sound\Victory.mid sound\Field02.mid sound\Negative01.mid sound\Dungeon01.mid sound RPG.fla RPG.html RPG.swf # # Files # 53
標簽： effectenemy ITsource_code Archive gameRPG
上傳時間： 2016-01-23
上傳用戶：hanli8870
Comparison of the performances of the LS and the MMSE channel estimators for a 64 sub carrier OFDM system based on the parameter of Mean square error
標簽： the performances Comparison estimators
上傳時間： 2016-02-01
上傳用戶：hgy9473
thinkinjava2English Thinking in Java, 2nd Edition, Release 11 To be published by Prentice-Hall mid-June, 2000 Bruce Eckel, President, MindView, Inc. Planet PDF brings you the Portable Document Format (PDF) version of Thinking in Java (2nd Edition). Planet PDF is the premier PDF-related site on the web. There is news, software, white papers, interviews, product reviews, Web links, code samples, a forum, and regular articles by many of the most prominent and respected PDF experts in the world. Visit our sites for more detail: http://www.planetpdf.com/ http://www.codecuts.com/ http://www.pdfforum.com/ http://www.pdfstore.com/
標簽： thinkinjava2English Prentice-Hall published Thinking
上傳時間： 2014-01-15
上傳用戶：ANRAN
Ink Blotting One method for escaping from a maze is via ‘ink-blotting’. In this method your starting square is marked with the number ‘1’. All free, valid squares north, south, east and west around the number ‘1‘ are marked with a number ‘2’. In the next step, all free, valid squares around the two are marked with a ‘3’ and the process is repeated iteratively until : The exit is found (a free square other than the starting position is reached on the very edge of the maze), or, No more free squares are available, and hence no exit is possible.
標簽： method ink-blotting Blotting escaping
上傳時間： 2014-12-03
上傳用戶：123啊
Noncoherent receivers are attractive for pulsed UWB systems due to the implementation simplicity. To alleviate the noise effect in detecting UWB PPM signals, this letter proposes a simple yet flexible weighted noncoherent receiver structure, which adopts a square-law integrator multiplied with a window function.
標簽： implementation Noncoherent attractive simplicity
上傳時間： 2013-12-01
上傳用戶：wys0120
Abstract Based on the demand analysis of the RFID middleware，it suggests how to develop the RFID middle— ware，including the functionality and the mechanism of the event handle，and prospects the future of the RFID mid— dleware．
標簽： middleware the Abstract analysis
上傳時間： 2013-12-21
上傳用戶：qilin
《游戲編程入門》一書16個例子的源碼，但沒有加入MID聲音代碼
上傳時間： 2013-12-17
上傳用戶：coeus
Its functions are: n order within (excluding n) At the same time, 3 and 7 can be integral to all natural and a few of the square root of s, and function as a value to return, the final result s output to file out.dat China.
標簽： functions excluding integral within
上傳時間： 2016-11-12
上傳用戶：王者A
《Java手機程式設計入門》／王森 書號：29014 頁數(shù)：約 492 頁 ISBN：957-200-527-8 出版日期：2001年08月25日 出版廠商：知城數(shù)位科技股份有限公司 訂價：380 第一章 Java 2 Micro Edition概論陣 第二章 Java程式設計簡介陣 第三章 撰寫您的第一個手機程式陣 第四章 在實體機器上執(zhí)行MIDlet陣 第五章 J2ME Wireless Toolkit陣 第六章 Motorola A6288手機程式開發(fā)陣 第七章 JBuilder MobileSet陣 第八章 MIDP for Palm 第九章 MIDlet的事件處理陣 第十章 MIDP圖形使用者介面程式設計陣 第十一章 MIDP圖形處理陣 第十二章 MIDP資料庫程式設計陣 第十三章 MIDP網(wǎng)路程式設計陣 附錄A MID其他參考資源總整理陣 附錄B Motorola J2ME SDK
上傳時間： 2016-12-01
上傳用戶：coeus
河內(nèi)塔問題 #include<stdio.h> #include<stdlib.h> int fun_a(int) void fun_b(int,int,int,int) int main(void) { int n int option printf("題目二:河內(nèi)塔問題\n") printf("請輸入要搬移的圓盤數(shù)目\n") scanf("％d",&n) printf("最少搬移的次數(shù)為％d次\n",fun_a(n)) printf("是否顯示移動過程? 是請輸入1,否則輸入0\n") scanf("％d",&option) if(option==1) { fun_b(n,1,2,3) } system("pause") return 0 } int fun_a(int n) { int sum1=2,sum2=0,i for(i=n i>1 i--) { sum1=sum1*2 } sum2=sum1-1 return sum2 } void fun_b(int n,int left,int mid,int right) { if(n==1) printf("把第％d個盤子從第％d座塔移動到第％d座塔\n",n,left,right) else { fun_b(n-1,left,right,mid) printf("把第％d個盤子從第％d座塔移動到第％d座塔\n",n,left,right) fun_b(n-1,mid,left,right) } }
上傳時間： 2016-12-08
上傳用戶：努力努力再努力
