Location:
Search - Exponentiation
Search list
Description:
Platform: |
Size: 92247 |
Author: |
Hits:
Description: Modular Exponentiation Algorithm Analysis
Platform: |
Size: 92514 |
Author: 赵平 |
Hits:
Description: 这是pku1001的源码，黄英大家使用，多多交流。
Platform: |
Size: 1344 |
Author: ljf |
Hits:
Description: This project requires you to write a program that imitates a simple desk calculator. Your calculator must be able to accept an infix expression which at least includes (, ), +, -, *, /, ％, and ^ (exponentiation operator, a^b = ab ). If the expression is legal, output its value, else output an error message.
Input Specification:
Your program must read test cases from a file “input.txt”. In the file there are several test cases, each occupies one line that contains an infix expression. Proceed until the end of the file.
Output Specification:
For each test case, output to a file “output.txt” in one line the value of that expression (accurate up to two decimal places), or an error message “ERROR IN INFIX NOTATION”.
Platform: |
Size: 40492 |
Author: 云从龙 |
Hits:
Description: 北大ACM题集中的Exponentiation解法，效率较高，大整数乘法算法。
Platform: |
Size: 531499 |
Author: little_ma |
Hits:
Description: Modular Exponentiation Algorithm Analysis
Platform: |
Size: 92160 |
Author: 赵平 |
Hits:
Description: 数论算法库 C++ 语言实现
代码内容 数论算法库，包括以下算法：
欧几里德算法求a，b的最大公倍数
扩展的欧几里德算法，求出gcd(a,b)和满足gcd(a,b)=ax+by的整数x和y
求解模线性方程 ax ≡ b (mod n) 其中n>0
求解模线性方程组(中国余数定理)
模取幂运算 计算a^b mod n （a,b可能很大）
Miller-Rabin随机性素数测试算法
-Number theory algorithms library C++ Language content code number theory algorithm library, which includes the following algorithms: Euclidean algorithm for a, b of the largest common multiple extended Euclidean algorithm, to derive gcd (a, b) and to meet gcd (a, b) = ax+ by the integer x and y-mode linear equations to solve ax ≡ b (mod n) in which n> 0 solving mode of linear equations (China remainder theorem) mode calculation computing exponentiation a ^ b mod n (a, b may be a lot) Miller-Rabin random prime number testing algorithm
Platform: |
Size: 9216 |
Author: henry |
Hits:
Description: 文件包括RSA算法原程序及详细注释。可以实现使用1024位以上大素数进行加解密。其中包括大整数的加、减、乘、除、模幂运算，求逆元运算，以及大素数的判定等算法。稍做扩展即可在实际中应用。-Documents include the RSA algorithm for the original procedures and detailed notes. Can be achieved using more than 1024 large prime numbers for encryption and decryption. Including large integer add, subtract, multiply, divide, modular exponentiation computation, and inverse calculations, as well as the large prime numbers, such as algorithms to determine. Can be extended slightly in the actual application.
Platform: |
Size: 112640 |
Author: wp |
Hits:
Description: 这是pku1001的源码，黄英大家使用，多多交流。
Platform: |
Size: 1024 |
Author: ljf |
Hits:
Description: acmer pku入门题 初学acm和大一学生适合 附原题-Getting Started acmer pku title acm beginner and suitable for freshman students attached to the original title
Platform: |
Size: 176128 |
Author: 杨成虎 |
Hits:
Description: VC写的模幂算法~~~~应用于密码学之中的-VC wrote the modular exponentiation algorithm ~ ~ ~ ~ applies to cryptography in the
Platform: |
Size: 164864 |
Author: ken |
Hits:
Description: This project requires you to write a program that imitates a simple desk calculator. Your calculator must be able to accept an infix expression which at least includes (, ), +, -, *, /, ％, and ^ (exponentiation operator, a^b = ab ). If the expression is legal, output its value, else output an error message.
Input Specification:
Your program must read test cases from a file “input.txt”. In the file there are several test cases, each occupies one line that contains an infix expression. Proceed until the end of the file.
Output Specification:
For each test case, output to a file “output.txt” in one line the value of that expression (accurate up to two decimal places), or an error message “ERROR IN INFIX NOTATION”.
-This project requires you to write a program that imitates a simple desk calculator. Your calculator must be able to accept an infix expression which at least includes (,),+,-,*, /,, And ^ (exponentiation operator, a ^ b = ab). If the expression is legal, output its value, else output an error message. Input Specification: Your program must read test cases from a file
Platform: |
Size: 39936 |
Author: 云从龙 |
Hits:
Description: 大整数类，具有一般整数的几乎所有运算，具体包括：四则运算，输入输出，求模幂，乘法，矩阵求模幂，重载了所有int类型的运算符，int，long 等数据的兼容。使用方法与int，long等类型完全一致。-Large integer type, a general integral for almost all computing, including: four computing, input and output, and modular exponentiation, multiplication, modular exponentiation matrix, all the overloaded operator int type, int, long, such as the compatibility of data. Methods and the use of int, long, such as the type is fully consistent.
Platform: |
Size: 6144 |
Author: superred |
Hits:
Description: 大数的模幂算法(GUI)，用密码学课本中的算法，快速、高效。计算(x的r次方) mod p 的值-Large numbers of modular exponentiation algorithm (GUI), used cryptography algorithm textbooks, fast and efficient. Calculation of (x of the r-th power) mod p value
Platform: |
Size: 22528 |
Author: LYC |
Hits:
Description: POJ 1001 Exponentiation
Platform: |
Size: 1024 |
Author: xin |
Hits:
Description: 高精度幂计算，北京大学ACM OJ上的Exponetiation-Exponentiation
Platform: |
Size: 376832 |
Author: tt |
Hits:
Description: 规范化乘幂函数求模的最大值和最大向量，又叫规范化幂乘法-Seek mode power function normalized by the maximum and the maximum vector
Platform: |
Size: 7168 |
Author: 陈明 |
Hits:
Description: 揭秘RSA求幂算法，代码简洁方便，非常实用，用于求解任何求模运算-the exponentiation of RSA
Platform: |
Size: 3707904 |
Author: 黄泰 |
Hits:
Description: 快速取模指数算法，C++编写，下载即可编译运行，RSA算法里面需要用到的-Take the fast modular exponentiation algorithm, C++ to prepare, you can compile and run the download, the RSA algorithm which need
Platform: |
Size: 230400 |
Author: 乐文君 |
Hits:
Description: Exponentiation
Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems.
This problem requires that you write a program to compute the exact value of Rn where R is a real number ( 0.0 < R < 99.999 ) and n is an integer such that 0 < n <= 25.-Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems.
This problem requires that you write a program to compute the exact value of Rn where R is a real number ( 0.0 < R < 99.999 ) and n is an integer such that 0 < n <= 25.
Platform: |
Size: 144384 |
Author: 张立超 |
Hits: