Location:
Search - let.m
Search list
Description: 描述：设编号为1,2,…,n(n>0)个人按顺时针方向围坐一圈，每人持有一个正整数密码。开始时任意给出一个报数上限值m，从第一个人开始顺时针方向自1起顺序报数，报到m时停止报数，抱m的人出列，从他在顺时针方向上的下一个人起重新自1起顺序报数；如此下去，直到所有人全部出列为止。要求设计一个程序模拟此过程，并给出出列人的编号序列。
．算法思想：
Jeseph函数是实现问题要求的主要函数，其算法思想是：从1至m对带头结点的单循环链表循环计数，到m时，输出该结点的编号值，，再从该结点的下一个结点起重新自1起循环计数；如此下去，直到单循环链表空时循环过程结束。
-Description : Let numbered 1, 2, ..., n (NGT; 0) clockwise direction by individuals sitting around a circle, each holding a positive integer code. At the beginning of a given arbitrary reported few limits on m, started from the first clockwise direction from the starting sequence reported a few, when they report back m reported few, hold out the m out from the clockwise direction in the next personal re-order starting from a newspaper; This situation continues until all people so far shown up. Asked to design a simulation of this process, and give out the number of people out sequence. . Algorithm thinking : Jeseph function is to seek to achieve the main function of the algorithm is thinking : m from a right to take the lead in the 19th nodes Listless cycle count, m, the output node number
Platform: |
Size: 21028 |
Author: 王俊 |
Hits:
Description: Josephus 排列问题定义如下：假设n 个竞赛者排成一个环形。给定一个正整数m，从某
个指定的第1 个人开始，沿环计数，每遇到第m 个人就让其出列，且计数继续进行下去。这
个过程一直进行到所有的人都出列为止。最后出列者为优胜者。每个人出列的次序定义了整
数1，2，…，n 的一个排列。这个排列称为一个(n,m)Josephus 排列。
例如，(7,3)Josephus 排列为3，6，2，7，5，1，4。-Josephus problem with the definition is as follows : Suppose n race who formed a ring. Given a positive integer m, from a certain section of a designated individual, along the Central Counting that every individual section m let out its out and count continue. This process continues until all the people from far out. Finally out of the winners were shown. Everyone out in the order shown in the definition of integers 1, 2, ..., n an order. With this as a (n, m), with Josephus. For example, (7,3) Josephus, were 3,6,2,7,5,1,4.
Platform: |
Size: 1095 |
Author: 李飞飞 |
Hits:
Description: 稀疏矩阵(SparseMatrix)：是矩阵中的一种特殊情况，其非零元素的个数远小于零元素的个数。
设m行n列的矩阵含t个非零元素.以二维数组表示高阶的稀疏矩阵时，会产生零值元素占的空间很大且进行了很多和零值的运算的问题。
-sparse matrix (SparseMatrix) : Matrix is a special situation. its non-zero elements of the number far less than the number of zero elements. Let m n trip out of the matrix containing t nonzero elements. A two-dimensional array of high-ranking sparse matrix, have zero value for elements of the space and a great many and zero computational problems.
Platform: |
Size: 23223 |
Author: Eurik |
Hits:
Description: test1.m 固定增量法求分界面
test2.m 利用误差平方和函数集群
delet.m 删除数组元素
Err.m 计算误差平方和
Distance.m 欧拉距离计算
-test1.m fixed incremental method for use interface test2.m squared error function cluster de let.m delete array elements Err.m calculation error square Distance.m Euler distance
Platform: |
Size: 4822 |
Author: 杨奎元 |
Hits:
Description: 稀疏矩阵(SparseMatrix)：是矩阵中的一种特殊情况，其非零元素的个数远小于零元素的个数。
设m行n列的矩阵含t个非零元素.以二维数组表示高阶的稀疏矩阵时，会产生零值元素占的空间很大且进行了很多和零值的运算的问题。
-sparse matrix (SparseMatrix) : Matrix is a special situation. its non-zero elements of the number far less than the number of zero elements. Let m n trip out of the matrix containing t nonzero elements. A two-dimensional array of high-ranking sparse matrix, have zero value for elements of the space and a great many and zero computational problems.
Platform: |
Size: 22528 |
Author: Eurik |
Hits:
Description: test1.m 固定增量法求分界面
test2.m 利用误差平方和函数集群
delet.m 删除数组元素
Err.m 计算误差平方和
Distance.m 欧拉距离计算
-test1.m fixed incremental method for use interface test2.m squared error function cluster de let.m delete array elements Err.m calculation error square Distance.m Euler distance
Platform: |
Size: 4096 |
Author: 杨奎元 |
Hits:
Description: 学习写了下无OS的软件,大家看看吧请认真阅读您的-Learning to write the next non-OS software, let us look at it, please carefully read your
Platform: |
Size: 3025920 |
Author: 魏 |
Hits:
Description: MFC只提供了BMP位图的载入,我给大家提供一个包含JPG GIF TIF PNG 格式图片载入的类库-MFC provides only BMP bitmap loading, let us provide an included JPG GIF TIF PNG format image loading library
Platform: |
Size: 93184 |
Author: 杨永龙 |
Hits:
Description: 这是我读硕时 师兄让我写的把AVI视频转成一帧帧图像的代码 绝对好用 文件夹理有我的联系方式 有问题问我-This is when I read Augmentum师兄let me write the AVI video into a frame image of the code is absolutely easy to use folder justifications have my contact there asked me the question
Platform: |
Size: 8192 |
Author: 王东 |
Hits:
Description: Cortex-M3权威指南，让你从零开始了解ARM-Cortex-Cortex-M3 authoritative guide to let you start from scratch to understand ARM-Cortex
Platform: |
Size: 3390464 |
Author: lirui |
Hits:
Description: java编程，关于java的编程请认真书写上传资料的详细功能、包含内容说明(至少要20个字)。尽量不要让站长把时间都花费在为您修正说明上。压缩包解压-java programming, java programming on Writing From the information carefully detailed features, including content description (at least 20 words). Try not to let owners to spend time on your revised instructions. Archive decompression
Platform: |
Size: 3072 |
Author: 李宁 |
Hits:
Description: 营造卓越，分享学术的氛围！很好，欢迎大家学习，交流！-verygood！let we see！verygood！let we see！verygood！let we see！verygood！let we see！verygood！let we see！
Platform: |
Size: 15360 |
Author: myygina |
Hits:
Description: 李氏指数的一些程序，希望对大家有用，啊哈哈和！-Lipschitz exponent of some of the procedures, we hope to be useful, ah ha ha and!
Platform: |
Size: 1157120 |
Author: wei |
Hits:
Description: 设m不整除a，计算一次同余式ax=b(mod m)。当a=987，b=564，m=2005时，求出x。-Let m not divisible by a, calculate a congruence ax = b (mod m). When a = 987, b = 564, m = 2005, the calculated x.
Platform: |
Size: 40960 |
Author: liuyingqiong |
Hits:
Description: 题目描述
为了增强幼儿园小朋友的数数能力，小虎的老师给了一个家庭游戏作业。他让小虎拿一块空的围棋盘，随机地在一些方格中放些棋子（有黑白两种颜色），如果一个方格和它的上、下、左、右四个方格之一都有相同颜色的棋子，则认为两格子是相连通的。这期间，要求小虎不断统计共有多少个连通块。
如下图是一个5×9的棋盘，其中"."表示空格，"*"表示黑棋子，"@"表示白棋子。则有4块连通的棋子块。
.........
..**..@..
.**@@.@@.
..*@..*..
.........
哥哥大虎一边看一边想，如果棋盘是N×N的，共放了M个棋子，如何用计算机解决这个问题呢？
输入要求
第1行两个整数：N，M（1≤N≤500，1≤M≤N×N）。
接下来有M行，每行三个正整数：C，X，Y（0≤C≤1，1≤X，Y≤N），分别表示依次放入棋子的颜色（0表示白色，1表示黑色）、要放入格子的横坐标和格子的纵坐标。
输出要求
共M行。第i行一个整数，表示放入第i个棋子后，当前有多少个棋子连通块。-Topic description
In order to enhance the ability of kindergarten children count, Tiger s teacher gave the job of a family game. He let the Tigers get an empty chess set, randomly put some pawn in some grid (black or white), if a box and it s one of the down, left, and right box have pawn of the same color, the two grid connect. During this period, the Tigers continue to Statistics Total number of connected blocks.
The following figure is a 5 × 9 board, where "space,"* "represents the black pawn," @ ", said the white pawn. There are four connected piece.
.........
..** .. @ ..
.** @ @ @ @.
..* @ ..* ..
.........
Brothers and Big Tiger, he is thinking while watching, if the board is the N × N, let M a pawn how to use the computer to solve this problem?
Input requirements
1 lines of two integers: N, M, (1 ≤ N ≤ 500,1 ≤ M ≤ N × N).
Next M lines, each line of three positive integers: C and the X, Y (0 ≤ C ≤ 1,1 ≤ X, Y, ≤ N), respectively, turn into the color of the pawn (0 white
Platform: |
Size: 1024 |
Author: 掌们 |
Hits:
Description: 用Wolf法计算lorenzeq混沌系统的Lyapunov指数谱。改变混沌系统参数，计算准确，运行let.m文件，即可计算Lyapunov指数谱
-Wolf Law lorenzeq chaotic systems Lyapunov exponent spectrum. Change the chaotic system parameters, calculated accurate, run let.m file, you can calculate the Lyapunov exponent spectrum
Platform: |
Size: 1024 |
Author: 徐益飞 |
Hits:
Description: 用递归调用和辗转相除法求两个整数的最大公约数（输入多组数据，每个数在1到1000之间；输出为一行一个公约数）。-Calculate and output the greatest common divisor (GCD) of a pair of integers.The classic algorithm for computing the GCD, known as Euclid’s algorithm, goes as follows: Let m and n be variables containing the two numbers. If n is 0, then stop: m contains the GCD.Use recursion.(There will be multiple input sets. The line contains two integer between 1 and 1000. For each test case, output one line.)
Platform: |
Size: 3072 |
Author: Lee·K |
Hits:
Description: 这是我读硕时 师兄让我写的把AVI视频转成一帧帧图像的代码 绝对好用 文件夹理有我的联系方式 有问题问我-This is when I read Augmentum师兄let me write the AVI video into a frame image of the code is absolutely easy to use folder justifications have my contact there asked me the question
Platform: |
Size: 8192 |
Author: Egypti |
Hits:
Description: Hi. I am Prena Kanojia. I am pursuing M.tech from National Institute of technology rourkela in computer science branch. my researc topic is petri net.
Platform: |
Size: 2542592 |
Author: prerna |
Hits:
Description: 这里的每个人都有调控短暂时间的特殊能力，他们都有属于自己的伤痛-Someone can let time be suspended, but in this still space, he will be alone someone can see what happens after ten minutes.
Platform: |
Size: 8192 |
Author: 王子伟 |
Hits: