Search - tip - CodeBus

Search - tip - List

[Other resource] 吃豆子游戏源码 DL : 0: 吃豆子游戏的源代码。嘿嘿，这个游戏本身就很好玩，别只顾着玩，忘记学习哦。提示：这个游戏比较大，我们打开VB工程组文件PACMAN PROJECT GROUP VB5.vbg 就能加载工程，然后看看怎么把几个VB工程组合为工程组的方法。-eat peas game's source code. Laughter, the game itself is fun, not just to play with, oh, forget learning. Tip : The game is bigger, we open a VB project files PACMAN PROJECT GROUP VB5.vbg project will be able to load, and then look at how to combine several VB works project portfolio for the group.
Date : 2008-10-13 Size : 968.6kb User : 李陈
[Other resource] H.264英文协议 DL : 0: 关于H.264协议的资料，英文原版的！谢谢大家的指教！-agreement on the H.264 information, the English original! Thank you for the tip!
Date : 2008-10-13 Size : 207.89kb User : qa
[Other resource] TIP DL : 0: 用java 开发游戏..的一本书,,我还没看呢 -with java games .. of a book, I do not! !
Date : 2008-10-13 Size : 187.6kb User : 吴高洁
[Other resource] 测试速度 DL : 0: 本测试采用叠加方式循环一亿次，得出来的时间越小就代表你的电脑运算速度越快。温馨提示：在开始测试之前请关闭所有的应用程序！-the overlay method to test cycle 100 million times, and so the smaller the time on behalf of your computing faster. Warm Tip : Before the commencement of testing Please close all applications!
Date : 2008-10-13 Size : 3.5kb User : ldx
[Other resource] Java_Einstein DL : 0: 用JAVA解答智力题：爱因斯坦留下来的智力题目（谁养鱼？）据说世界上有98％的人答不出来　　主题:爱因斯坦留下来的智力题目　　1、在一条街上，有5座房子，喷了5种颜色。　　2、每个房里住着不同国籍的人　　3、每个人喝不同的饮料，抽不同品牌的香烟，养不同的宠物　　问题是：谁养鱼？　　提示：　　1、英国人住红色房子　　2、瑞典人养狗　　3、丹麦人喝茶　　4、绿色房子在白色房子左面　　5、绿色房子主人喝咖啡　　6、抽Pall Mall 香烟的人养鸟　　7、黄色房子主人抽Dunhill 香烟　　8、住在中间房子的人喝牛奶　　9、挪威人住第一间房　　10、抽Blends香烟的人住在养猫的人隔壁　　11、养马的人住抽Dunhill 香烟的人隔壁　　12、抽Blue Master的人喝啤酒　　13、德国人抽Prince香烟　　14、挪威人住蓝色房子隔壁　　15、抽Blends香烟的人有一个喝水的邻居　　爱因斯坦在20世纪初出的这个谜语。他说世界上有98％的人答不出来。 -with Java intellectual answer that : Einstein's intellectual subject (who fish?) The world is said to have 98% of the people not answer to the theme : Einstein left an intellectual topic, in a street, five houses, sprayed the five colors. Two, every room of different nationalities lived three people each drink different drinks, pumping different brands of cigarettes, raising the pet question is : Who fish? Tip : 1, the British Red lived two houses, three dogs Sweden, Denmark, four tea, green house in the house left five white, green coffee house owner 6, pumping Pall Mall cigarettes beings seven people, the yellow house owner pumped Dunhill cigarettes 8, living in the middle the house drink milk 9, Norway living room No. 10, pumping Blends cigarettes and cats live in the next 11, raise
Date : 2008-10-13 Size : 33.4kb User : 赠礼
[Other resource] Simulate_Allocate_Memory_Implement_by_C DL : 0: 模拟内存分配的c语言实现六、实验目的了解用户程序分配内存以及回收所用内存的过程，加深对操作系统存储管理机制的理解。七、实验内容采用首次适应法、最佳适应法或最差适应法，编写一内存分配和回收模拟程序。（提示：“内存空闲区”数组的设置原理类似于实验一。动态地随机产生新的“内存分配”或“内存回收”请求，再按照你选定的分配算法修改这个数组。由于这个实验的重点在于内存分配，所以不考虑与某内存区相关的进程情况。） -simulation memory allocation in C Language 6, the experiment was to understand user program memory allocation and recovery of memory used by the process, enhance the operating system memory management mechanisms and understanding. 7, the first experiment using content to adapt, adapt best or the worst adaptation law, the preparation of a memory allocation and recovery simulation program. (Tip : "memory free zone" set up an array of principles similar to the experimental one. Dynamic random to create a new "memory allocation" or "memory recovery" request, then you have chosen in accordance with the allocation algorithm to change the array. As the focus of this experiment is memory allocation, there is no test taking into account with a certain memory areas rela
Date : 2008-10-13 Size : 3.53kb User : 丘方
[Other resource] netsafe DL : 0: 爱因斯坦在20世纪初出的这个谜语。他说世界上有98％的人答不出来。某家公司在面试应聘者时借用了爱因斯坦的这个IQ题，考查应聘者的IQ，现在我们暂且不去讨论这个公司用这样的题目来考查应聘者的IQ有多“变态”，如果是你，拿到了这样的笔试题目，你能做得出来吗？　　1、在一条街上，有5座房子，喷了5种颜色。　　2、每个房里住着不同国籍的人　　3、每个人喝不同的饮料，抽不同品牌的香烟，养不同的宠物　　问题是：谁养鱼？　　提示：　　1、英国人住红色房子　　2、瑞典人养狗　　3、丹麦人喝茶　　4、绿色房子在白色房子左面　　5、绿色房子主人喝咖啡　　6、抽Pall Mall 香烟的人养鸟　　7、黄色房子主人抽Dunhill 香烟　　8、住在中间房子的人喝牛奶　　9、挪威人住第一间房　　10、抽Blends香烟的人住在养猫的人隔壁　　11、养马的人住抽Dunhill 香烟的人隔壁　　12、抽Blue Master的人喝啤酒　　13、德国人抽Prince香烟　　14、挪威人住蓝色房子隔壁　　15、抽Blends香烟的人有一个喝水的邻居　　以上是爱因斯坦在20世纪初出的这个谜语。他说世界上有98％的人答不出来。用递归算法实现-Einstein in the early 20th century out of this riddle. He said the world have 98% of the people not answer. A company in interviews when candidates use Einstein's IQ that, to investigate the IQ candidates, we will put aside the discussion of the company do not use this topic to test the IQ candidates how "abnormal", if you get such a written subject, can you come up with? ? One, in a street, five houses, sprayed the five colors. Two, every room of different nationalities lived three people each drink different drinks, pumping different brands of cigarettes, raising the pet question is : Who fish? Tip : 1, the British Red lived two houses, three dogs Sweden, Denmark, four tea, green house in the house left five white, green coffee house owner 6, pumping Pall Mall cigarettes be
Date : 2008-10-13 Size : 13.97kb User : 李东
[Other resource] ntree DL : 0: 设T 是一棵带权树，树的每一条边带一个正权。又设S 是T 的顶点集,T/S 是从树T 中将S中顶点删去后得到的森林。如果T/S中所有树的从根到叶的路长都不超过d ，则称T/S 是一个d 森林。 (1)设计一个算法求T的最小顶点集S，使T/S是d 森林。(提示：从叶向根移动) (2)分析算法的正确性和计算复杂性。 (3)设T中有n 个顶点，则算法的计算时间复杂性应为O(n)。-based T is a right to bring a tree for every one of the sideband is the right one. S is also based Vertex Set T, T / S from the tree T Lieutenant General S vertex deletion the forest. If the T / S all trees from the roots to leaves of a long road, do not exceed d, said the T / S is a d forest. (1) design a T algorithm for the minimum vertex set S, T / S is d forest. (Tip : from roots to leaves mobile) (2) analysis algorithm correctness and computational complexity. (3) The T with n vertices, the algorithm complexity of computing time for the O (n).
Date : 2008-10-13 Size : 878byte User : 自由人
[Other resource] wuzq DL : 0: 特别提示：不要使用TC编译，因为TC最多只能编译2000行，而本程序有2500行，推荐使用工具Win-Tc。程序写的比较仓促，bug很多在所难免，还望大家批评指正。真诚的希望能和大家相互交流，共同提高。去年暑假，本人闲来无聊写了一个C语言图形模式下的五子棋游戏，有如下功能： 1.使用鼠标控制 2.能够实现人机对战，并判断胜负 3.能够保存棋局和玩家所走的每一步，并且可以按步骤还原棋局 4.玩家能够悔棋、和棋、认输 5.保存每一个玩家的分数到一个文件中，可随时查看。大概写了2500行，很多难点基本上都是靠自己琢磨的，比如判断胜负、人机对战、悔棋、还原棋局等等，由于本人五子棋水平低劣，所以写出的电脑的IQ也不高，大家可以尽情蹂躏。最后给大家一句忠告——别人的代码是可以看的，但课程设计还是要自己做的！ E-mail:zhongnanlifan@163.com 李凡中南大学计算机0304 程序写于2004.7.10 -Special Tip : Do not use TC compiler, as TC can only build up to 2,000 firms while the procedures are 2,500 firms use the tools Win - Tc. The procedure was relatively short, and many bug unavoidable, we also look criticized correct. A sincere hope that you will share together. Last summer, leisure, I wrote a boring C language graphics mode of 331 games, has the following functions : 1. use the mouse to control two. to achieve human-machine players, judge and 3 victory. to preserve and chess players are taking every step steps can be reduced by four chess game. players can he never cheat in spain, a draw in chess. Lose 5. every player kept the score to a document, they can always check. Writing about the 2500 trip, many difficulties are basically on their own pondering, for instance, to jud
Date : 2008-10-13 Size : 55.88kb User : 李凡
[Other resource] ajaxcd20060404 DL : 0: tomcat 详细方法请见http://www.webplat.cn的技术文档. 2.将解压后的文件夹拷至％tomcat_home％/webapps/Root下,文件夹下有index.jsp文件 3.在mysql环境中将src文件夹下jspshop.sql执行生成数据库 4.按照系统环境修改build.bat文件以及src中.java文件。其中build.bat中修改tomcat和jdk的安装路径其中.java文件修改数据库的地址、登陆用户名和密码 5.命令行下运行build.bat，运行完后％tomcat_home％/webapps/Root/web-inf/classes文件夹下有ckstudio文件夹 6.确定上述操作无误，重新启动tomcat.在浏览器中输入 http://localhost:8080/你解压后的文件名提示:如果您不熟悉jsp环境配置,请严格按照上述步骤进行. 本软件经测试能在各种jsp服务器上运行，在linux平台上也能成功运行。如不能正确配置，请参见http://www.webplat.cn或者用E-mail、QQ和我们联系。-tomcat detailed methodology, see http : / / www.webplat.cn technical documents. 2. to extract the folder to emboss% tomca t_home% / webapps / Root, folder documents have index.jsp 3. in mysql environment will src folder jspsh op.sql implementation Generation Database 4. in accordance with the system environment and changes build.bat file src . java documents. Which build.bat modified tomcat and jdk which the installation path. Java Document the address database, username and password 5. command line running build.bat. After running tomcat_home%% / webapps / Root / web-inf / c lasses folder under ckstudio folder 6. establishes operating correctly, restart tomcat. the browser input http://localhost : 8080 / After you unpack the file name Tip : If you are not familiar with jsp environment con
Date : 2008-10-13 Size : 1.21mb User : 郑风
[Other resource] bahe DL : 0: 设计四拔河游戏机 1、设计一个能进行拔河游戏的电路。 2、电路使用15个(或9个)发光二极管，开机后只有中间一个发亮，此即拔河的中心点。 3、游戏双方各持一个按钮，迅速地、不断地按动，产生脉冲，谁按得快，亮点就向谁的方向移动，每按一次，亮点移动一次。 4、亮点移到任一方终端二极管时，这一方就获胜，此时双方按钮均无作用，输出保持，只有复位后才使亮点恢复到中心。 5、用数码管显示获胜者的盘数。教学提示: 1、按钮信号即输入的脉冲信号，每按一次按钮都应能进行有效的计数。 2、用可逆计数器的加、减计数输入端分别接受两路脉冲信号，可逆计数器原始输出状态为0000，经译码器输出，使中间一只二极管发亮。 3、当计数器进行加法计数时，亮点向右移；进行减法计数时，亮点向左移。 4、由一个控制电路指示谁胜谁负，当亮点移到任一方终端时，由控制电路产生一个信号，使计数器停止计数。 5、将双方终端二极管“点亮”信号分别接两个计数器的“使能”端，当一方取胜时，相应的计数器进行一次计数，这样得到双方取胜次数的显示。 6、设置一个“复位”按钮，使亮点回到中心，取胜计数器也要设置一个“复位”按钮，使之能清零。 -design a tug-of-war game, can design a game of tug of war circuit. 2, circuit use 15 (or 9), light-emitting diodes, come only among a shiny, namely, the center of tug-of-war. 3, the game with a two button rapidly and continuously pressed, have a pulse, who by fast, Who bright spots on the move, every time, a bright spot in Mobile. 4, the party moved to highlight terminal diode, on the winning side, this time the two sides had no effect buttons, to maintain output, so after only bright spot reduction restored to the center. 5, digital Display won the bookkeeping. Teaching Tip : one, that the button signal input pulse signal every time the button should be able to effectively counter. 2, with reversible counter, plus or minus count input to receive two pulse signal, reversible counter to the
Date : 2008-10-13 Size : 285.84kb User : 万金油
[Other resource] PackageProblem DL : 0: 实现背包问题 package problem 1．问题描述假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解：（1，4，3，2）、（1，4，5）、（8，2）、（3，5，2）。 2．基本要求读入T、n、w1 , w2 , … , wn 3．提示：可利用递归方法：若选中w1 则问题变成在w2 , … , wn 中挑选若干件使得其重量之和为T- w1 ，若不选中w1，则问题变成在w2 , … , wn 中挑选若干件使得其重量之和为T 。依次类推。也可利用回溯法的设计思想来解决背包问题。首先将物品排成一列，然后顺序选取物品装入背包，假设已选取了前i 件物品之后背包还没有装满，则继续选取第i+1件物品，若该件物品“太大”不能装入，则弃之而继续选取下一件，直至背包装满为止。但如果在剩余的物品中找不到合适的物品以填满背包，则说明“刚刚”装入背包的那件物品“不合适”，应将它取出“弃之一边”，继续再从“它之后”的物品中选取，如此重复，，直至求得满足条件的解，或者无解。注：没压缩密码-knapsack problem achieve a package problem. Problem description one would assume that the total volume of loaded backpack and T n size pieces of w1, w2, ..., wn items Can n items from the selected pieces were just filled with backpacks, even w1 w2 ... wn = T, asked to identify all of the above conditions are met solution. For example : when T = 10, the volume of items (1,8,4,3,5,2), may find the following four solutions : (1,4,3,2), (1,4,5), (8,2), (3,5,2). 2. Basic requirements read T, n, w1, w2, ..., wn 3. Tip : Recursive methods can be used : If the problem were selected w1 into the w2, ..., wn selected several pieces make its weight and as a T-w1, if selected w1, w2 issue into the .... wn selected several pieces make its weight and as T. Renumbered accordingly. Retrospective can also u
Date : 2008-10-13 Size : 9.08kb User : 李昭明
[Other resource] Thecarstop DL : 0: 停车场是一条可以停放n辆车的狭窄通道，且只有一个大门汽车停放安到达时间的先后依次由北向南排列（大门在最南端，最先到达的第一辆车停在最北端）若停车场已经停满n辆车，后来的汽车在便道上等候，一旦有车开走，排在便道上的第一辆车可以开入；当停车场的某辆车要离开时，停在他后面的车要先后退为他让路，等它开出后其他车在按照原次序开入车场，每两停在车场的车要安时间长短缴费。要求：以栈模拟停车场，以队列车场外的便道，按照从终端输入的数据序列进行模拟管理。每一组数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码、以及到达或离去的时刻。对每一组数据进行操作后的信息为：若是车辆到达，则输出汽车在停车场的内或便道上的位置：若是车辆离去则输出汽车在停车场内的停留时间和应缴纳的费用（在便道上的停留时间不收费）。栈以顺序结构实现，队列以链表结构实现。 -parking can be a n vehicles parked in a narrow channel. and only one door car parked on the time of arrival has followed from north to south with (the southernmost tip of the door, the first to reach No. 1 car was parked in the most northern end of the project) if the car park has been full of parked cars n, and later in the car on the sidewalk waiting Once a car drive away, on the sidewalk on the first one into the car; When parking a car to leave, He stopped at the first car behind the back of his crazy, it has come out after the other vehicles in the original order into the garage, Every two parked cars in the parking lots to pay security duration. Requirements : Stack simulated car parks, to train teams outside the sidewalk, according to the input from the terminal sequence simulation
Date : 2008-10-13 Size : 3.13kb User : 牛纪超
[Other resource] USBdrvtips1 DL : 0: usb tip usb driver information
Date : 2008-10-13 Size : 114.27kb User : Drifter
[Other resource] xiaofangbianlidian DL : 0: 版本要求：程序体现面向对象的编程思想；要求能够灵活添加新物品，并向用户提供多次购买一次性结帐的功能；提示：可用以下三个类解决该问题: 1．货物类（Goods）：一个商品，包含了名称，价格信息 2．购物篮类（Basket）：一个购物篮，包含了已经选择的东西 3．Store：小芳便利店主程序 -version requirements : procedures reflect object-oriented programming ideas; Require flexibility to add new items, multiple users to purchase one-time billing functions; Tip : The following three categories can be used to solve the problem : 1. Goods category (Goods) : a commodity, including the name, price information 2. Shopping basket category (Basket) : a shopping cart, already contains a choice of three things. Store : Xiaofang facilitate procedures owner
Date : 2008-10-13 Size : 89.25kb User : 刘斌
[Other resource] XMLHacks.-.100.Industrial-Strength.Tips..Tools.200 DL : 0: This practical, roll-up-your-sleeves guide distills years of ingenious XML hacking into a complete set of tips, tricks, and tools for web developers, system administrators, and programmers who want to leverage the untapped power of XML. If you want more than the average XML user--to explore and experiment, discover clever shortcuts, and show off just a little (and have fun in the process)--this invaluable book is a must-have. -This practical, roll-up-your-sleeves guide distills years of ingenious XML hacking into a complete set of tip s, tricks, and tools for web developers, system administrators, and programmers who want to leverage the untapp ed power of XML. If you want more than the average XML user -- to explore and experiment. discover clever shortcuts. and show off just a little (and have fun in the pro cess) -- this invaluable book is a must-have.
Date : 2008-10-13 Size : 3.04mb User : 静水
[Other resource] 8 DL : 0: 它能够实现：动态弹出tip窗口，这个窗口能够显示一个icon和多行文本。文本以 \\n 分行，窗口的颜色来源于系统窗口，窗口文本，和滚动条颜色。
Date : 2008-10-13 Size : 37.44kb User : xl
[Other resource] CGOODButton DL : 0: 1. 在按钮上加入Icon，使Icon和文字同时显示 2. 显示平面按钮 3. 使按钮上的图标可变 4. 设置按钮在不同状态下的底色和文字颜色 5. 设置图标和文字的位置 6. 根据Icon的形状设置按钮的形状 7. 添加Tooltips -1. In join Icon button, make Icon and the letter also showed 2. graphic shows three buttons. so that the button on the icon variable 4. buttons installed in different state of the color background and text 5. set up icons and the location of six characters. According to the Icon button in the shape of set-- 7. Add Tooltips
Date : 2025-12-23 Size : 55kb User : 生