Description: « 问题描述：在一个列车调度站中，k条轨道连接到k条侧轨处，形成k个铁路转轨栈，从左到右依次记为H1，H2，…，Hk如下图所示。其中左边轨道为车皮入口（记为H0），右边轨道为出口（记为Hk+1），，编号为a , a , ,an 1 2 的n 个车皮从入口依次进入转轨栈，由调度室安排车皮进出栈次序，并对车皮按其出栈次序重新排序为1，2，…，n。调度室在安排车皮进出栈次序时，遵循以下规则：（1） 车皮入口H0处的车皮可以进入转轨栈H1，H2，…，Hk之一，或直接进入车皮出口Hk+1。（2） 转轨栈H1，H2，…，Hk处的车皮可以进入车皮出口Hk+« 编程任务：给定正整数n，和n个车皮的初始编号n a , a , ,a 1 2 ，编程计算最少需要多少个转轨栈才能按照规则（1）和（2）调度车皮，使车皮在车皮出口按照1，2，…，n的顺序输出。« 数据输入：由文件input.txt 给出输入数据。第1 行有1 个正整数n，表示有n 个车皮。第2 行是n个车皮的初始编号n a , a , ,a 1 2 。« 结果输出:将计算出的最少转轨栈数输出到文件output.txt。输入文件示例 输出文件示例input.txt output.txt42 3 4 13-laquo; Problem description : In a train station, k, k track connected to the side of the tracks, forming k stack rail transition from left to right followed credited to H1, H2, ..., Hk as in the figure below. Which left orbit for imported cars (credited to H0), the right track for exports (credited as a Hk), and numbered a, a, and an 1 2 # 61516; The n followed by wagon from the entrance into the stack transition from the dispatch room arrangements wagon Stack access priorities, as well as cars stack up according to reorder priorities for 1,2, ..., n. The dispatch room in arranging access stack wagon order, to abide by the following rules : (1) H0 wagon entrance of cars can enter the transition stack H1, H2, ..., Hk, or directly into a wagon export Hk. (2) Transition stack H1, H2, ..., Hk Platform: |
Size: 976 |
Author:林天 |
Hits:
Description: 进程优先算法,进程调度是处理机管理的核心内容。本实验要求用C语言编写和调试一个简单的进程调度程序。通过本实验可以加深理解有关进程控制块、进程队列的概念，并体会和了解优先数和时间片轮转调度算法的具体实施办法-process priority algorithm, the process of scheduling processor is the core content management. The experiment called for using the C language and debug a simple process scheduler. Through this experiment can deepen our understanding of the process control block, the concept of the process of formation and to experience and understand a few priorities and time-Cycle Scheduling Algorithm of concrete measures for implementation Platform: |
Size: 1717 |
Author:yuyu |
Hits:
Description: 一个java的web的聊天的程序的服务端（同上面的配套使用）-The web of a java chat client service procedures (with supporting the use of the above) Platform: |
Size: 18432 |
Author:站长 |
Hits:
Description: « 问题描述：在一个列车调度站中，k条轨道连接到k条侧轨处，形成k个铁路转轨栈，从左到右依次记为H1，H2，…，Hk如下图所示。其中左边轨道为车皮入口（记为H0），右边轨道为出口（记为Hk+1），，编号为a , a , ,an 1 2 的n 个车皮从入口依次进入转轨栈，由调度室安排车皮进出栈次序，并对车皮按其出栈次序重新排序为1，2，…，n。调度室在安排车皮进出栈次序时，遵循以下规则：（1） 车皮入口H0处的车皮可以进入转轨栈H1，H2，…，Hk之一，或直接进入车皮出口Hk+1。（2） 转轨栈H1，H2，…，Hk处的车皮可以进入车皮出口Hk+« 编程任务：给定正整数n，和n个车皮的初始编号n a , a , ,a 1 2 ，编程计算最少需要多少个转轨栈才能按照规则（1）和（2）调度车皮，使车皮在车皮出口按照1，2，…，n的顺序输出。« 数据输入：由文件input.txt 给出输入数据。第1 行有1 个正整数n，表示有n 个车皮。第2 行是n个车皮的初始编号n a , a , ,a 1 2 。« 结果输出:将计算出的最少转轨栈数输出到文件output.txt。输入文件示例 输出文件示例input.txt output.txt42 3 4 13-laquo; Problem description : In a train station, k, k track connected to the side of the tracks, forming k stack rail transition from left to right followed credited to H1, H2, ..., Hk as in the figure below. Which left orbit for imported cars (credited to H0), the right track for exports (credited as a Hk), and numbered a, a, and an 1 2# 61516; The n followed by wagon from the entrance into the stack transition from the dispatch room arrangements wagon Stack access priorities, as well as cars stack up according to reorder priorities for 1,2, ..., n. The dispatch room in arranging access stack wagon order, to abide by the following rules : (1) H0 wagon entrance of cars can enter the transition stack H1, H2, ..., Hk, or directly into a wagon export Hk. (2) Transition stack H1, H2, ..., Hk Platform: |
Size: 1024 |
Author:林天 |
Hits:
Description: 进程优先算法,进程调度是处理机管理的核心内容。本实验要求用C语言编写和调试一个简单的进程调度程序。通过本实验可以加深理解有关进程控制块、进程队列的概念，并体会和了解优先数和时间片轮转调度算法的具体实施办法-process priority algorithm, the process of scheduling processor is the core content management. The experiment called for using the C language and debug a simple process scheduler. Through this experiment can deepen our understanding of the process control block, the concept of the process of formation and to experience and understand a few priorities and time-Cycle Scheduling Algorithm of concrete measures for implementation Platform: |
Size: 1024 |
Author:yuyu |
Hits:
Description: 最优车皮排序问题
.问题描述：
在一个列车调度站中，k 条轨道连接到k 条侧轨处，形成k 个铁路转轨栈，从左到右依
次记为H1，H2，…，Hk 如下图所示。其中左边轨道为车皮入口（记为H0），右边轨道为出
口（记为Hk+1），编号为a1, a2,.,an 的n 个车皮从入口依次进入转轨栈，由调度室安排车
皮进出栈次序，并对车皮按其出栈次序重新排序为1，2，…，n。
调度室在安排车皮进出栈次序时，遵循以下规则：
（1）
车皮入口H0 处的车皮可以进入转轨栈H1，H2，…，Hk 之一，或直接进入车
皮出口Hk+1 。
（2）
转轨栈H1，H2，…，Hk 处的车皮可以进入车皮出口Hk+1 。
.编程任务：
给定正整数n，和n 个车皮的初始编号a1, a2,.,an ，编程计算最少需要多少个转轨栈
才能按照规则（1）和（2）调度车皮，使车皮在车皮出口按照1，2，…，n 的顺序输出。
.数据输入：
由文件input.txt 给出输入数据。第1 行有1 个正整数n，表示有n 个车皮。第2 行是n
个车皮的初始编号a1, a2,.,an 。-wagon optimal scheduling problem. Problem description : In a train station, k, k track connected to the side of the tracks, forming k stack rail transition from left to right followed credited to H1, H2, ..., Hk as in the figure below. Which left orbit for imported cars (credited to H0), the right track for exports (credited as a Hk), the No. a1, a2,. , An n-wagon from the entrance into the transition stack followed by the dispatch room arrangements wagon Stack access priorities, as well as cars stack up according to the order reordering of 1,2, ..., n. The dispatch room in arranging access stack wagon order, to abide by the following rules : (1) H0 wagon entrance of cars can enter the transition stack H1, H2, ..., Hk, or directly into a wagon export Hk. (2) Transition stack H1, H2, ..., H Platform: |
Size: 29696 |
Author:无翼 |
Hits:
Description: 最优平行轨道车皮排序问题
.问题描述：
在一个列车调度站中，k 条轨道平行连接到1 条侧轨处，形成1 条主轨道和k-1 条辅助
调度轨道。主轨道记为Hk，辅助轨道从下到上依次记为H1，H2，…，Hk-1 如下图所示。其
中主轨道左边为车皮入口（记为H0），主轨道右边为出口（仍记为Hk）。编号为a1, a2,L,an
的n 个车皮从入口依次进入主轨道，由调度室安排车皮进出轨次序，并对车皮按其出轨次序
重新排序为1，2，…，n。
调度室在安排车皮进出轨次序时，遵循以下规则：
（1）
车皮入口H0 处的车皮可以进入辅助轨道H1，H2，…，Hk-1 之一，或直接进
入车皮出口Hk。
（2）
辅助轨道H1，H2，…，Hk-1 处的车皮可以进入车皮出口Hk。
.编程任务：
给定正整数n，和n 个车皮的初始编号a1, a2,L,an ，编程计算最少需要多少个平行轨
道才能按照规则（1）和（2）调度车皮，使车皮在车皮出口按照1，2，…，n 的顺序输出。
.数据输入：
由文件input.txt 给出输入数据。第1 行有1 个正整数n，表示有n 个车皮。第2 行是n
个车皮的初始编号a1, a2,L,an 。
.结果输出:
将计算出的最少平行轨道数输出到文件output.txt 。-optimal parallel tracks wagon scheduling problem. Problem description : In a train station, k parallel track connected to a side track, the formation of a main track and k-assisted dispatching an orbit. The main track is recorded as Hk, auxiliary track from the next turn of the last recorded as H1, H2, ..., Hk-1 are shown in Fig. Including the main track entrance to the left of the wagon (credited to H0), the main track of the right to export (still recorded as Hk). No. a1, a2, L, an n-wagons from the main entrance into orbit followed by the dispatch room arrangements into cars derailed priorities, as well as cars derailed according to reorder priorities 1,2, ..., n. Room scheduling arrangements in order wagon into the derailment, to abide by the following rules : (1) H0 wagon entrance of Platform: |
Size: 62464 |
Author:stzxxxstz |
Hits:
Description: CSS就是Cascading Style Sheets，中文翻译为“层叠样式表”，简称样式表，它是一种制作网页的新技术。
网页设计最初是用HTML标记来定义页面文档及格式，例如标题<h1>、段落<p>、表格<table>、链接<a>等，但这些标记不能满足更多的文档样式需求，为了解决这个问题，在1997年W3C(The World Wide Web Consortium)颁布HTML4标准的同时也公布了有关样式表的第一个标准CSS1, 自CSS1的版本之后，又在1998年5月发布了CSS2版本，样式表得到了更多的充实。W3C把DHTML(Dynamic HTML)分为三个部分来实现：脚本语言(包括JavaScript、Vbscript等)、支持动态效果的浏览器(包括Internet Explorer、Netscape Navigator等)和CSS样式表。
-CSS is Cascading Style Sheets. the Chinese translation for "cascading style sheet," which is abbreviated style sheet, it is a website production of new technologies. Web page design was first used to define HTML tags and page document formats, such as title Platform: |
Size: 326656 |
Author:李强 |
Hits:
Description: 三星E808水改机H1版刷机程序。行机和马行勿用。-water diverted for H1 version Brush procedures. OK machines and horse OK not to use. Platform: |
Size: 5110784 |
Author:力杰 |
Hits:
Description: 用线性缓冲区和间接寻址方法实现FIR滤波器 *
*N=5,y(n)=h0*x(n)+h1*x(n-1)+h2*x(n-2)+h3*x(n-3)+h4*x(n-4)-Linear buffer and indirect methods of addressing realize FIR filter** N = 5, y (n) = h0* x (n)+ H1* x (n-1)+ H2* x (n-2 )+ h3* x (n-3)+ h4* x (n-4) Platform: |
Size: 1024 |
Author:hhh |
Hits:
Description: 用线性缓冲区和带移位双操作数寻址方法实现FIR滤波器 *
*N=5,y(n)=h0*x(n)+h1*x(n-1)+h2*x(n-2)+h3*x(n-3)+h4*x(n-4)*-Linear buffer and with double-shift operand addressing methods realize FIR filter** N = 5, y (n) = h0* x (n)+ H1* x (n-1)+ H2* x (n-2)+ h3* x (n-3)+ h4* x (n-4)* Platform: |
Size: 1024 |
Author:hhh |
Hits:
Search - h1