----- 大数问题
谙忆
Java相关研发架构工作经验5年。拥有Java相关发明专利8余项。从事过支付行业,研发与架构的系统稳定地支撑着公司日千万交易笔数量级的支付和对账。
二手车SaaS内核研发3年经验+,拥有二手车行业SaaS相关发明专利6项,研发、架构的元数据内核与权限系统,每日亿万级接口调用。
Java企业开发丰富的理论知识和实战经验。2020年CSDN博客之星第12名,同时在一些社区担任名誉职位。认证为CSDN博客专家、CSDN专栏签约作者、InfoQ签约作者、阿里云ACE杭州同城会会长、阿里云社区认证专家、华为云·云享专家。
展开
-
HDOJ/HDU 1865 1sting(斐波拉契+大数~)
Problem Description You will be given a string which only contains ‘1’; You can merge two adjacent ‘1’ to be ‘2’, or leave the ‘1’ there. Surly, you may get many different results. For example, given原创 2016-05-24 16:17:59 · 2603 阅读 · 0 评论 -
POJ 1423 Big Number
DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a num原创 2015-11-10 21:06:26 · 2320 阅读 · 0 评论 -
POJ 1503 Integer Inquiry 简单大数相加
DescriptionOne of the first users of BIT’s new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers. This原创 2015-10-24 13:59:53 · 1678 阅读 · 0 评论 -
HDOJ1018Big Number
Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are g原创 2015-10-09 20:33:32 · 1720 阅读 · 0 评论 -
HDOJ1002题A + B Problem II,2个大数相加
Problem Description I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.Input The first line of the input contains an integer T(1<=T<=20) which原创 2015-09-26 15:41:48 · 1586 阅读 · 0 评论 -
HDOJ 1013题Digital Roots 大数,9余数定理
Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resultin原创 2015-08-21 17:00:24 · 1527 阅读 · 0 评论 -
HDOJ/HDU 1133 Buy the Ticket(数论~卡特兰数~大数~)
Problem Description The “Harry Potter and the Goblet of Fire” will be on show in the next few days. As a crazy fan of Harry Potter, you will go to the cinema and have the first sight, won’t you?Suppos原创 2016-05-21 19:03:26 · 5518 阅读 · 1 评论 -
HDOJ/HDU 1250 Hat's Fibonacci(大数~斐波拉契)
Problem Description 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 -原创 2016-05-21 20:22:20 · 5581 阅读 · 0 评论 -
HDOJ/HDU 1297 Children’s Queue(推导~大数)
Problem Description There are many students in PHT School. One day, the headmaster whose name is PigHeader wanted all students stand in a line. He prescribed that girl can not be in single. In other w原创 2016-05-21 21:38:16 · 6028 阅读 · 0 评论 -
HDOJ 2054 A == B ?(精确大数相等)
Problem Description Give you two numbers A and B, if A is equal to B, you should print “YES”, or print “NO”.Input each test case contains two numbers A and B.Output for each case, if A is equal to B原创 2016-01-27 16:47:46 · 1920 阅读 · 0 评论 -
HDOJ 1002 A + B Problem II
Problem Description I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.Input The first line of the input contains an integer T(1<=T<=20) which原创 2016-02-02 17:18:03 · 1760 阅读 · 0 评论 -
HDOJ/HDU 5686 Problem B(斐波拉契+大数~)
Problem Description 度熊面前有一个全是由1构成的字符串,被称为全1序列。你可以合并任意相邻的两个1,从而形成一个新的序列。对于给定的一个全1序列,请计算根据以上方法,可以构成多少种不同的序列。Input 这里包括多组测试数据,每组测试数据包含一个正整数N,代表全1序列的长度。1≤N≤200 Output 对于每组测试数据,输出一个整数,代表由题目中所给定的全1序列所能形原创 2016-05-26 22:20:08 · 5201 阅读 · 0 评论 -
HDOJ/HDU 2549 壮志难酬(取小数点后几位~)
Problem Description 话说MCA山上各路豪杰均出山抗敌,去年曾在江湖威名显赫的,江湖人称<万军中取上将首级舍我其谁>的甘露也不甘示弱,“天将降大任于斯人也,必先劳其筋骨,饿其体肤,空乏其身”他说。可惜,由于去年取上将首级时不慎右手右关节第七次骨折,养伤达一年之久,空有一腔抱负却壮志难酬,如今天下危亡,习武之人又怎能袖手旁观,于是他决定出山协助威士忌共抗辽贼,这时他的对头枫冰叶子出原创 2016-05-16 20:53:56 · 5124 阅读 · 0 评论 -
HDOJ 1018 Big Number(大数位数公式)
Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are g原创 2016-03-20 17:06:27 · 1832 阅读 · 0 评论 -
HDOJ 1715 大菲波数
Problem Description Fibonacci数列,定义如下: f(1)=f(2)=1 f(n)=f(n-1)+f(n-2) n>=3。 计算第n项Fibonacci数值。Input 输入第一行为一个整数N,接下来N行为整数Pi(1<=Pi<=1000)。Output 输出为N行,每行为对应的f(Pi)。Sample Input 5 1 2 3 4 5Sample原创 2016-03-01 15:51:08 · 1639 阅读 · 0 评论 -
HDOJ 1013 Digital Roots
Problem Description The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting原创 2016-02-16 14:41:16 · 1597 阅读 · 0 评论 -
HDOJ 1042 N!(大数阶乘JAVA)
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! in one line.Sample Input 1 2 3S原创 2016-02-16 14:03:40 · 1730 阅读 · 0 评论 -
HDOJ 1212 Big Number
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 easier, I pr原创 2016-02-10 16:25:08 · 1714 阅读 · 0 评论 -
HDOJ 2100 Lovekey
Problem Description XYZ-26进制数是一个每位都是大写字母的数字。 A、B、C、…、X、Y、Z 分别依次代表一个0 ~ 25 的数字,一个 n 位的26进制数转化成是10进制的规则如下 A0A1A2A3…An-1 的每一位代表的数字为a0a1a2a3…an-1 ,则该XYZ-26进制数的10进制值就为 m = a0 * 26^(n-1) + a1 * 26^(n-2) +原创 2016-02-10 16:08:51 · 2113 阅读 · 0 评论 -
HDOJ 1753 大明A+B(大数~)
Problem Description 话说,经过了漫长的一个多月,小明已经成长了许多,所以他改了一个名字叫“大明”。 这时他已经不是那个只会做100以内加法的那个“小明”了,现在他甚至会任意长度的正小数的加法。现在,给你两个正的小数A和B,你的任务是代表大明计算出A+B的值。Input 本题目包含多组测试数据,请处理到文件结束。 每一组测试数据在一行里面包含两个长度不大于400的正小数A和原创 2016-02-16 14:49:43 · 1655 阅读 · 0 评论