Search - a-w - CodeBus

Search - a-w - List

[CSharp] EULER1 DL : 0: Euler 回路问题 .问题描述：对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务：对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入：由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。-Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.
Date : 2008-10-13 Size : 60.57kb User : 无翼
[CSharp] smtpconsole_src DL : 0: A Csharp class to send email.hese managed wrappers wrap each of the methods on the original interfaces and correctly communicate with the unmanaged server. In addition, some of the original methods are exposed as properties instead of pairs of methods. For example, all pairs of Set and Query methods are exposed as properties-Csharp managed to send email.hese w rappers wrap each of the methods on the original interfaces and correctly communicate with the unmanaged server. In addition, some of the original methods are exposed as prop erties instead of pairs of methods. For example , all pairs of Set and Query methods are exposed a 's properties
Date : 2008-10-13 Size : 22.3kb User : maicklove
[CSharp] chengjun DL : 0: 参加运动会有n个学校，学校编号为1……n。比赛分成m个男子项目，和w个女子项目。项目编号为男子1……m，女子m+1……m+w。-participate in the Games with n, the school No. 1 ... n. The competition is divided into m man, a woman and w projects. Item No. 1 man ... m, a woman m m w ....
Date : 2008-10-13 Size : 10.61kb User : 程军
[CSharp] TankGame DL : 0: 一个.NET控件移动实验。可以按W A S D 控制坦克移动，转向，遇到边界不出界面。
Date : 2008-10-13 Size : 14.33kb User : 丁德峰
[CSharp] r-A.M.R.W.Joiner DL : 0: 一个用与流媒体格式转换的程序-used with a streaming media format conversion process
Date : 2008-10-13 Size : 10.89kb User : 邪恶
[CSharp] r-A.M.R.W.Joiner DL : 0: Date : 2025-12-29 Size : 11kb User : 邪恶
[CSharp] EULER1 DL : 0: Euler 回路问题 .问题描述：对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务：对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入：由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。-Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.
Date : 2025-12-29 Size : 60kb User : 无翼
[CSharp] smtpconsole_src DL : 0: A Csharp class to send email.hese managed wrappers wrap each of the methods on the original interfaces and correctly communicate with the unmanaged server. In addition, some of the original methods are exposed as properties instead of pairs of methods. For example, all pairs of Set and Query methods are exposed as properties-Csharp managed to send email.hese w rappers wrap each of the methods on the original interfaces and correctly communicate with the unmanaged server. In addition, some of the original methods are exposed as prop erties instead of pairs of methods. For example , all pairs of Set and Query methods are exposed a 's properties
Date : 2025-12-29 Size : 22kb User : maicklove
[CSharp] chengjun DL : 0: 参加运动会有n个学校，学校编号为1……n。比赛分成m个男子项目，和w个女子项目。项目编号为男子1……m，女子m+1……m+w。-participate in the Games with n, the school No. 1 ... n. The competition is divided into m man, a woman and w projects. Item No. 1 man ... m, a woman m m w ....
Date : 2025-12-29 Size : 256kb User : 程军
[CSharp] TankGame DL : 0: 一个.NET控件移动实验。可以按W A S D 控制坦克移动，转向，遇到边界不出界面。-1. NET controls the mobile experiment. WASD control tanks can move, turn, encountered no border interface.
Date : 2025-12-29 Size : 25kb User : 丁德峰
[CSharp] yundonghui DL : 0: 参加运动会的n个学校编号为1~n，比赛分成m个男子项目和w个女子项目，项目编号分别为1~m和m+1~m+w。有些项目取前五名，得分依次为6，4，3，2，1；有些项目取前三名，得分依次为4，2，1。写一程序产生各学校的成绩单（包括各校所取得的每项成绩的项目号、成绩、姓名和得分）和团体总分报表（包括校号、男子团体总分、女子团体总分和团体总分）-To participate in the Games n school No. 1 ~ n, competition is divided into m men and a woman w projects numbered 1 ~ m and m+ 1 ~ m+ W. Some of these projects take the top five, followed by scoring 6,4,3,2,1 some of the items, check the top three scores were 4,2,1. Procedures to write a report card to schools (including schools achieved results for each item number, results, names and scores) and the groups total statements (including the school number, men s team scores, women s groups and groups Total Total)
Date : 2025-12-29 Size : 124kb User : 曾燕萍
[CSharp] zuixiaoquandingdianfugai DL : 0: 给定一个赋权无向图G=(V,E)，每个定点v∈U都有一个权值w(v)。如果U V，且对任意(u,v)∈E有u∈U或v∈U，就称U为图G的一个定点覆盖。G的最小权顶点覆盖是指G中所含顶点权之和最小的顶点覆盖。-Empowering given a undirected graph G = (V, E), each point v ∈ U has a weight w (v). If the UV, and for any (u, v) ∈ E there is u ∈ U or v ∈ U, on U that map G to a fixed-point coverage. G the right to the minimum vertex cover is contained in G refers to the right vertex of the vertex cover and minimum.
Date : 2025-12-29 Size : 50kb User : 无疆
[CSharp] Babot_wow_Helper_SourceCode_Csharp090810 DL : 0: Babbot是一个C#写的Wow辅助工具，也称外挂。能够实现路点，执行自定义lua脚本等外挂功能。 -Babbot is a C# written aids Wow, also known as plug-ins. Road can be achieved, the implementation of lua script, such as custom plug-in function.
Date : 2025-12-29 Size : 9.6mb User : shepcom
[CSharp] weekday DL : 0: 算法如下：基姆拉尔森计算公式 W= (d+2*m+3*(m+1)/5+y+y/4-y/100+y/400) mod 7 在公式中d表示日期中的日数，m表示月份数，y表示年数。注意：在公式中有个与其他公式不同的地方：把一月和二月看成是上一年的十三月和十四月，例：如果是2004-1-10则换算成：2003-13-10来代入公式计算。-Algorithm is as follows:基姆拉尔森formula W = (d+2* m+3* (m+1)/5+ y+ y/4-y/100+ y/400) mod 7 in the formula d said the date the number of days, m said the number of months, y said that the number of years. Note: In the formula and other formulas have a different place: the January and February as the previous year Shisan Yue and Shi Siyue, example: if it is then converted into 2004-1-10: 2003-- 13-10 to represent into the formula.
Date : 2025-12-29 Size : 1kb User : super_duck
[CSharp] FamilyShow DL : 0: 用C#和WPF库开发的浏览家族谱系的软件，学习WPF界面开发技术的很好的Sample。-A sample Family Clan browser application developed with C# and WPF library a good learning sample for WPF.
Date : 2025-12-29 Size : 983kb User : YangDan
[CSharp] CW-Saving DL : 0: 用csharp给车辆路径问题写的节约算法，用arraylist实现路径的存储，很适合初接触车辆路径问题或csharp编程的朋友。另外考虑了对于循环取货所需要的1比1空箱返回。-A C# Code for CVRP with empty containers exchange. The Algorithms is the classical Clarke-Wright Saving Algorithms. Also realized with arraylist, which could be helpful for friends who want to learn c#
Date : 2025-12-29 Size : 41kb User : Chen WZ
[CSharp] wpf_CustomCursorDemo DL : 0: WPF 自定义鼠标形状Cursor示例，并非从外界导入鼠标文件，而是自己用C#程序画一个鼠标形状，比如矩形，圆形或是多边形甚至组合图形。-WPF Custom Mouse Cursor shape example, the mouse does not import files from the outside, but their own C# program using the mouse to draw a shape, such as rectangular, circular or polygon or combination of graphics.
Date : 2025-12-29 Size : 19kb User : wan yiqian
[CSharp] knapsack DL : 0: C语言背包问题 Given n objects and a "knapsack." Item i weighs wi > 0 kilograms and has value vi > 0. ◦ Knapsack has capacity of W kilograms. ◦ Goal: fill knapsack so as to maximize total value.-C-Knapsack Problem Given n objects and a " knapsack." Item i weighs wi> 0 kilograms and has value vi> 0. ◦ Knapsack has capacity of W kilograms. ◦ Goal: fill knapsack so as to maximize total value.
Date : 2025-12-29 Size : 227kb User : 潘越
[CSharp] Weapon DL : 0: 1）、定义一个抽象类Weapon,该抽象类有两个抽象方法attack()，move()：这两个方法分别表示武器的攻击方式和移动方式。（2）、定义3个类：Tank,Flighter,WarShip都继承自Weapon,分别用不同的方式实现Weapon 类中的抽象方法。（3）、写一个类Army,代表一支军队，这个类有一个属性是Weapon数组w（用来存储该军队所拥有的所有武器）；该类还提供一个构造方法，在构造方法里通过传一个int类型的参数来限定该类所能拥有的最大武器数量,并用这一大小来初始化数组w。该类还提供一个方法addWeapon(Weapon wa),表示把参数wa所代表的武器加入到数组w中。在这个类中还定义两个方法attackAll()和moveAll()，让w数组中的所有武器攻击和移动。（4）、写一个主方法去测试以上程序。 -1), defines an abstract class Weapon, the abstract class has two abstract methods attack (), move (): These two methods represent the weapons attacks and moves. (2), defines three classes: Tank, Flighter, WarShip are inherited from the Weapon, respectively, in different ways to achieve Weapon Class abstract methods. (3), write a class Army, on behalf of an army, this class has a property is an array of Weapon w (used to store all of the weapons owned by the armed forces) class provides a constructor in the constructor through the mass a parameter of type int to limit the class can have the maximum number of weapons, and to initialize the array with the size of the w. The class also provides a method addWeapon (Weapon wa), that represent the parameters wa added to the array w of weapons. In this class also defines two methods attackAll () and moveAll (), let w array and move all the weapons to attack. (4), write a main method to test the above procedure.
Date : 2025-12-29 Size : 32kb User : liuxiao
[CSharp] Snake DL : 0: 蛇的活动区是由57×33个小方格组成，当这些小方格呈现深灰色时，便表示蛇身。蛇是由n个相邻的方格组成，将这些方格的坐标依蛇头到蛇尾的次序放入到一个数组中便代表了蛇身。当蛇在活动区中游动一格时，所对应的的数组操作为，将新的位置坐标插入到数组的头部，同时将数组中最后一个元素删除。游戏使用四个方向键和A/W/S/D来控制蛇的前进方向，在OnKeyDown()消息处理函数中，根据不同的方向键设置了成员变量m_nDirect的值。当在菜单中选择开始时，启动定时器，游戏开始。在定时器消息处理函数中，根据m_nDirect的值判断出蛇的下一个位置。如果没有超出边界或碰到自身，则蛇可以移动到一个新位置。如果吃到了食物，则在CArray()中只插入而不删除最后一个元素，蛇身长度增加，否则弹出游戏结束对话框，框内显示所用时间和最终得分。菜单栏的项目以实用性为主，另外每个按钮都设置有快捷键，分别为：F1-帮助；F2-开始游戏；F4-关闭窗口，退出游戏 -The snake s activity area is composed by 57 × 33 small squares, when these small squares presented a dark gray, and they said the snake. Snake n adjacent squares, the grid coordinates to the tail of the order in accordance with snakeheads into it on behalf of the snake into an array. Snake swimming in the activity area grid array operation corresponding to the new location coordinates inserted into the head of the array, while the last element in the array to delete. The game uses the four arrow keys and A/W/the S/D to control the forward direction of the snake, OnKeyDown () message processing function, depending on the direction of the key to set the value of the member variables m_nDirect. When in the menu, select Start to start the timer, the start of the game. In the the timer message processing function, based on the value of m_nDirect determine the next position of the snake. If there is no out of bounds or encounter itself, the snake can move to a new location. If you eat the f
Date : 2025-12-29 Size : 72kb User : 吴忠

« 12 »