上一页 1 ··· 13 14 15 16 17 18 19 20 21 ··· 23 下一页
摘要: Being unique is so important to people on Mars that even their lottery is designed in a unique way. The rule of winning is simple: one bets on a numbe 阅读全文
posted @ 2021-02-04 23:47 XA科研 阅读(90) 评论(0) 推荐(0) 编辑
摘要: 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 the same s 阅读全文
posted @ 2021-02-04 21:22 XA科研 阅读(40) 评论(0) 推荐(0) 编辑
摘要: To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem is that there are always some confusing passwords 阅读全文
posted @ 2021-02-02 23:48 XA科研 阅读(58) 评论(0) 推荐(0) 编辑
摘要: Given two strings S​1​​ and S​2​​, S=S​1​​−S​2​​ is defined to be the remaining string after taking all the characters in S​2​​ from S​1​​. Your task 阅读全文
posted @ 2021-02-02 22:51 XA科研 阅读(47) 评论(0) 推荐(0) 编辑
摘要: A traveler's map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a progra 阅读全文
posted @ 2021-02-01 23:45 XA科研 阅读(61) 评论(0) 推荐(0) 编辑
摘要: Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 1 阅读全文
posted @ 2021-02-01 21:52 XA科研 阅读(31) 评论(0) 推荐(0) 编辑
摘要: Excel can sort records according to any column. Now you are supposed to imitate this function. Input Specification: Each input file contains one test 阅读全文
posted @ 2021-02-01 21:33 XA科研 阅读(56) 评论(0) 推荐(0) 编辑
摘要: 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 palindromic number 阅读全文
posted @ 2021-01-31 00:05 XA科研 阅读(69) 评论(0) 推荐(0) 编辑
摘要: Given any string of N (≥) characters, you are asked to form the characters into the shape of U. For example, helloworld can be printed as: h d e l l r 阅读全文
posted @ 2021-01-30 22:20 XA科研 阅读(62) 评论(0) 推荐(0) 编辑
摘要: 模板: //树状数组 解决动态前缀和问题的数据结构 //树状数组单词查询 int d[maxn],n; //返回最后一个1的下标 int lowbit(int x){ return x&(-x); } //查询 int query(int x){ int res=0; while(x){ res+= 阅读全文
posted @ 2021-01-28 20:44 XA科研 阅读(38) 评论(0) 推荐(0) 编辑
上一页 1 ··· 13 14 15 16 17 18 19 20 21 ··· 23 下一页