![](https://img-blog.csdnimg.cn/20200408111205310.jpg?x-oss-process=image/resize,m_fixed,h_224,w_224)
ICPC-大数
文章平均质量分 78
大数有关的题解
海岛Blog
专注于程序设计及其竞赛,专注于集成电路EDA设计
展开
-
UVA10213 How Many Pieces of Land【数学+大数】
You are given an elliptical shaped land and you are asked to choose n arbitrary points on its boundary. Then you connect all these points with one another with straight lines (that’s n ∗ (n−1)/2 connections for n points). What is the maximum number of piec原创 2021-05-29 11:36:28 · 226 阅读 · 0 评论 -
UVA11115 POJ3199 Uncle Jack【大数】
Dear Uncle Jack is willing to give away some of his collectable CDs to his nephews. Among the titles you can find very rare albums of Hard Rock, Classical Music, Reggae and much more; each title is considered to be unique. Last week he was listening to one原创 2021-05-08 23:34:52 · 195 阅读 · 0 评论 -
UVA11554 Hapless Hedonism【数学计算+大数】
Bob is a world-renowned stick collector. His most prized stick possessions include:• an Arctic Redwood branch from a hike near Dawson City,• a Desert Pine stick from a visit to the Grand Canyon, and• a Chinese Arbour twig from an adventure into Tibet.B原创 2021-05-08 19:53:17 · 168 阅读 · 0 评论 -
UVA11161 Help My Brother (II)【大数+递推】
A Fibonacci sequence is calculated by adding the previous two members of the sequence, with the first two members being both 1.f(1)=1,f(2)=1,f(n>2)=f(n−1)+f(n−2)f(1) = 1, f(2) = 1, f(n > 2) = f(n − 1) + f(n − 2)f(1)=1,f(2)=1,f(n>2)=f(n−1)+f(n−2)原创 2021-05-08 07:26:17 · 165 阅读 · 0 评论 -
UVA10497 Sweet Child Makes Trouble【大数+递推】
Children are always sweet but they can sometimes make you feel bitter. In this problem, you will see how Tintin, a five year’s old boy, creates trouble for his parents. Tintin is a joyful boy and is always busy in doing something. But what he does is not a原创 2021-05-08 07:12:27 · 263 阅读 · 0 评论 -
UVA10198 Counting【大数+递推】
Gustavo knows how to count, but he is now learning how write numbers. As he is a very good student, he already learned 1, 2, 3 and 4. But he didn’t realize yet that 4 is different than 1, so he thinks that 4 is another way to write 1. Besides that, he is h原创 2021-05-08 06:47:23 · 275 阅读 · 0 评论 -
UVA763 LA5339 Fibinary Numbers【大数】
The standard interpretation of the binary number 1010 is 8 + 2 = 10. An alternate way to view the sequence “1010” is to use Fibonacci numbers as bases instead of powers of two. For this problem, the terms of the Fibonacci sequence are:1,2,3,5,8,13,21,...1原创 2021-05-08 00:32:09 · 159 阅读 · 0 评论 -
UVA485 Pascal‘s Triangle of Death【大数】
In this problem, you are asked to generate Pascal’s Triangle. Pascal’s Triangle is useful in many areas from probability to polynomials to programming contests. It is a triangle of integers with “1” on top and down the sides. Any number in the interior equ原创 2021-05-08 00:04:46 · 174 阅读 · 0 评论 -
UVA1226 LA3997 Numerical surprises【大数】
We suspect that for every positive integer N there exists an integer of the form 11 . . . 10 . . . 0 (a sequence of 1’s followed by 0 or more 0’s) that is divisible by N. For example, with N = 3, 111 is divisible by 3, with N = 4, 100 is divisible by 4, wi原创 2021-05-07 23:18:43 · 163 阅读 · 0 评论 -
UVA619 LA5465 POJ1312 HDU1314 ZOJ1272 Numerically Speaking【大数+进制】
Numerically SpeakingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1346 Accepted: 718DescriptionA developer of crossword puzzles (and other similar word games) has decided to develop a mapping between every possible word with from one to t原创 2021-05-07 22:37:19 · 187 阅读 · 0 评论 -
UVA11821 High-Precision Number【大数】
A number with 30 decimal digits of precision can be represented by a structure type as shown in the examples below. It includes a 30-element integer array (digits), a single integer (decpt) to represent the position of the decimal point and an integer (or原创 2021-05-05 06:28:01 · 250 阅读 · 1 评论 -
UVA10523 Very Easy !!!【大数】
Most of the times, the students of Computer Science & Engineering of BUET deal with bogus, tough and very complex formulae. That is why, sometimes, even for a easy problem they think very hard and make the problem much complex to solve. But, the team m原创 2021-04-21 20:34:40 · 212 阅读 · 0 评论 -
UVA10023 Square root【大数】
You are to determinate X by given Y , from expression X =Y\sqrt{Y}YInputThe first line is the number of test cases, followed by a blank line. Each test case of the input contains a positive integer Y (1 ≤ Y ≤ 101000), with no bla原创 2021-04-10 18:48:45 · 226 阅读 · 1 评论 -
HDU2100 Lovekey【大数+进制】
LovekeyTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11215 Accepted Submission(s): 3636Problem DescriptionXYZ-26进制数是一个每位都是大写字母的数字。 A、B、C、…、X、Y、Z 分别依次代表一个0 ~ 25 的数字,一个 n 位的26进制数转化成是10进制的规则如下A原创 2020-06-14 00:14:57 · 447 阅读 · 0 评论 -
UVA324 LA5432 POJ1454 Factorial Frequencies【大数+进制】
Factorial FrequenciesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2927 Accepted: 1252DescriptionIn an attempt to bolster her sagging palm-reading business, Madam Phoenix has decided...原创 2020-04-26 01:11:11 · 299 阅读 · 0 评论 -
UVA10489 Boxes of Chocolates【大数】
Little Pippy has got a lot of chocolates on her 6-th birthday. She is a very good and charming girl and always shares his belongings with her friends (and she has lots of friends). Now she wants to sh...原创 2020-03-10 00:38:18 · 449 阅读 · 0 评论 -
UVA10303 HDU1130 How Many Trees?【卡特兰数+大数】
How Many Trees?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5116 Accepted Submission(s): 2828Problem DescriptionA binary search tree i...原创 2020-03-07 17:45:21 · 352 阅读 · 0 评论 -
HDU5666 Segment【大数】
SegmentTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2604 Accepted Submission(s): 986Problem DescriptionSilen August does not like to t...原创 2020-02-23 23:52:03 · 335 阅读 · 0 评论 -
HDU1316 POJ2413 UVA10183 ZOJ1962 How Many Fibs?【大数】
How Many Fibs?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8526 Accepted Submission(s): 3286Problem DescriptionRecall the definition o...原创 2020-02-23 23:29:22 · 283 阅读 · 0 评论 -
HDU1047 Integer Inquiry【大数】
Integer InquiryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28854 Accepted Submission(s): 8224Problem DescriptionOne of the first user...原创 2020-02-23 23:00:34 · 315 阅读 · 0 评论 -
UVA10070 Leap Year or Not Leap Year and ...【日期+大数】
The ancient race of Gulamatu is very advanced in their year calculation scheme. They understand what leap year is (A year that is divisible by 4 and not divisible by 100 with the exception that years ...原创 2019-06-23 18:03:43 · 552 阅读 · 0 评论 -
HDU6225 Little Boxes【大数】
Little BoxesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2520 Accepted Submission(s): 907 Problem DescriptionLittle boxes on the...原创 2018-07-18 17:08:18 · 975 阅读 · 0 评论 -
HDU1753 大明A+B【大数】
大明A+BTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14058 Accepted Submission(s): 5147Problem Description话说,经过了漫长的一个多月,小明已经成长了许多原创 2016-07-23 10:54:26 · 2494 阅读 · 0 评论 -
ZOJ1222 Just the Facts【大数+模除】
Just the FactsTime Limit: 2 Seconds Memory Limit: 65536 KBThe expression N!, read as “N factorial,” denotes the product of the first N positive integers, where N is nonnegative. So, for example...原创 2019-02-21 10:49:51 · 425 阅读 · 0 评论 -
UVA10106 Product【大数乘法】
The problem is to multiply two integers X, Y . (0 ≤ X, Y < 10^250)InputThe input will consist of a set of pairs of lines. Each line in pair contains one multiplyer.OutputFor each input pair of ...原创 2019-02-16 22:41:02 · 268 阅读 · 0 评论 -
UVA10013 Super long sums【大数】
The creators of a new programming language D++ have found out that whatever limit for SuperLongInttype they make, sometimes programmers need to operate even larger numbers. A limit of 1000 digitsis so...原创 2018-02-08 08:45:52 · 667 阅读 · 0 评论 -
HDU1212 Big Number【大数+模除】
Big NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8835Accepted Submission(s): 5994Problem DescriptionAs we know, Big...原创 2017-12-08 12:49:57 · 670 阅读 · 0 评论 -
HDU1002 A + B Problem II【大数】
A + B Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 371486 Accepted Submission(s): 72398Problem DescriptionI have a v原创 2017-09-03 00:31:52 · 1386 阅读 · 0 评论 -
HDU1715 大菲波数【大数】
大菲波数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21198 Accepted Submission(s): 7163Problem DescriptionFibonacci数列,定义如下:f(1)=原创 2017-03-05 07:33:18 · 2043 阅读 · 1 评论 -
HDU2054 A == B ?【大数】
A == B ?Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 116725 Accepted Submission(s): 18601Problem DescriptionGive you two numbe原创 2016-08-15 11:40:58 · 1641 阅读 · 0 评论 -
POJ3982 序列【大数】
序列Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8289 Accepted: 3752Description数列A满足An = An-1 + An-2 + An-3, n >= 3编写程序,给定A0, A1 和 A2, 计算A99Input原创 2016-05-29 07:05:18 · 1735 阅读 · 1 评论 -
POJ2389 Bull Math【大数】
Bull MathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15040 Accepted: 7737DescriptionBulls are so much better at math than the cows. They can multipl原创 2017-02-17 09:05:15 · 943 阅读 · 0 评论 -
HDU1023 Train Problem II【卡特兰数+大数+亿进制+打表】
Train Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10175 Accepted Submission(s): 5440Problem DescriptionAs we all kn原创 2017-12-10 17:08:42 · 639 阅读 · 0 评论 -
HDU1042 n!【大数+万进制】
N!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 86835 Accepted Submission(s): 25542Problem DescriptionGiven an integer N(0 ≤原创 2016-05-29 09:50:44 · 3056 阅读 · 0 评论 -
POJ1503 UVA424 UVALive5399 Integer Inquiry【大数】
Integer InquiryTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 35421 Accepted: 13811DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration ...原创 2018-02-25 01:16:32 · 485 阅读 · 0 评论 -
UVA495 Fibonacci Freeze【大数+万进制】
The Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...) are defined by the recurrence: F0 = 0 F1 = 1 Fi = Fi−1 + Fi−2 for all i ≥ 2 Write a program to calculate the Fibonacci ...原创 2018-04-08 22:12:05 · 818 阅读 · 0 评论 -
UVA465 Overflow【大数】
Write a program that reads an expression consisting of two non-negative integer and an operator. Determine if either integer or the result of the expression is too large to be represented as a “normal...原创 2019-02-16 22:23:44 · 349 阅读 · 0 评论 -
POJ1001 HDU1063 UVA748 UVALive5356 Exponentiation【大数】
ExponentiationTime Limit: 500MS Memory Limit: 10000KTotal Submissions: 185108 Accepted: 44559DescriptionProblems involving the computation of exact values of very large magnitude and precision a...原创 2019-02-16 21:56:30 · 543 阅读 · 0 评论 -
UVA10494 If We Were a Child Again【大数除法】
“Oooooooooooooooh!    If I could do the easy mathematics like my school days!!    I can guarantee, that I’d not make any mistake this time!!”&原创 2019-02-16 09:53:31 · 346 阅读 · 0 评论 -
UVA10220 I Love Big Numbers !【大数】
A Japanese young girl went to a Science Fair at Tokyo. There she met with a Robot named Mico-12, which had AI (You must know about AI-Artificial Intelligence). The Japanese girl thought, she can do so...原创 2018-08-28 17:53:33 · 667 阅读 · 0 评论