----- HDOJ-C++
谙忆
Java相关研发架构工作经验5年。拥有Java相关发明专利8余项。从事过支付行业,研发与架构的系统稳定地支撑着公司日千万交易笔数量级的支付和对账。
二手车SaaS内核研发3年经验+,拥有二手车行业SaaS相关发明专利6项,研发、架构的元数据内核与权限系统,每日亿万级接口调用。
Java企业开发丰富的理论知识和实战经验。2020年CSDN博客之星第12名,同时在一些社区担任名誉职位。认证为CSDN博客专家、CSDN专栏签约作者、InfoQ签约作者、阿里云ACE杭州同城会会长、阿里云社区认证专家、华为云·云享专家。
展开
-
HDOJ 1016 Prime Ring Problem素数环【深搜】
Problem Description A ring is compose of n circles as shown in diagram. Put natural number 1, 2, …, n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Note原创 2016-03-17 19:35:15 · 1865 阅读 · 0 评论 -
HDOJ 1004题 Let the Balloon Rise strcmp()函数
Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest i原创 2015-08-21 14:38:46 · 1843 阅读 · 0 评论 -
HDOJ1518Square 深搜
Square Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11099 Accepted Submission(s): 3566Problem Description Given a set of sticks of var原创 2015-08-24 11:51:53 · 1006 阅读 · 0 评论 -
HDOJ1181变形课 深搜回溯
变形课 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 18474 Accepted Submission(s): 6663Problem Description 呃……变形课上Harry碰到了一点小麻烦,因为他并不像Herm原创 2015-08-25 10:28:06 · 1173 阅读 · 0 评论 -
HDOJ1175连连看 DFS
连连看 Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 25178 Accepted Submission(s): 6230Problem Description “连连看”相信很多人都玩过。没玩过也没关系,下面我给大家介绍原创 2015-08-27 10:40:07 · 1710 阅读 · 0 评论 -
HDOJ1253 胜利大逃亡 BFS
胜利大逃亡 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 29528 Accepted Submission(s): 11136Problem Description Ignatius被魔王抓走了,有一天魔王出差去了,这可是I原创 2015-08-27 16:12:24 · 1721 阅读 · 0 评论 -
HDOJ 1716 排列2(next_permutation函数)
这是一个求一个排序的下一个排列的函数,可以遍历全排列,要包含头文件 下面是以前的笔记 与之完全相反的函数还有prev_permutation (1) int 类型的next_permutation int main() { int a[3]; a[0]=1;a[1]=2;a[2]=3; do { cout<#include < iostream >#include <原创 2015-08-27 16:33:26 · 1815 阅读 · 0 评论 -
新手入门 acm 输入输出练习
A + B Problem(1000)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 355051 Accepted Submission(s): 110841Problem DescriptionCalculate转载 2015-08-29 17:20:51 · 4178 阅读 · 0 评论 -
HDOJ1020 Encoding
Problem Description Given a string containing only ‘A’ - ‘Z’, we could encode it using the following method: Each sub-string containing k same characters should be encoded to “kX” where “X” is the on原创 2015-09-07 16:06:28 · 1557 阅读 · 0 评论 -
HDOJ1003Max Sum
Problem Description Given 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 =原创 2015-09-20 18:17:40 · 2294 阅读 · 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 · 1529 阅读 · 0 评论 -
HDOJ1021题 Fibonacci Again 应用求模公式
Problem Description There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).Input Input consists of a sequence of lines, each containing an integer n. (n < 1,0求模公式原创 2015-08-21 17:53:13 · 1218 阅读 · 0 评论 -
HDOJ 1312题Red and Black
Red and Black Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13508 Accepted Submission(s): 8375Problem Description There is a rectangular原创 2015-08-22 10:59:23 · 1341 阅读 · 0 评论 -
HDOJ/HDU 1180 诡异的楼梯(经典BFS-详解)
Problem Description Hogwarts正式开学以后,Harry发现在Hogwarts里,某些楼梯并不是静止不动的,相反,他们每隔一分钟就变动一次方向. 比如下面的例子里,一开始楼梯在竖直方向,一分钟以后它移动到了水平方向,再过一分钟它又回到了竖直方向.Harry发现对他来说很难找到能使得他最快到达目的地的路线,这时Ron(Harry最好的朋友)告诉Harry正好有一个魔法道具可原创 2016-07-10 16:25:08 · 9567 阅读 · 0 评论 -
HDOJ/HDU 1372 Knight Moves(经典BFS)
Problem Description A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n s原创 2016-07-06 22:13:08 · 8000 阅读 · 0 评论 -
HDOJ/HDU 1241 Oil Deposits(经典DFS)
Problem Description The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a原创 2016-07-05 17:01:29 · 8586 阅读 · 0 评论 -
HDOJ/HDU 1029 Ignatius and the Princess IV(简单DP,排序)
此题无法用JavaAC,不相信的可以去HD1029题试下!Problem Description “OK, you are not too bad, em… But you can never pass the next test.” feng5166 says.“I will tell you an odd number N, and then N integers. There will be原创 2016-06-18 22:27:46 · 9737 阅读 · 0 评论 -
HDOJ/HDU Tempter of the Bone(深搜+奇偶性剪枝)
Problem Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He rea原创 2016-07-04 14:21:25 · 8851 阅读 · 0 评论 -
HDOJ/HDU 1242 Rescue(经典BFS深搜-优先队列)
Problem Description Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the prison.Angel’s原创 2016-07-10 17:09:07 · 8633 阅读 · 0 评论 -
HDOJ 1005 Number Sequence
Problem Description A number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n).Input The input co原创 2016-02-14 16:56:33 · 1918 阅读 · 0 评论 -
HDOJ(HDU) 2502 月之数(进制)
Problem Description 当寒月还在读大一的时候,他在一本武林秘籍中(据后来考证,估计是计算机基础,狂汗-ing),发现了神奇的二进制数。 如果一个正整数m表示成二进制,它的位数为n(不包含前导0),寒月称它为一个n二进制数。所有的n二进制数中,1的总个数被称为n对应的月之数。 例如,3二进制数总共有4个,分别是4(100)、5(101)、6(110)、7(111),他们中1的个原创 2016-05-08 18:06:23 · 2293 阅读 · 0 评论 -
HDOJ 1237题 简单计算器
简单计算器 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15220 Accepted Submission(s): 5195Problem Description 读入一个只包含 +, -, *, / 的非负整数计算表达式,原创 2015-08-22 17:49:01 · 1463 阅读 · 0 评论 -
HDOJ 1005 Number Sequence
Problem Description A number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n).Input The input co原创 2015-09-15 20:09:37 · 1410 阅读 · 0 评论 -
HDOJ2063过山车 匈牙利算法
Problem Description RPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把,Rabbit只愿意和XHD或PQK做partner,Grass只愿意和linle或LL做partner,PrincessSnow愿意原创 2015-09-21 21:03:21 · 1702 阅读 · 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 · 1587 阅读 · 0 评论 -
HDOJ的题目分类
基础题: 1000、1001、1004、1005、1008、1012、1013、1014、1017、1019、1021、1028、1029、1032、1037、1040、1048、1056、1058、1061、1070、1076、1089、1090、1091、1092、1093、1094、1095、1096、1097、1098、1106、1108、1157、1163、1164、1170、1194、转载 2016-03-24 18:43:09 · 3010 阅读 · 0 评论 -
HDOJ(HDU) 2137 circumgyrate the string(此题用Java-AC不过!坑)
此题如果有用JavaACDSee,请评论,谢谢了。Problem Description Give you a string, just circumgyrate. The number N means you just circumgyrate the string N times, and each time you circumgyrate the string for 45 deg原创 2016-05-05 00:47:12 · 1883 阅读 · 0 评论 -
HDOJ(HDU) 2139 Calculate the formula(水题,又一个用JavaAC不了的题目)
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) 看到这个时间,我懵逼了。。。 果然,Java就是打表,都不能AC,因为Java的输入是流,需要的时间比C真的长好多。。。。Problem Description You just need to calculate the su原创 2016-05-05 01:57:40 · 2248 阅读 · 0 评论 -
HDOJ(HDU) 2088 Box of Bricks(平均值)
Problem Description Little Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. “Look, I’ve built a wall!”, he tells his older sister Al原创 2016-04-29 21:41:41 · 1722 阅读 · 0 评论 -
HDOJ 1157 Who's in the Middle
Problem Description FJ is surveying his herd to find the most average cow. He wants to know how much milk this ‘median’ cow gives: half of the cows give as much or more than the median; half give as m原创 2015-10-26 19:32:46 · 1902 阅读 · 0 评论 -
HDOJ 2030 汉字统计
Problem Description 统计给定文本文件中汉字的个数。Input 输入文件首先包含一个整数n,表示测试实例的个数,然后是n段文本。Output 对于每一段文本,输出其中的汉字的个数,每个测试实例的输出占一行。[Hint:]从汉字机内码的特点考虑~Sample Input 2 WaHaHa! WaHaHa! 今年过节不说话要说只说普通话WaHaHa! WaHaHa! 马上就原创 2015-10-26 18:55:18 · 1698 阅读 · 0 评论 -
HDOJ 1312 (POJ 1979) Red and Black
Problem Description There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacen原创 2015-10-26 18:51:33 · 1709 阅读 · 0 评论 -
HDOJ 1032(POJ 1207) The 3n + 1 problem
DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algori原创 2015-10-26 19:01:33 · 1670 阅读 · 0 评论 -
HDOJ1019Least Common Multiple
Problem Description The 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原创 2015-10-09 20:05:20 · 1431 阅读 · 0 评论 -
HDOJ 2095 find your present (2)
Problem Description In the new year party, everybody will get a “special present”.Now it’s your turn to get your special present, a lot of presents now putting on the desk, and only one of them will b原创 2016-02-06 14:55:12 · 1927 阅读 · 0 评论 -
HDOJ(HDU) 2156 分数矩阵(嗯、求和)
Problem Description 我们定义如下矩阵: 1/1 1/2 1/3 1/2 1/1 1/2 1/3 1/2 1/1 矩阵对角线上的元素始终是1/1,对角线两边分数的分母逐个递增。 请求出这个矩阵的总和。Input 每行给定整数N (N<50000),表示矩阵为 N*N.当N为0时,输入结束。Output 输出答案,保留2位小数。Sample Input 1 2原创 2016-05-05 19:08:44 · 4489 阅读 · 0 评论 -
HDOJ 1716 排列2(next_permutation函数)
先讲下用这个函数来求,后面有递归的方法。 用了两种方法。这是一个求一个排序的下一个排列的函数,可以遍历全排列,要包含头文件下面是以前的笔记 与之完全相反的函数还有prev_permutation(1) int 类型的next_permutationint main(){ int a[3];a[0]=1;a[1]=2;a[2]=3; do{cout<<a[0]<<" "<<a原创 2015-12-13 22:40:09 · 1755 阅读 · 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 · 1723 阅读 · 0 评论 -
HDOJ 1064Financial Management
Problem Description Larry graduated this year and finally has a job. He’s making a lot of money, but somehow never seems to have enough. Larry has decided that he needs to grab hold of his financial p原创 2015-10-22 15:58:51 · 1492 阅读 · 0 评论 -
HDOJ 1716 排列2 next_permutation函数
Problem Description Ray又对数字的列产生了兴趣: 现有四张卡片,用这四张卡片能排列出很多不同的4位数,要求按从小到大的顺序输出这些4位数。Input 每组数据占一行,代表四张卡片上的数字(0<=数字<=9),如果四张卡片都是0,则输入结束。Output 对每组卡片按从小到大的顺序输出所有能由这四张卡片组成的4位数,千位数字相同的在同一行,同一行中每个四位数间用空格分隔。原创 2015-10-30 13:48:29 · 2008 阅读 · 0 评论