2021年1月7日
摘要: ![](https://static.geekbang.org/infoq/5c1b65429b946.png) 阅读全文
posted @ 2021-01-07 08:42 yoyo_sincerely 阅读(37) 评论(0) 推荐(0) 编辑
  2021年1月6日
摘要: https://github.com/yoyo-sincerely/golang-developer-roadmap-cn https://github.com/golang/example/ https://github.com/astaxie/build-web-application-with 阅读全文
posted @ 2021-01-06 11:30 yoyo_sincerely 阅读(78) 评论(0) 推荐(0) 编辑
  2020年12月28日
摘要: //一次性全部展示,而不是串行 git difftool --dir-diff --no-symlinks 阅读全文
posted @ 2020-12-28 20:23 yoyo_sincerely 阅读(95) 评论(0) 推荐(0) 编辑
  2018年7月24日
摘要: problem tip answer include include include using namespace std; int N; struct P{ string name, gender; int grade; }; vector lm, hf; bool Comp(P a, P b) 阅读全文
posted @ 2018-07-24 21:15 yoyo_sincerely 阅读(216) 评论(0) 推荐(0) 编辑
摘要: problem To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem is that there are always some confusing pa 阅读全文
posted @ 2018-07-24 20:48 yoyo_sincerely 阅读(277) 评论(0) 推荐(0) 编辑
  2018年7月22日
摘要: problem To store English words, one method is to use linked lists and store a word letter by letter. To save some space, we may let the words share th 阅读全文
posted @ 2018-07-22 20:54 yoyo_sincerely 阅读(226) 评论(0) 推荐(0) 编辑
  2018年7月19日
摘要: problem Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to 阅读全文
posted @ 2018-07-19 23:12 yoyo_sincerely 阅读(198) 评论(0) 推荐(0) 编辑
摘要: problem experience Palindromic 回文的 pat 的判题器不支持long long I64d, 支持lld, printf时应该使用 lld。 阅读全文
posted @ 2018-07-19 21:37 yoyo_sincerely 阅读(201) 评论(0) 推荐(0) 编辑
  2018年7月18日
摘要: problem tip answer include include include include define LL long long using namespace std; string a, da; int na[22], nda[22]; void GetNum(string t, i 阅读全文
posted @ 2018-07-18 21:18 yoyo_sincerely 阅读(255) 评论(0) 推荐(0) 编辑
  2018年7月17日
摘要: problem A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and publish 阅读全文
posted @ 2018-07-17 22:14 yoyo_sincerely 阅读(194) 评论(0) 推荐(0) 编辑
摘要: problem A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to 阅读全文
posted @ 2018-07-17 20:09 yoyo_sincerely 阅读(343) 评论(0) 推荐(0) 编辑
  2018年7月16日
摘要: problem exprience 二叉树要多写几次,就熟悉了。 阅读全文
posted @ 2018-07-16 22:39 yoyo_sincerely 阅读(244) 评论(0) 推荐(0) 编辑
摘要: problem A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromi 阅读全文
posted @ 2018-07-16 21:13 yoyo_sincerely 阅读(188) 评论(0) 推荐(0) 编辑
  2018年7月15日
摘要: problem Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. A 阅读全文
posted @ 2018-07-15 20:20 yoyo_sincerely 阅读(229) 评论(0) 推荐(0) 编辑
  2018年7月14日
摘要: problem A long distance telephone company charges its customers by the following rules: Making a long distance call costs a certain amount per minute, 阅读全文
posted @ 2018-07-14 22:40 yoyo_sincerely 阅读(544) 评论(0) 推荐(0) 编辑
  2018年7月13日
摘要: problem A reversible prime in any number system is a prime whose "reverse" in that number system is also a prime. For example in the decimal system 73 阅读全文
posted @ 2018-07-13 23:01 yoyo_sincerely 阅读(360) 评论(0) 推荐(0) 编辑
摘要: problem Suppose a bank has N windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. T 阅读全文
posted @ 2018-07-13 21:55 yoyo_sincerely 阅读(238) 评论(0) 推荐(0) 编辑
  2018年7月12日
摘要: problem tips answer 并查集 include using namespace std; define INF 0x3f3f3f3f define Max 1010 define fi first define se second int N, M, K; int ci[Max], 阅读全文
posted @ 2018-07-12 19:22 yoyo_sincerely 阅读(301) 评论(0) 推荐(0) 编辑
  2018年7月11日
摘要: problem tips answer include using namespace std; define INF 0x3f3f3f3f define Max 2001 int N, M; void NA(){cout id; bool CompC(St a, St b){ return a.C 阅读全文
posted @ 2018-07-11 20:40 yoyo_sincerely 阅读(249) 评论(0) 推荐(0) 编辑
摘要: problem tip answer include using namespace std; define INF 0x3f3f3f3f float GetMax(float a, float b, float c){ return max(max(a, b),c); } int GetStatu 阅读全文
posted @ 2018-07-11 19:20 yoyo_sincerely 阅读(206) 评论(0) 推荐(0) 编辑
摘要: problem tip 给出两个数以及其中一个数的进制,求两个数相等时另一个数可能的进制。(数只可能由0 1,a z组成,但进制可能会超过36进制,坑点。) answer include using namespace std; define INF 0x3f3f3f3f long long tag 阅读全文
posted @ 2018-07-11 18:57 yoyo_sincerely 阅读(377) 评论(0) 推荐(0) 编辑
  2018年7月5日
摘要: problem This time, you are supposed to find A B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each c 阅读全文
posted @ 2018-07-05 22:22 yoyo_sincerely 阅读(274) 评论(0) 推荐(0) 编辑
摘要: problem tip 求电梯载上所有人时,所花时间。 answer include using namespace std; define INF 0x3f3f3f3f int n; int main(){ // freopen("test.txt", "r", stdin); cin n; in 阅读全文
posted @ 2018-07-05 21:44 yoyo_sincerely 阅读(234) 评论(0) 推荐(0) 编辑
摘要: problem Given a sequence of K integers { N~1~, N~2~, ..., N~K~ }. A continuous subsequence is defined to be { N~i~, N~i+1~, ..., N~j~ } where 1 using 阅读全文
posted @ 2018-07-05 21:10 yoyo_sincerely 阅读(413) 评论(0) 推荐(0) 编辑
  2018年7月4日
摘要: problem tip anwser include using namespace std; string firstName, lastName, firstTime, lastTime; bool CompTime(int a1, int b1, int c1, int a2, int b2, 阅读全文
posted @ 2018-07-04 22:15 yoyo_sincerely 阅读(261) 评论(0) 推荐(0) 编辑
摘要: problem Given a non negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English. Input Sp 阅读全文
posted @ 2018-07-04 21:31 yoyo_sincerely 阅读(212) 评论(0) 推荐(0) 编辑
摘要: problem A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child. Input Each input file 阅读全文
posted @ 2018-07-04 20:49 yoyo_sincerely 阅读(240) 评论(0) 推荐(0) 编辑
  2018年7月3日
摘要: problem 1003 Emergency (25)(25 point(s)) As an emergency rescue team leader of a city, you are given a special map of your country. The map shows seve 阅读全文
posted @ 2018-07-03 21:53 yoyo_sincerely 阅读(139) 评论(0) 推荐(0) 编辑
  2018年7月1日
摘要: problem 1002 A+B for Polynomials (25)(25 point(s)) This time, you are supposed to find A+B where A and B are two polynomials. Input Each input file co 阅读全文
posted @ 2018-07-01 21:57 yoyo_sincerely 阅读(229) 评论(0) 推荐(0) 编辑
摘要: problem 1001 A+B Format (20)(20 point(s)) Calculate a + b and output the sum in standard format that is, the digits must be separated into groups of t 阅读全文
posted @ 2018-07-01 19:14 yoyo_sincerely 阅读(190) 评论(0) 推荐(0) 编辑