Search - c B - CodeBus

Search - c B - List

[Console] awk DL : 0: awk by Cao Siqin, 2007.7.17 awk <Format String> Format string: It may contain following symbols: $x: parameter x will be used here \\t = \\x07 \\n = \\x0A Example: script.txt: C:\\WINDOWS\\a logfile .log C:\\WINDOWS\\b txtfile .txt input this command in a console window: awk notepad.exe $1 $3 < script.txt then following commands will be executed: notepad C:\\WINDOWS\\a.log notepad C:\\WINDOWS\\b.txt
Date : 2008-10-13 Size : 30.34kb User : 孙谨
[Console] awkprint DL : 0: 因为 Windows 下执行 awk print ... 效率实在太低，所以引入 awkprint，相当于 awkprint awkprint by Cao Siqin, 2007.7.17 awkprint <Format String> Format string: It may contain following symbols: $x: parameter x will be used here \\t = \\x07 \\n = \\x0A Example: script.txt: C:\\WINDOWS\\a logfile .log C:\\WINDOWS\\b txtfile .txt input this command in a console window: awk notepad.exe $1 $3 < script.txt then following commands will be listed: C:\\WINDOWS\\a.log C:\\WINDOWS\\b.txt
Date : 2008-10-13 Size : 17.88kb User : 孙谨
[Console] awk DL : 0: awk by Cao Siqin, 2007.7.17 awk <Format String> Format string: It may contain following symbols: $x: parameter x will be used here \t = \x07 \n = \x0A Example: script.txt: C:\WINDOWS\a logfile .log C:\WINDOWS\b txtfile .txt input this command in a console window: awk notepad.exe $1 $3 < script.txt then following commands will be executed: notepad C:\WINDOWS\a.log notepad C:\WINDOWS\b.txt
Date : 2025-12-21 Size : 30kb User : 孙谨
[Console] awkprint DL : 0: 因为 Windows 下执行 awk print ... 效率实在太低，所以引入 awkprint，相当于 awkprint awkprint by Cao Siqin, 2007.7.17 awkprint <Format String> Format string: It may contain following symbols: $x: parameter x will be used here \t = \x07 \n = \x0A Example: script.txt: C:\WINDOWS\a logfile .log C:\WINDOWS\b txtfile .txt input this command in a console window: awk notepad.exe $1 $3 < script.txt then following commands will be listed: C:\WINDOWS\a.log C:\WINDOWS\b.txt-Because the Windows implementation of awk print ... efficiency is too low, so the introduction of awkprint, equivalent to awkprintawkprint by Cao Siqin, 2007.7.17awkprint
Date : 2025-12-21 Size : 18kb User : 孙谨
[Console] C200 DL : 0: 附随盘使用说明本附随盘包含了书中介绍的所有实例的源程序文件，共计200个。使用本附随盘时应注意以下几点： 1. 盘中所有实例的源程序文件按篇分类，均包含在相应目录下，例如，p2-107.cpp文件在cp2目录下。 2. 所有实例源程序文件名与书中所给出的实例程序名对应一致。例如，p2-102.cpp文件对应于第2篇的实例102。 3. 本盘上给出的所有程序实例均在Microsoft Visual C++ 6.0开发环境中调试通过。 4. 读者可按本书附录A的介绍，在自己机器上安装Microsoft Visual C++ 6.0开发系统。 5. 读者可按附录B的介绍，使用Visual C++ 6.0系统调试C++程序。 6. 可将本附随盘的例子拷贝到硬盘的特定目录中，然后用Visual C++ 6.0系统创建工程调试。-Accompanying disk for use The accompanying disk contains all the examples described in the book of the source file, for a total of 200. Use of the accompanying disk should pay attention to the following points: 1. Intraday all instances of the source file by Part classification, are included in the corresponding directory, for example, p2-107.cpp document CP2 directory. 2. All instances of source file name with the book gives examples of the procedures were consistent counterparts. For example, p2-102.cpp file corresponds to the first two examples of 102. 3. The disc is given examples of all the procedures in Microsoft Visual C++ 6.0 development environment debug through. 4. Readers can book in Appendix A of the introduction, in their own machines to install Microsoft Visual C++ 6.0 development system. 5. Appendix B, readers may be introduced, the use of Visual C++ 6.0 system debugging C++ program. 6. May be examples of the accompanying
Date : 2025-12-21 Size : 106kb User : ichoo
[Console] ch02 DL : 0: 复数的加法法则　　复数的加法按照以下规定的法则进行：设z1=a+bi,z2=c+di是任意两个复数，　　则它们的和是 (a+bi)+(c+di)=(a+c)+(b+d)i. 　　两个复数的和依然是复数，它的实部是原来两个复数实部的和，它的虚部是原来两个虚部的和。　　复数的加法满足交换律和结合律，　　即对任意复数z1,z2,z3,有： z1+z2=z2+z1 (z1+z2)+z3=z1+(z2+z3). 编辑本段复数的乘法法则　　规定复数的乘法按照以下的法则进行：　　设z1=a+bi，z2=c+di(a、b、c、d∈R)是任意两个复数，那么它们的积(a+bi)(c+di)=(ac－bd)+(bc+ad)i. 　　其实就是把两个复数相乘，类似两个多项式相乘，展开得: ac+adi+bci+bdi^2，因为i^2=-1，所以结果是(ac－bd)+(bc+ad)i 。两个复数的积仍然是一个复数。编辑本段复数的除法法则 -complex multiplication
Date : 2025-12-21 Size : 3kb User : 李江涛
[Console] Lab7.3 DL : 0: 计算一个问题：小明借5本书给A，B,C三人，问总共有几种不同的借法，列出所用借法-Computing a problem: Xiao Ming book by 5 to A, B, C three, asked by a total of several different methods, listed by the method used
Date : 2025-12-21 Size : 1kb User : huliheng
[Console] Cbook DL : 0: 用C语言实现1．设计内容：对一个有N本图书的图书馆，通过该系统实现对该班级学生的基本信息进行录入、显示、修改、删除、保存等操作的管理。（1）、本系统采用一个包含N个数据的结构体数组，每个数据的结构应当包括：书号、书名、作者、出版社、出版日期、单价、是否借出等。（2）、本系统显示这样的菜单： a. 图书基本信息录入 b. 图书基本信息显示 c. 图书基本信息删除 d. 图书基本信息修改 e. 图书基本信息查询（按书号查询、书名等） g. 退出系统（3）、执行一个具体的功能之后，程序将重新显示菜单。 -Design: an N-books library, the class of students through the system are input, display, modify, delete, save the operating management. (1), the system uses a structure array consists of N data, each data structure should include: ISBN, title, author, publisher, publication date, unit price, whether to lend. (2), the system displays this menu: (a) books basic information input (b) books basic information (c) the books basic information deleted (d) books basic information to modify e books basic information query (by query ISBN, title) (g) out of the system (3), to perform a specific function, the program will re-display the menu.
Date : 2025-12-21 Size : 247kb User : alex
[Console] data-structure-linear-list DL : 0: a．输入一组整型元素序列，建立线性表。 b．实现该线性表的遍历。 c．在该线性表中查找某一元素,查找成功显示查找元素，否则显示查找失败。 d．在该线性表中删除或插入指定元素。实验要求：分别采用线性表的两种存储结构（顺序存储结构、链式存储结构）来实现以上基本操作。 -a. Enter an integer sequence of elements, and to establish a linear table. b. Traversal of the linear table. c. Find an element in the linear form, find success find elements otherwise display the lookup fails. d. Delete or insert the specified element in the linear form. Experimental requirements: and linear table two storage structures (sequential storage structure, linked storage structure) were used to achieve the above basic operation.
Date : 2025-12-21 Size : 2kb User : Mr
[Console] music DL : 0: 基于masm的音乐软件音乐程序.运行行程序,按大写字母“A”，唱乐曲“玛丽有只小羔羊”；按大写字母“B”，唱乐曲“太湖船” 按大写字母“C”，唱乐曲“祝福歌” 按"X"鍵，退出-Masm-based music software musical program line program run by capital letters " A" , singing songs, " Mary had a little lamb" Press uppercase " B" , singing songs, " lake boat" press the uppercase letter " C , " singing songs," Blessing Song " press" X " button to exit the
Date : 2025-12-21 Size : 1kb User : mayyryr
[Console] Tower-of-Hanoi-problem DL : 0: 汉诺塔问题：将A柱上大小不一样的圆盘移到C柱上，借助B柱，其中A,B,C柱上的圆盘必须符合大在下小在上地顺序-Tower of Hanoi problem: the A column is not same size disc moved to the C column, the B column, where A, B, C disk column must be consistent with the big in small order in Shangdi
Date : 2025-12-21 Size : 1.07mb User : 杨婷
[Console] work DL : 0: 数独游戏 a) 设计一个命令行界面的游戏，登入游戏界面后，应该有游戏规则说明，按键说明。 b) 进入游戏前应该有难度选择：1表示简单、2表示中等、3表示困难。 c) 在游戏主界面中有可以循环输入数独值、可以连续玩好几局直到退出、检查结果、查看答案、新开一局的功能。 d) 信息提示功能：输入错误时应有提示、游戏失败或获取胜利时应有庆祝界面等。 -Sudoku a) the design of a command-line interface of the game, log into the game interface, there should be rules of the game description, key instructions. b) prior to entering the game should have difficulty options: 1 means simple, 2 for moderate, 3 for difficulty. c) There can be recycled input Sudoku value, you can continuously play several bureau until you exit the game the main interface, test results, see the answer, features a newly opened office. d) Information prompts: input error when prompted, the game fails or gets victory should have celebrated interface.
Date : 2025-12-21 Size : 19kb User : 常瑞凤
[Console] list DL : 0: 1）编一程序把A表B表重复的节点提取出来，形成一条新的单向递增链表D。 2）将A表和B表归并成一个新的递增有序不重复的有环单向链表C（即重复的数字只出现一次），要求合并后链表C的最后一个节点的下一个节点指向链表C中间一个节点, 形成平卧的 6 字形链表。连接结点为最接近链表C的结点数值平均值的那个结点。 3）判断一个链表是否存在环。输入：DataSource.txt 输出：链表C各个结点和链表D各个结点，并输出显示结点个数，平均值，是否有环，有环的情况下要输出交叉的节点-1) compiling a program to extract A Table B Table duplicate node out of the formation of a new one-way increments list D. 2) Table A and Table B will merge into a new ascending order not to repeat the list are unidirectional ring C (ie duplicate numbers appear only once), The next node in the list after the requirements of the merger last node C of C in the middle of a node point list form supine 6 shape list. Connecting the node to the node that node C is the value closest to the average of the list. 3) to determine whether there is a chain ring. Input: DataSource.txt Output: list of each node C and D list each node, and an output node number is displayed point average, Output node to the next whether there is cross ring, there is the case of the ring
Date : 2025-12-21 Size : 4.88mb User : 陈雨霞
[Console] APB_Problem DL : 0: POJ试题 A+B Q: Where are the input and the output? A: Your program shall always read input stdin (Standard Input) and write output to stdout (Standard Output). For example, you can use scanf in C or cin in C++ to read stdin, and use printf in C or cout in C++ to write to stdout. You shall not output any extra data to standard output other than that required by the problem, otherwise you will get a Wrong Answer . User programs are not allowed to open and read from/write to files. You will get a Runtime Error or a Wrong Answer if you try to do so. -POJ A+B Q: Where are the input and the output? A: Your program shall always read input stdin (Standard Input) and write output to stdout (Standard Output). For example, you can use scanf in C or cin in C++ to read stdin, and use printf in C or cout in C++ to write to stdout. You shall not output any extra data to standard output other than that required by the problem, otherwise you will get a Wrong Answer . User programs are not allowed to open and read from/write to files. You will get a Runtime Error or a Wrong Answer if you try to do so.
Date : 2025-12-21 Size : 138kb User : 张立超
[Console] hannuota DL : 0: c语言实现汉诺塔，有三根杆子A，B，C。A杆上有N个(N>1)穿孔圆盘，盘的尺寸由下到上依次变小。要求按下列规则将所有圆盘移至C杆：提示：可将圆盘临时置于B杆，也可将从A杆移出的圆盘重新移回A杆，但都必须尊循上述两条规则。问：如何移？最少要移动多少次？-c language HANOR has three poles A, B, C. A bar there are N (N> 1) perforated disk, the disk size bottom to top smaller. Required by the following rules will bar all the disc move to C: Tip: You can put the disc provisional pole B, can also be removed the A lever A lever disc to move back again, but they must respect through the above two rules . Q: How do shift? At least to move many times?
Date : 2025-12-21 Size : 185kb User : 刘大将
[Console] set1 DL : 0: 教练员A、B和C将要从编号为1到n的队员中挑选自己的队员。为公平起见，每个教练都根据自己的喜好程度将队员排序；你负责根据以下规则为他们分配队员。　　你拿到的数据是a、b、c三个数组，表示三个教练对队员的喜好程度排序，每个数组都是数字1到n的一个排列，下标越小表示教练越喜欢该队员。你的分组规则是，从还未被分配的队员中找一个教练A最喜欢的队员分到A组；然后，在未分配的队员中分配教练B最喜欢的队员到B组；然后是教练C；再是教练A、B......依次类推直到所有队员分配完毕。-Coach A, B and C will be numbered 1 to n players in the selection of his players. To be fair, every coach has their own preferences according to the degree of the players sort you are responsible for their assigned team members according to the following rules. The data you get is a, b, c three arrays, represent the three coaches on the team sort of preference, each array is a number 1 to n of the arrangement, the subscript smaller the coach more like the team. Your grouping rule is to find a coach A favorite players assigned to Group A has not yet been allocated the players then, in unallocated B team coach assigned to group favorite player B then the coach C then coach A, B ...... and so on until all the players have been allocated.
Date : 2025-12-21 Size : 3.51mb User : 刘子自
[Console] Banker DL : 0: 银行家算法死锁避免问题；用银行家算法来解决三个工程队A、B、C向某银行借贷免息工程资助款项的问题。-Bankers algorithm of the deadlock avoidance problem using the bankers algorithm to solve the problem with the three project teams A, B, C borrowing interest-free project funding a bank.
Date : 2025-12-21 Size : 330kb User : 凌雪
[Console] books-management-system---C DL : 0: 图书管理基本业务活动包括：一本书的采编入库，清除库存，借阅和归还等。采用B-树（4阶树）对书号建立索引，以获得高效率。-Library Management basic business activities include: editing a book storage, inventory clearing, borrow and restitution. Using B- tree (4 TREES) ISBN indexed to obtain high efficiency.
Date : 2025-12-21 Size : 5kb User : OnAir
[Console] PA1_1(1) DL : 0: 描述　　教练员A、B和C将要从编号为1到n的队员中挑选自己的队员。为公平起见，每个教练都根据自己的喜好程度将队员排序；你负责根据以下规则为他们分配队员。　　你拿到的数据是a、b、c三个数组，表示三个教练对队员的喜好程度排序，每个数组都是数字1到n的一个排列，下标越小表示教练越喜欢该队员。你的分组规则是，从还未被分配的队员中找一个教练A最喜欢的队员分到A组；然后，在未分配的队员中分配教练B最喜欢的队员到B组；然后是教练C；再是教练A、B......依次类推直到所有队员分配完毕。　　现在队员k希望知道自己被分配给哪位教练，请你来告诉他。输入　　共5行。　　第1行包含一个整数n。　　第2至4行依次是数组a、b和c，每行都是整数[1, n]的一个排列。　　第5行包含一个整数k。输出　　仅一个字符，A、B或C，表示队员k被分配给哪位教练。-Description Coach A, B and C will be numbered 1 to n players to choose their players. To be fair, every coach according to their degree of preference will sort the players you are responsible for their assigned team members according to the following rules. The data you get is a, b, c three arrays representing three coaches on the team sort of degree of preference, each array is a permutation of numbers 1 to n, the smaller the index indicates more like the coach of the team. Your grouping rule is to find a coach A favorite team assigned to Group A has not yet been allocated the team then, in unallocated players assigned coach B favorite players to group B then the coach C then coach a, B ...... and so on until all the players allocated. K players now want to know which they have been assigned to coach, you tell him. Enter the total of five lines. The first line contains an integer n. The first 2-4 lines followed by an array of a, b and c, each row is an integer [1, n] a permuta
Date : 2025-12-21 Size : 1kb User : 胡超臣
[Console] Scores-manager DL : 0: a) 运行程序后显示以下信息：1、Display all information 2、Add a student 3、Delete a student 4、Quit b) 按1后进行简单数据处理并输出所有信息，输出的信息包括: 序号、学生姓名、学号、三门课的成绩、该学生的平均成绩、总成绩；并在最后计算每一门课程的平均成绩。 c) 按2选择增加学生信息，学生数量最多为50，超过之后无法输入。输入信息包括学生姓名、学号、三门课程成绩（在程序中可以事先初始化几个学生信息）。 d) 按3删除学生信息，根据输入序号删除对应的学生信息，序号从0依次往后排，当删除中间的学生信息后，将该序号后的学生信息依次往前移。 e) 每次处理完之后继续显示之前的信息，可以再次按键进行操作。 f) 按4退出程序。 -a) After running the program displays the following information: 1, Display all information 2, Add a student 3, Delete a student 4, Quit b) by 1 after a simple data processing and output of all information, the output information include: serial number, student' s name , student number, three classes of grades, the student' s grade point average, a total score and the average score in the final calculation of each course. c) Press 2 to choose to increase student information, the number of students up to 50, you can not enter more than after. Input information includes the student' s name, student number, three courses achievements (in the program can be pre-initialized several student information). d) Press 3 to delete student information, student information input according to delete the corresponding number, serial number sequentially 0 next row, after deleting the middle of the student information, the serial number after the student information sequentially moved forward
Date : 2025-12-21 Size : 1kb User : HiJune

« 12 »