![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
高精度
文章平均质量分 77
geguojun
天道酬勤
展开
-
Bull Math(高精度)
DescriptionBulls are so much better at math than the cows. They can multiply huge integers together and get perfectly precise answers ... or so they say. Farmer John wonders if their answers are原创 2014-08-03 11:45:55 · 459 阅读 · 0 评论 -
Just the Facts(高精度)
DescriptionThe expression N!, read as "N factorial," denotes the product of the first N positive integers, where N is nonnegative. So, for example, N N! 0 1 1 1 2原创 2014-08-03 12:00:43 · 410 阅读 · 0 评论 -
Basic remains(高精度)
DescriptionGiven a base b and two non-negative base b integers p and m, compute p mod m and print the result as a base b integer. p mod m is defined as the smallest non-negative integer k such t原创 2014-08-04 11:36:18 · 504 阅读 · 0 评论 -
Heritage(高精度)
DescriptionYour rich uncle died recently, and the heritage needs to be divided among your relatives and the church (your uncle insisted in his will that the church must get something). There are原创 2014-08-03 11:34:50 · 391 阅读 · 0 评论 -
NUMBER BASE CONVERSION(高精度)
DescriptionWrite a program to convert numbers in one base to numbers in a second base. There are 62 different digits: { 0-9,A-Z,a-z } HINT: If you make a sequence of base conversions using t原创 2014-08-04 20:33:35 · 683 阅读 · 0 评论 -
Exponentiation(高精度)
DescriptionProblems 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原创 2014-08-04 20:09:45 · 353 阅读 · 0 评论 -
高精度算法
高 精 度 算 法[cpp] view plaincopy高 精 度 算 法 #include #include #include #include int an,bn,fa=1,fb=1; /* 把an,bn,k设为全局变量,an纪录第一个高精度数组的位数,bn纪录第二个高精度数组的位数,k纪录转载 2014-07-30 15:33:43 · 466 阅读 · 0 评论 -
How many Fibs?(高精度)
DescriptionRecall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n>=3) Given two numbers a and b, calculate how many Fibonacci numbers are in the range原创 2014-08-03 11:21:09 · 544 阅读 · 0 评论