HDU
相思明月楼
学生一枚,所言之处,如有不当,敬请指正。
展开
-
HDU2018 母牛的故事(变形Fibonacci)
Problem Description有一头母牛,它每年年初生一头小母牛。每头小母牛从第四个年头开始,每年年初也生一头小母牛。请编程实现在第n年的时候,共有多少头母牛? Input输入数据由多个测试实例组成,每个测试实例占一行,包括一个整数n(0<n<55),n的含义如题目中描述。n=0表示输入数据的结束,不做处理。 Output对于每个测试实例,输出在第n年的时候母牛的数量。每个输出...原创 2018-05-25 12:25:26 · 337 阅读 · 0 评论 -
HDU 最长连续公共子序列
A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another sequence Z = <z1, z2, ..., zk> is a subs...原创 2018-06-02 14:23:14 · 410 阅读 · 0 评论 -
2018 Multi-University Training Contest 1 1001 Maximum Multiple
Problem DescriptionGiven an integer n, Chiaki would like to find three positive integers x, y and z such that: n=x+y+z, x∣n, y∣n, z∣n and xyz is maximum.InputThere are multiple test cases. The f...原创 2018-07-23 20:04:03 · 310 阅读 · 0 评论 -
ICPC2017南宁邀请赛1001&&HDU6182 A Math Problem
Problem Description You are given a positive integer n, please count how many positive integers k satisfy kk≤n . Input There are no more than 50 test cases. Each case only contains ...原创 2018-08-15 10:35:01 · 347 阅读 · 0 评论 -
HDU 6112 今夕何夕(模拟)
Problem Description 今天是2017年8月6日,农历闰六月十五。 小度独自凭栏,望着一轮圆月,发出了“今夕何夕,见此良人”的寂寞感慨。 为了排遣郁结,它决定思考一个数学问题:接下来最近的哪一年里的同一个日子,和今天的星期数一样?比如今天是8月6日,星期日。下一个也是星期日的8月6日发生在2023年。 小贴士:在公历中,能被4整除但不能被100整除...原创 2018-08-15 10:40:10 · 490 阅读 · 0 评论 -
HDU 1251 统计难题
Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行...原创 2018-08-08 21:42:20 · 233 阅读 · 0 评论 -
HDU 6440 2018中国大学生程序设计网络选拔赛
Problem DescriptionFreshmen frequently make an error in computing the power of a sum of real numbers, which usually origins from an incorrect equation (m+n)p=mp+np, where m,n,p are real numbers. Let...原创 2018-08-26 13:41:42 · 359 阅读 · 0 评论 -
HDU 3037 Saving Beans (Lucas定理求大数组合数)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3037#include <iostream>#include <cstdio>using namespace std;typedef long long ll;const int N = 150000;ll n, m, p;ll fac[N];void in...原创 2018-08-21 11:54:21 · 347 阅读 · 2 评论 -
HDU 6281 sorting (湘潭邀请赛F题)
Problem DescriptionBobo has n tuples (a1,b1,c1),(a2,b2,c2),…,(an,bn,cn).He would like to find the lexicographically smallest permutation p1,p2,…,pn of 1,2,…,n such that for i∈{2,3,…,n} it holds tha...原创 2018-08-24 17:00:12 · 814 阅读 · 0 评论 -
HDU1058 Humble Numbers
Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first 2...原创 2018-06-06 17:45:50 · 261 阅读 · 0 评论 -
HDU Super Jumping! Jumping! Jumping!
Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now. The game can b...原创 2018-06-06 17:25:15 · 295 阅读 · 0 评论 -
HDU 1164 Eddy's research I(素数积)
Problem DescriptionEddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he can't write...原创 2018-06-13 12:13:42 · 243 阅读 · 0 评论 -
HDU 1715 大斐波拉契数
Problem DescriptionFibonacci数列,定义如下:f(1)=f(2)=1f(n)=f(n-1)+f(n-2) n>=3。计算第n项Fibonacci数值。 Input输入第一行为一个整数N,接下来N行为整数Pi(1<=Pi<=1000)。 Output输出为N行,每行为对应的f(Pi)。 Sample Input512345 Sample Outp...原创 2018-06-11 20:53:16 · 314 阅读 · 0 评论 -
HDU 1753 大明A+B
Problem Description话说,经过了漫长的一个多月,小明已经成长了许多,所以他改了一个名字叫“大明”。这时他已经不是那个只会做100以内加法的那个“小明”了,现在他甚至会任意长度的正小数的加法。现在,给你两个正的小数A和B,你的任务是代表大明计算出A+B的值。 Input本题目包含多组测试数据,请处理到文件结束。每一组测试数据在一行里面包含两个长度不大于400的正小数A和B。 Out...原创 2018-06-11 21:17:43 · 220 阅读 · 0 评论 -
HDU 1063 Exponentiation
Problem 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 man...原创 2018-06-11 21:32:38 · 591 阅读 · 0 评论 -
HDU 1316 How Many Fibs?
Problem 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 [a, b]...原创 2018-06-11 21:49:16 · 217 阅读 · 0 评论 -
HDU 1003 maxsum
Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4...原创 2018-05-29 21:51:49 · 289 阅读 · 0 评论 -
HDU 1097 A hard puzzle
Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin.this...原创 2018-06-12 22:01:20 · 196 阅读 · 0 评论 -
HDU 1019 Least Common Multiple
Problem DescriptionThe least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 ...原创 2018-06-12 22:09:41 · 195 阅读 · 0 评论 -
HDU 1025 Constructing Roads In JGShining's Kingdom(最长上升序列)
Problem Description:JGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Half of these cities are rich in resource (we call them rich citi...原创 2018-06-06 11:28:09 · 251 阅读 · 0 评论 -
HDU 1097 A hard puzzle
Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin.t...原创 2018-10-24 12:09:00 · 645 阅读 · 0 评论