![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
----- POJ-ACM
谙忆
Java相关研发架构工作经验5年。拥有Java相关发明专利8余项。从事过支付行业,研发与架构的系统稳定地支撑着公司日千万交易笔数量级的支付和对账。
二手车SaaS内核研发3年经验+,拥有二手车行业SaaS相关发明专利6项,研发、架构的元数据内核与权限系统,每日亿万级接口调用。
Java企业开发丰富的理论知识和实战经验。2020年CSDN博客之星第12名,同时在一些社区担任名誉职位。认证为CSDN博客专家、CSDN专栏签约作者、InfoQ签约作者、阿里云ACE杭州同城会会长、阿里云社区认证专家、华为云·云享专家。
展开
-
POJ 2027 No Brainer
Problem Description Zombies love to eat brains. Yum.Input The first line contains a single integer n indicating the number of data sets. The following n lines each represent a data set. Each data set原创 2015-10-26 19:07:10 · 1792 阅读 · 0 评论 -
POJ 2262 Goldbach's Conjecture
Problem Description In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be原创 2015-10-23 15:31:21 · 1651 阅读 · 0 评论 -
POJ 2390 Bank Interest
Problem Description Farmer John made a profit last year! He would like to invest it well but wonders how much money he will make. He knows the interest rate R (an integer between 0 and 20) that is com原创 2015-10-23 18:20:54 · 1811 阅读 · 0 评论 -
POJ 1936 All in All
DescriptionYou have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we will n原创 2015-10-23 18:42:36 · 1615 阅读 · 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 · 1665 阅读 · 0 评论 -
POJ 2487 Stamps
DescriptionBackground Everybody hates Raymond. He’s the largest stamp collector on planet earth and because of that he always makes fun of all the others at the stamp collector parties. Fortunately e原创 2015-10-26 19:41:31 · 1605 阅读 · 0 评论 -
POJ 2533 Longest Ordered Subsequence
DescriptionA numeric sequence of ai is ordered if a1 < a2 < … < aN. Let the subsequence of the given numeric sequence (a1, a2, …, aN) be any sequence (ai1, ai2, …, aiK), where 1 <= i1 < i2 < … < iK <=原创 2015-10-26 21:13:36 · 1744 阅读 · 0 评论 -
POJ 1159 Palindrome 最长公共子序列的问题
Description A palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determines the原创 2015-10-29 14:03:48 · 1772 阅读 · 0 评论 -
POJ 2260(ZOJ 1949) Error Correction 一个水题
DescriptionA boolean matrix has the parity property when each row and each column has an even sum, i.e. contains an even number of bits which are set. Here’s a 4 x 4 matrix which has the parity propert原创 2015-10-30 20:37:48 · 2163 阅读 · 0 评论 -
POJ 1844 Sum
DescriptionConsider the natural numbers from 1 to N. By associating to each number a sign (+ or -) and calculating the value of this expression we obtain a sum S. The problem is to determine for a give原创 2015-11-07 14:00:04 · 1608 阅读 · 0 评论 -
POJ 1775 (ZOJ 2358) Sum of Factorials
DescriptionJohn von Neumann, b. Dec. 28, 1903, d. Feb. 8, 1957, was a Hungarian-American mathematician who made important contributions to the foundations of mathematics, logic, quantum physics,meteoro原创 2015-11-08 11:02:12 · 1899 阅读 · 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 · 2303 阅读 · 0 评论 -
POJ 2840 Big Clock
DescriptionOur vicar raised money to have the church clock repaired for several weeks. The big clock, which used to strike the hours days and nights, was damaged several weeks ago and had been silent s原创 2015-11-17 11:04:55 · 1726 阅读 · 0 评论 -
POJ 1306 Combinations
DescriptionComputing the exact number of ways that N things can be taken M at a time can be a great challenge when N and/or M become very large. Challenges are the stuff of contests. Therefore, you are原创 2015-10-26 18:24:47 · 1767 阅读 · 0 评论 -
POJ 2105 IP Address
Problem Description Suppose you are reading byte streams from any device, representing IP addresses. Your task is to convert a 32 characters long sequence of ‘1s’ and ‘0s’ (bits) to a dotted decimal f原创 2015-10-26 19:09:37 · 1588 阅读 · 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 · 1653 阅读 · 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 · 1690 阅读 · 0 评论 -
POJ 1163 The Triangle
The TriangleTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other) Total Submission(s) : 23 Accepted Submission(s) : 18 Problem Description 7 3 8 8 1 0 2 7 4原创 2015-10-22 14:16:42 · 1607 阅读 · 0 评论