Search - k matrix

Search - k matrix - List

[JSP/Java] maze DL : 0: 你的朋友Jefferson在一个二维迷宫（可以视为是有N*M个格子的方阵）中迷了路，他目前只知道他的起始坐标（startX, startY）和他需要抵达的目的地坐标（destX, destY）。然而迷宫中有许多格子是不能进入的，还有一些格子是收费的——要知道Jefferson手头的现金（cash）极其有限。所以现在你需要写一个程序来帮助他：给出一条步数最短的路径，让Jefferson能够用手头的现金抵达目的地。 1. 迷宫表示，迷宫用一个二维矩阵表示。当用户输入N,M后，计算机随机生成一个N*M的迷宫，并显示出来。注意迷宫全封闭，在其边界必须为*，一个合法的迷宫输入可以是： ****** *0500* *1120* *0000* ****** 其中，第i行j列如果是： 0：代表空格子 *：代表不能进入的格子 k(1<=k<=9)：代表进入该格子将一次性收取费用k 2. 用户可以输入起始坐标起始坐标（startX, startY）和他需要抵达的目的地坐标（destX, destY），以及手中的Cash 3. 输出详细路径，步数，以及此步数下的花费，示例如下： (2,2)-(2,3)-(2,4) step:2 cost:5 4. 注意：（1）最短的路径有可能有多条；（2）也可能不能找到利用手头的现金完成旅行的答案-Your friend Jefferson in a two-dimensional maze (which can be seen as a N* M a grid of squares) in lost Way, he now knew his starting coordinates (startX, startY) and he needs to reach the destination coordinates ( destX, destY). However, there are many lattice maze is inaccessible, and some for a fee lattice - To know Jefferson cash on hand (cash) is extremely limited. So now you need to write a program To help him: a step given the number of shortest path, so that Jefferson could use the cash on hand at destination . 1. Maze that maze with a two-dimensional matrix. When the user input N, M, the computer An N* M randomly generated maze, and displayed. Note that the whole maze closed its borders must be* A legal labyrinth input can be: ****** 0500** * 1120* * 0000* ****** Among them, first column i row j if: 0: on behalf of sub-space *: Representatives can not enter the lattice k (1 <= k <= 9): representative of the grid will be a one-time charge k
Date : 2025-12-29 Size : 2kb User : 张强
[JSP/Java] MaxCut DL : 0: This program implement the Max cut Max_Cut algorithm , as a deterministic algorithm using a pair wise method , which force the algorithm for deterministic solution with solution better then |E|/2 the graph is implemented using an adjacent matrix, the nodes are chosen randomaly k = the number of bits for represntation n = 2^k -1 The pair wise method implement as a matrix , using a XOR command, the columns in the matrix represent all of the sub -groups in a pair wise way Good luck Shahar -This program implement the Max cut Max_Cut algorithm , as a deterministic algorithm using a pair wise method , which force the algorithm for deterministic solution with solution better then |E|/2 the graph is implemented using an adjacent matrix, the nodes are chosen randomaly k = the number of bits for represntation n = 2^k -1 The pair wise method implement as a matrix , using a XOR command, the columns in the matrix represent all of the sub -groups in a pair wise way Good luck Shahar
Date : 2025-12-29 Size : 5kb User : shahar
[JSP/Java] RaceCalendar DL : 0: （循环赛日程安排）设有n=2^k个选手要进行网球循环赛，要求设计一个满足以下要求的比赛日程表：（1）每个选手必须与其他n-1个选手各赛一次；（2）每个选手一天只能赛一次。按此要求，可将比赛日程表设计成一个 n*n的矩阵，其中，第 i 行第 j 列表示和第 i 个选手在第 j 天比赛的对手。编写循环赛的日程安排程序。具体实现时可以有多种方法实现，但是递归实现是必须完成。 -(round robin schedules) with n = 2 ^ k a player to tennis round robin, request to design a meet the following requirements of the match schedule: (1) each player must with other n- 1 player all the time. (2) each player a day can only "a. According to the requirement of the match schedule design into a n* n matrix, among them, the first I do the first j column and the first I said a player in the first j day game against. Write round robin schedule program. Specific implementation may have many kinds of methods to realize, but recursive realization is must be completed.
Date : 2025-12-29 Size : 1kb User : 刘小明
[JSP/Java] class DL : 0: /* * 题目：如果把明文字母按一定顺序排列成矩阵形式，用另一种顺序选择相应的列输出得到密文，如用“china”为秘钥，对”this is * a book mark“排成矩阵如下： * t h i s i * s a b o o * k m a r k */ -/** Topic: If the plaintext letters arranged in a matrix form according to a certain order, in another column in order to select the appropriate output ciphertext, such as using " china" as the secret key, for " this is* a book mark" row matrix as follows:* thisi* saboo* kmark* /
Date : 2025-12-29 Size : 6kb User : 张志