码迷,mamicode.com
首页 >  
搜索关键字:calculate    ( 959个结果
POJ 3978(求素数)
Primes Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3204 Accepted: 1245 Description A pretty straight forward task, calculate the number of primes b...
分类:其他好文   时间:2014-05-22 09:02:28    阅读次数:517
Big Number------HDOJ杭电1212(大数运算)
Problem Description As we know, Big Number is always troublesome. But it's really important in our ACM. And today, your task is to write a program to calculate A mod B. To make the problem easie...
分类:其他好文   时间:2014-05-20 14:42:07    阅读次数:324
[矩阵+线段树] zoj 3772 Calculate the Function
题目链接: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5235 Calculate the Function Time Limit: 2 Seconds      Memory Limit: 65536 KB You are given a list of numbers A1 A2 .. AN...
分类:其他好文   时间:2014-05-18 09:52:49    阅读次数:410
ZOJ 3772 Calculate the Function (线段树 + 矩阵)
思路分析: 遗憾不知道矩阵的构造。线段树上比较水的矩阵。。。  M[x]  =  [1 A[x]]               [1   0 ]   就有 [  F[R]  ]    =   M[R] * M[R-1] *  ... * M[L+2] * [F[L+1]] [F[R-1]]                                       ...
分类:其他好文   时间:2014-05-13 08:45:03    阅读次数:270
Essential Calculate计算控件全面介绍及下载
EssentialCalculate控件是一款强大的计算引擎,内嵌150多种计算公式,为商业对象添加扩展的计算支持,在没有Excel的情况下,完全可以与EssentialXlsIO整合,支持进行像Excel一样的计算。具体功能:支持自动或手动计算仅仅需要单个命令就可以对整个文本框或下拉列表框进行计算使..
分类:其他好文   时间:2014-05-12 04:02:22    阅读次数:313
NBUT The Sum of F(x) and G(x)
问题描述 When Deathmoon played MC game, he faced a math problem. When he found a ancient tomb and came in, he found two polynomials f(x) and g(x) no the wall, only did he calculate f(x) + g(x) correctly ...
分类:其他好文   时间:2014-05-10 09:57:54    阅读次数:300
Hdu 1042 N! (高精度数)
Problem Description Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N!   Input One N in one line, process to the end of file.   Output For each N, output N! i...
分类:其他好文   时间:2014-04-28 10:36:41    阅读次数:341
hdu 1012:u Calculate e(数学题,水题)
u Calculate eTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28686Accepted Submission(s): 12762Pro...
分类:其他好文   时间:2014-04-27 21:43:06    阅读次数:437
hdu1211
RSA is one of the most powerful methods to encrypt data. The RSA algorithm is described as follow: > choose two large prime integer p, q > calculate n = p × q, calculate F(n) = (p - 1) × (q - 1) ...
分类:其他好文   时间:2014-04-27 21:37:59    阅读次数:315
959条   上一页 1 ... 94 95 96
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!