-
verilog code for 8-bit signed INTEGERs....its working
標簽：
INTEGERs
verilog
working
signed
上傳時間：
2017-03-18
上傳用戶：zhichenglu
-
NTL is a high-performance, portable C++ library providing data structures and algorithms for manipulating signed, arbitrary length INTEGERs, and for vectors, matrices, and polynomials over the INTEGERs and over finite fields.
標簽：
high-performance
algorithms
structures
providing
上傳時間：
2014-01-05
上傳用戶：水中浮云
-
ARM下 Implement matrix multiplication of 2 square matrices, with data read from an input file and printed both to the console and to an output file.
• Assume a file with correct data (no garbage, characters, etc.).
• you must check and provide appropriate execution for 2 extra cases, namely when the matrix size given is either “0” , or when the size is greater than the maximum handled of “5” . In these 2 cases you must implement the following behaviour:
o If size = 0, then print a message “Size = 0 is unacceptable” and continue by reading the
next size for the next 2 matrices (if not end of file).
o If size >5, then print two messages: “Size is too big - unacceptable”. Then read and
discard the next (size2 ) INTEGERs and continue by reading the next size for the next 2 matrices (if not end of file).
標簽：
multiplication
Implement
matrices
matrix
上傳時間：
2014-08-30
上傳用戶：dsgkjgkjg
-
ACM試題An Easy Problem
Description
As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive INTEGERs and its binary form. Given a positive integer I, you task is to find out an integer J, which is the minimum integer greater than I, and the number of 1 s in whose binary form is the same as that in the binary form of I. For example, if "78" is given, we can write out its binary form, "1001110". This binary form has 4 1 s. The minimum integer, which is greater than "1001110" and also contains 4 1 s, is "1010011", i.e. "83", so you should output "83".
標簽：
Description
computers
Problem
binary
上傳時間：
2013-12-11
上傳用戶：libenshu01
-
HDOJ ACM
input:The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Each of the following N lines contains two positive INTEGERs s and t, representing that a table is to move from room number s to room number t (each room number appears at most once in the N lines). From the N+3-rd line, the remaining test cases are listed in the same manner as above.
標簽：
input
cases
test
The
上傳時間：
2015-10-18
上傳用戶：三人用菜
-
Input
The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. The first line of each case contains N, and the second line contains N INTEGERs giving the time for each people to cross the river. Each case is preceded by a blank line. There won t be more than 1000 people and nobody takes more than 100 seconds to cross.
Output
For each test case, print a line containing the total number of seconds required for all the N people to cross the river.
Sample Input
1
4
1 2 5 10
Sample Output
17
標簽：
the
contains
integer
number
上傳時間：
2015-10-27
上傳用戶：plsee
-
Sherwood算法消除最壞實例，以達到對任何實例都能有好的性能的效果
文件：
rd_list.c --> create a random sequence of n INTEGERs not equal to each other
list.c --> create a descending sequence of n INTEGERs not equal to each other
sherwood.c --> 就是該算法，靜態鏈表的長度默認設為1000，可在宏定義處修改
用法：
gcc -o sherwood sherwood.c
gcc -o rd_list rd_list.c
gcc -o list list.c
./rd_list s.txt 1000 產生一個長度為1000的互不相等的隨機序列，保存在s.txt中
./list s1.txt 1000 產生一個長度為1000的互不相等的降序序列，保存雜s1.txt中
./sherwood s1.txt 運行算法，比較其中的4個算法的性能差異
標簽：
Sherwood
算法
上傳時間：
2016-01-20
上傳用戶：ainimao
-
The GNU MP Bignum Library，非常好用的大數運算庫，GMP is a free library for arbitrary precision arithmetic, operating on signed INTEGERs, rational numbers, and floating point numbers.
標簽：
Library
Bignum
The
GNU
上傳時間：
2014-01-08
上傳用戶：a673761058
-
密碼學界牛人Victor Shoup用C++編寫數論類庫。
NTL is a high-performance, portable C++ library providing data structures and algorithms for arbitrary length INTEGERs for vectors, matrices, and polynomials over the INTEGERs and over finite fields and for arbitrary precision floating point arithmetic.
NTL provides high quality implementations of state-of-the-art algorithms for:
* arbitrary length integer arithmetic and arbitrary precision floating point arithmetic
* polynomial arithmetic over the INTEGERs and finite fields including basic arithmetic, polynomial factorization, irreducibility testing, computation of minimal polynomials, traces, norms, and more
* lattice basis reduction, including very robust and fast implementations of Schnorr-Euchner, block Korkin-Zolotarev reduction, and the new Schnorr-Horner pruning heuristic for block Korkin-Zolotarev
* basic linear algebra over the INTEGERs, finite fields, and arbitrary precision floating point numbers.
標簽：
high-performance
providing
portable
library
上傳時間：
2014-01-04
上傳用戶：exxxds
-
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or INTEGERs (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
標簽：
Multiplicative
undirected
Shortest
measured
上傳時間：
2017-04-08
上傳用戶：邶刖
