Location:
Search - s-1000
Search list
Description: 1、从customer表中查询所有客户的姓名和电话。
2、查询库存量大于1000的商品，结果按库存量从大到小排序。
3、查询每个客户的订单金额的总和。
4、查询2005年上半年（1月1日到6月30日）订货总数大于5000的商品。
5、查询所有北京客户的订单信息，包括订单的序号、客户的姓名、商品名、数量。
6、查询所有商品在什么时间卖出了多少。
7、查询没有订单的商品信息。
8、查询每种商品的销售总数量和总金额。
-one from the customer table for the names of all customers and telephone. Two inquiries inventory of more than 1,000 commodities, stocks on average by sequencing. Three inquiries each customer's total amount of orders. Four inquiries the first half of 2005 (January 1 to June 30) the total number of orders for more than 5,000 products. Five, all inquiries Beijing customer order information, including the serial number of orders, the customer's name, trade names, the numbers. 6, inquiries all goods and the time of the number sold. 7, no orders for the commodity information. 8, inquiries every commodity in total sales volume and the total amount.
Platform: |
Size: 85203 |
Author: huyb02 |
Hits:
Description: For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix.
heuristics: descent.
Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations.
heuristics: Simulated annealing.
Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations.
heuristics: based on Simulated Annealing.
Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations.
-For the incomplete methods, we kept the representation of the queens by a tab le and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems th an the representation by a matrix. heuristics : descent. Tests : 100 queens in less than a second and 67 iteration s. 500 queens in a second and 257 iterations. 100 queens 0 in 11 seconds and 492 iterations. heuri stics : Simulated annealing. Tests : 100 queens in less than a second and 47 iteration s. 500 queens in 5 seconds and 243 iterations. 10 00 queens in 13 seconds and 497 iterations. heur istics : based on Simulated Annealing. Tests : 100 queens in less than a second and 60 iteration s. 500 queens in a second and 224 iterations. 100 0 queens in 5 seconds and 459 iterations. q 1
Platform: |
Size: 52579 |
Author: ZHU |
Hits:
Description: 解决时钟问题，acm竞赛题
A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind. There are infinite number of coins of each kind, each marked with a number d ( 0 <= 1000 ), meaning that this coin will make the minute hand move d times clockwise the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15.
Now you are given the initial time s ( 0 <= s <= 59 ) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.-clock to solve the problem, acm contest A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you can not use any other kind. There are infinite number of coins of each kind, each marked with a number d (0 lt; = 1000), meaning that this coin will make the minute hand move clockwise d times the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15. Now you are given the initial time s (0 lt; s = lt; = 59) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.
Platform: |
Size: 1308 |
Author: 王冠 |
Hits:
Description: Many users have got used that Windows NT Task Manager shows all processes, and many consider that i s impossible to hide a process from Task Manager. Actually, process hiding is incredibly simple. There are lots of methods available for such a purpose and there are source codes available. It still amazes me that there are only a few trojans using these methods. Literally only 1 trojan from a 1000 is hidden. I think that trojan authors are lazy, since it requires extra work to hide the process and it is always easier to use ready-made sources and copy-paste them. Therefore we should expect hidden trojan processes in a near future.-Many users have got used that Windows NT Tas k Manager shows all processes, and many consider that i s impossible to hide a process from Task Manager. Actually, hiding process is incredibly simple. There are lots of methods available for such a purpose and there are source codes available. It still amaz es me that there are only a few trojans using thes e methods. Literally only a variant is from a 1000 hidden. I think that disables authors are lazy, since it requires extra work to hide the process and it is always easier to use ready-made source s and copy-paste them. Therefore we should Expe ct hidden variant processes in a near future.
Platform: |
Size: 15915 |
Author: inwing |
Hits:
Description: 箱子中放苹果的求解程序，最多可以用7个箱子。是1000个苹果放10个箱子的模拟。-boxes were put Apple's program is the most can be used seven boxes. Apple is the 1000 release 10 boxes of simulation.
Platform: |
Size: 10272 |
Author: 萧萧 |
Hits:
Description: 这是一个连连看的小游戏的部分源代码，是一个简单的界面部分，不包含算法和其他功能。-1000 block of Terry Avenue is a small part of the game's source code is a simple interface, does not include algorithms and other functions.
Platform: |
Size: 2213 |
Author: 独孤依人 |
Hits:
Description: 一个dos游戏的源代码-a game's source code
Platform: |
Size: 889317 |
Author: 陈盛荣 |
Hits:
Description: 一个dos游戏的源代码-a game's source code
Platform: |
Size: 888832 |
Author: 陈盛荣 |
Hits:
Description: For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix.
heuristics: descent.
Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations.
heuristics: Simulated annealing.
Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations.
heuristics: based on Simulated Annealing.
Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations.
-For the incomplete methods, we kept the representation of the queens by a tab le and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems th an the representation by a matrix. heuristics : descent. Tests : 100 queens in less than a second and 67 iteration s. 500 queens in a second and 257 iterations. 100 queens 0 in 11 seconds and 492 iterations. heuri stics : Simulated annealing. Tests : 100 queens in less than a second and 47 iteration s. 500 queens in 5 seconds and 243 iterations. 10 00 queens in 13 seconds and 497 iterations. heur istics : based on Simulated Annealing. Tests : 100 queens in less than a second and 60 iteration s. 500 queens in a second and 224 iterations. 100 0 queens in 5 seconds and 459 iterations. q 1
Platform: |
Size: 52224 |
Author: ZHU |
Hits:
Description: 本程序为tcl程序，用于以ns2模拟ad hoc network.
本程序实作50个 nodes 在1000 * 1000公尺内随意移动的ad hoc network.
-the procedures for Philips procedures, NS2 used to mock ad hoc network. this program is for 50 nodes in 1000* 1,000 meters free mobile ad hoc network.
Platform: |
Size: 3072 |
Author: 黎智 |
Hits:
Description: M/M/1单服务台排队系统仿真（用事件调度法实现离散事件系统仿真）
顾客到达模到达时间间隔和顾客服务时间均服从负指数分布，单服务台系统，按照单队排队，按FIFO方式服务。考察服务n个顾客（n=1000，2000，3000，5000）后的顾客平均队长及平均排队等待时间。-M/M/1 single-server queuing system simulation (using Event Scheduling Method Discrete Event Simulation System) to customers Da-mo arrival time interval and customer service time are negative exponential distribution, single-desk system, in accordance with the single-team queue, by FIFO mode services. N inspection services customers (n = 1000,2000,3000. 5000) the average customer captain, and the average queue time.
Platform: |
Size: 1024 |
Author: 麦麦 |
Hits:
Description: n皇后问题求解(8<=n<=1000)
a) 皇后个数的设定
在指定文本框内输入皇后个数即可,注意: 皇后个数在8和1000 之间(包括8和1000)
b) 求解
点击<Solve>按钮即可进行求解.
c) 求解过程显示
在标有Total Collision的静态文本框中将输出当前棋盘上的皇后总冲突数.
当冲突数降到0时,求解完毕.
d) 求解结果显示
程序可以图形化显示8<=n<=50的皇后求解结果.
e) 退出程序,点击<Exit>即可退出程序.-n Queens Problem Solving (8 <= n <= 1000) a) Queen number of settings in the designated text box to enter the Queen s Number, Note: Queen s number in between 8 and 1000 (including 8 and 1000) b) Solving <Solve> Click button to solve. c) the solution process displayed in the Total Collision marked the static text box will output the current Queen s chessboard the total number of conflicts. When the conflict reduced the number of 0:00, finished solving. d) The results showed that the procedure can solve the graphical display 8 <= n <= 50 to solve the results of the Queen. e) withdraw from the program, click <Exit> to withdraw from the program.
Platform: |
Size: 128000 |
Author: jiangtao |
Hits:
Description: 前年外挂的源代码,很好用,值得学习和研究-The previous year s source code plug-in, very good, and worthy of study and research
Platform: |
Size: 9216 |
Author: 金属 |
Hits:
Description: 用TreeView控件显示来自ADO的Grouping数据.rar-TreeView control with display Grouping data from ADO s. Rar
Platform: |
Size: 17408 |
Author: 浙江省 |
Hits:
Description: 看到很多手写控件，注册一下要1000。。。
于是找了很多很多网站，花了很多很多时间，终于找到了这个东东安装好 ink 目录中的 ink.dpk 后，运行 支持库 目录 中的 注册.bat,里面有delphi的例子-MSHW090408
Platform: |
Size: 9835520 |
Author: super |
Hits:
Description: ethernet mac verilog code.eth 10 100 1000mb/s
Platform: |
Size: 690176 |
Author: amir |
Hits:
Description: keil编程1000例(C语言),各种经典程序和得法分析，1000例的C语言方便移植，移植性非常好。-keil Programming 1000 cases (C language), various procedures and well-classical analysis of 1000 cases of the C language to facilitate transplantation, transplantation of very good.
Platform: |
Size: 150528 |
Author: 李 |
Hits:
Description: 英贝特公司的航天产品，型号为：p104，的千兆网卡的测试，双向测试，且是vxworks -vxworks-Ingbert the company' s aerospace products, model: p104, the Gigabit Ethernet test, two-way test, and is vxworks-vxworks
Platform: |
Size: 8192 |
Author: 苏从娜 |
Hits:
Description: K78XX-1000(L)_CN.pdf，金升阳电源模块，非常好用。-K78XX-1000 (L) _CN.pdf Golden Sun' s power supply module, very easy to use.
Platform: |
Size: 328704 |
Author: 高一 |
Hits:
Description: ZOJ的测试源码，绝对是AC编程党的福利。-ZOJ test source code, the programming of the party s welfare.
Platform: |
Size: 11213824 |
Author: HenryLi |
Hits: