欧几里德算法：辗转求余 原理: gcd(a,b)=gcd(b,a mod b) 当b为0时,两数的最大公约数即为a getchar()会接受前一个scanf的回车符
上传时间： 2014-01-10
上传用户：2467478207
NS Tutorial: mobile and wireless network simulation
标签： simulation Tutorial wireless network
上传时间： 2014-01-09
上传用户：windwolf2000
Consider a BPSK and a QPSK system for the following two cases: 1) The probability that the symbol 1 is sent and the probability that the symbol 0 is sent are all the same. 2) The probability that the symbol 1 is sent is two times than the probability that the symbol 0 is sent. Assume that the noise is Gaussian distributed with mean=0 and 2 = 1.
标签： probability following the Consider
上传时间： 2017-08-15
上传用户：凌云御清风
数据结构课程设计 数据结构B+树 B+ tree Library
上传时间： 2013-12-31
上传用户：semi1981
* 高斯列主元素消去法求解矩阵方程AX=B,其中A是N*N的矩阵,B是N*M矩阵 * 输入: n----方阵A的行数 * a----矩阵A * m----矩阵B的列数 * b----矩阵B * 输出: det----矩阵A的行列式值 * a----A消元后的上三角矩阵 * b----矩阵方程的解X
上传时间： 2015-07-26
上传用户：xauthu
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
标签： represented integers group items
上传时间： 2016-01-17
上传用户：jeffery
(1) 、用下述两条具体规则和规则形式实现.设大写字母表示魔王语言的词汇 小写字母表示人的语言词汇 希腊字母表示可以用大写字母或小写字母代换的变量.魔王语言可含人的词汇. (2) 、B→tAdA A→sae (3) 、将魔王语言B(ehnxgz)B解释成人的语言.每个字母对应下列的语言.
上传时间： 2013-12-30
上传用户：ayfeixiao
1) Write a function reverse(A) which takes a matrix A of arbitrary dimensions as input and returns a matrix B consisting of the columns of A in reverse order. Thus for example, if A = 1 2 3 then B = 3 2 1 4 5 6 6 5 4 7 8 9 9 8 7 Write a main program to call reverse(A) for the matrix A = magic(5). Print to the screen both A and reverse(A). 2) Write a program which accepts an input k from the keyboard, and which prints out the smallest fibonacci number that is at least as large as k. The program should also print out its position in the fibonacci sequence. Here is a sample of input and output: Enter k>0: 100 144 is the smallest fibonacci number greater than or equal to 100. It is the 12th fibonacci number.
标签： dimensions arbitrary function reverse
上传时间： 2016-04-16
上传用户：waitingfy
1.有三根杆子A,B,C。A杆上有若干碟子 2.每次移动一块碟子,小的只能叠在大的上面 3.把所有碟子从A杆全部移到C杆上 经过研究发现，汉诺塔的破解很简单，就是按照移动规则向一个方向移动金片： 如3阶汉诺塔的移动：A→C,A→B,C→B,A→C,B→A,B→C,A→C 此外，汉诺塔问题也是程序设计中的经典递归问题
上传时间： 2016-07-25
上传用户：gxrui1991
The Ralink 802.11n Chipset family provides solutions for PCI, PCIe and USB interfaces with both 2.4 and 2.4/5GHz suppport. Each chipset consists of two highly integrated ICs (RFIC and BB/MAC IC) that fully comply with current draft IEEE 802.11n and IEEE 802.11a/b/g standards.
标签： interfaces solutions provides Chipset
上传时间： 2014-01-13
上传用户：Thuan
