![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
大数问题
文章平均质量分 59
wanghandou
我是个爱学习的孩子
展开
-
HDU 1250 Hat's Fibonacci
Problem DescriptionA Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n原创 2017-03-17 09:36:42 · 196 阅读 · 0 评论 -
很麻煩的題
A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-转载 2017-03-17 14:55:12 · 239 阅读 · 0 评论 -
求高精度幂
求高精度幂时间限制:3000 ms | 内存限制:65535 KB难度:2描述 对数值很大、精度很高的数进行高精度计算是一类十分常见的问题。比如,对国债进行计算就是属于这类问题。 现在要你解决的问题是:对一个实数R( 0.0,要求写程序精确计算 R的 n 次方(Rn),其中n是整数并且 0 。输入输入有多行,每行有两个数R和n,空格分开。R的数字位数不超转载 2016-12-01 20:26:21 · 272 阅读 · 0 评论 -
A/B Problem
A/B Problem时间限制:1000 ms | 内存限制:65535 KB难度:3描述 做了A+B Problem,A/B Problem不是什么问题了吧!输入每组测试样例一行,首先一个号码A,中间一个或多个空格,然后一个符号( / 或者 % ),然后又是空格,后面又是一个号码B,A可能会很长,B是一个int范围的数。输出输出结果。样例输入110 /原创 2016-08-17 17:31:13 · 283 阅读 · 0 评论 -
A+B Problem II
A+B Problem II时间限制:3000 ms | 内存限制:65535 KB难度:3描述 I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.A,B must be positive.输入原创 2016-08-17 10:17:39 · 269 阅读 · 0 评论 -
大数相减
需要比较大小,来决定结果正负#include#includechar n[100000];int d[100000];int e[100000];char s[100000];int f[100000];int k[100000];int main(){ int t; while(scanf("%s%s",n,s)!=-1)原创 2016-08-16 17:52:28 · 199 阅读 · 0 评论 -
A problem is easy
A problem is easy时间限制:1000 ms | 内存限制:65535 KB难度:3描述 When Teddy was a child , he was always thinking about some simple math problems ,such as “What it’s 1 cup of water plus 1 pile of do原创 2016-06-07 20:06:31 · 332 阅读 · 0 评论 -
acm773
开方数时间限制:500 ms | 内存限制:65535 KB难度:3描述 现在给你两个数 n 和 p ,让你求出 p 的开 n 次方。输入每组数据包含两个数n和p。当n和p都为0时表示输入结束。(1输出对于每个输出对用输出开方后的结果k(结果小于10^9)。样例输入2 163 277 43571861840213822045440 0样例输出4原创 2016-03-22 15:57:08 · 232 阅读 · 0 评论 -
Large Division
Given two integers, a and b, you should check whether a is divisible by b or not. We know that an integer a is divisible by an integer b if and only if there exists an integer c such that a = b * c.原创 2017-04-26 20:09:33 · 215 阅读 · 0 评论