 Unix Robots

Wyest is fond of the game Unix Robots. It is played on a twodimensional rectangular board. The objective of the game is to escape from a number of robots, which have been programmed with only a single objective: to kill you.
The player character and the robots start at randomly selected grids in the board. Every time the player character moves a square in any direction (horizontally, vertically, or diagonally), so does each robot, in whichever direction is the shortest way. That is, if a robot has two optimal approaches, it will first make xrobot  xman and yrobot  yman both smaller (move diagonally). (In fact there're robots moving two squares in some sets of Unix Robots, but now we're not considering them.) If the player character collides with a robot, he dies and the game ends. However, the robots are also fatal to each other  when two robots collide, they both die, leaving behind a junkheap. These junkheaps are also fatal to robots.
You can also transport into a grid in cases where moving is otherwise impossible. There're two kinds of transports, one is safe teleport, which has a limit of using, and the other is random. if you have no more safe ones, you'll have to be transported into a randomly selected location, maybe right into the path of a robot.
Generally, the player will gain one safe teleport moving onto the next level, no doubt it's too few. So the Wait button is introduced to you. If you press it, you will no longer be able to move until either all of the robots (which still move towards you) are gone, or you are killed. If you survive finally, each robot will earn you one extra safe teleports to use in future.
Now Wyest is playing the game again, and is asking you to do her a little favor. Given the situation on the board, you only need to tell her whether she can press the Wait button now.
Input
There're multiple test cases. In each test case, the first line contains two integers x and y, coordinates of the grid where the player character is. The second line of a case is an integer n, indicating the number of robots, and n lines follow, each contains two integers xi and yi, coordinates of the grid where roboti is. Then a single line containing an integer m, indicating the number of junkheaps of previous collisions on the board, and m lines follow, each contains two integers xj and yj, coordinates of the grid where junkheapj is.
0 < n <= 100, 0 <= m <= 100. All coordinates between 500000000 and 500000000, and you can safely assume that in each case, no two things are in the same grid initially.Output
A single line for each case telling whether Wyest can Wait in the current situation, either "YES" or "NO".
Sample Input
0 0
2
3 1
3 1
0
0 0
1
2 0
1
3 0
Sample OutputYES
NO
The Game of 31 的问题_course
20191231Problem Description The game of 31 was a favourite of con artists who rode the railroads in days of yore. The game is played with a deck of 24 cards: four labelled each of 1, 2, 3, 4, 5, 6. The cards in the deck are visible to both players, who alternately withdraw one card from the deck and place it on a pile. The object of the game is to be the last player to lay a card such that the sum of the cards in the pile does not exceed 31. Your task is to determine the eventual winner of a partially played game, assuming each player plays the remainder of the game using a perfect strategy. For example, in the following game player B wins: Player A plays 3 Player B plays 5 Player A plays 6 Player B plays 6 Player A plays 5 Player B plays 6 Input The input will consist of several lines; each line consists of a sequence of zero or more digits representing a partially completed game. The first digit is player A's move; the second player B's move; and so on. You are to complete the game using a perfect strategy for both players and to determine who wins. Output For each game, print a line consisting of the input, followed by a space, followed by A or B to indicate the eventual winner of the game. Sample Input 356656 35665 3566 111126666 552525 Sample Output 356656 B 35665 B 3566 A 111126666 A 552525 A
Square _course
20161228Description Given a set of sticks of various lengths, is it possible to join them endtoend to form a square? Input The first line of input contains N, the number of test cases. Each test case begins with an integer 4 <= M <= 20, the number of sticks. M integers follow; each gives the length of a stick  an integer between 1 and 10,000. Output For each case, output a line containing "yes" if is is possible to form a square; otherwise output "no". Sample Input 3 4 1 1 1 1 5 10 20 30 40 50 8 1 7 2 6 4 4 3 5 Sample Output yes no yes
Light The Square _course
20170826There is a new square been built in hangzhou,now in order to light the whole square in the night,it must need a lots of lights. The government is lack of finance,so they want the the number of lights to be least.So they ask you to help. To simplify the problem,the square can be see as a n��m rectangle. And lights are placed in this grids.If one grid has a light,its left, up, right, down grid can also be bright.Given m and n,Write a program to calculate the mininum number of lights. Input The input file will contain one or more test cases,Each test case contains of one line containing two integers 0<n<150 and 0<m<9,separated by a space.The input file is end with m=n=0.and this case should not proceed. Output For each test case,output one line "The square S need(s) L lights.",where S is the test case,L is the mininum number of this square. Sample Input 1 1 2 2 3 3 0 0 Sample Output The square 1 need(s) 1 lights. The square 2 need(s) 2 lights. The square 3 need(s) 3 lights.
Magic Square _course
20170327In recreational mathematics, a magic square of ndegree is an arrangement of n2 numbers, distinct integers, in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant. For example, the picture below shows a 3degree magic square using the integers of 1 to 9. Given a finished number square, we need you to judge whether it is a magic square. Input The input contains multiple test cases. The first line of each case stands an only integer N (0 < N < 10), indicating the degree of the number square and then N lines follows, with N positive integers in each line to describe the number square. All the numbers in the input do not exceed 1000. A case with N = 0 denotes the end of input, which should not be processed. Output For each test case, print "Yes" if it's a magic square in a single line, otherwise print "No". Sample Input 2 1 2 3 4 2 4 4 4 4 3 8 1 6 3 5 7 4 9 2 4 16 9 6 3 5 4 15 10 11 14 1 8 2 7 12 13 0 Sample Output No No Yes Yes
如何确认您正在连接Square API  示例脚本问题？_course
20180915<div class="posttext" itemprop="text"> <p>I am going by the PHP Square Connect example here:</p> <p><a href="https://github.com/square/connectapiexamples/tree/master/connectexamples/v2/php_payment" rel="nofollow noreferrer">example</a></p> <p>It appears to die at line 40:</p> <pre><code>$transactions_api = new \SquareConnect\Api\TransactionsApi(); </code></pre> <p>I suspect my setup. Is there a way to check that you are actually communicating with the API properly?</p> <hr> <p>More Info: I turned on php error reporting with</p> <pre><code>ini_set('display_errors', 1); ini_set('display_startup_errors', 1); error_reporting(E_ALL); </code></pre> <p>And now I get:</p> <blockquote> <p>Notice: Undefined variable: location in my_path/st.php on line 283</p> </blockquote> <p>and</p> <blockquote> <p>Fatal error: Call to a member function getId() on null in my_path/st.php on line 283</p> </blockquote> <p>Seems like a problem with either the API or the example. I had a similar problem with the Square Connect Example where it had bad lines:</p> <p><a href="https://stackoverflow.com/questions/51799860/checkoutapisetupguidereferencescommandsthatkilltestpagesanddonotexi">Checkout API Setup Guide references commands that kill test pages AND do not exist in API</a></p> </div>
Black Square _course
20161210Inspired by Kazimir Malevich’s masterpiece “Black Square”, Peter Palevich is planning to create his own version. He prepared a rectangular grid containing m×n white cells arranged in m rows of n cells each. Peter painted some of the cells black, so that the black cells formed a square of size s×s cells. But later that day Peter became disappointed with his painting and destroyed it, cutting it to horizontal stripes of size 1×n and burning them in the ﬁreplace. Next morning Peter changed his mind and decided to restore his painting. He tried to ﬁnd its remains in the ﬁreplace, and fortunately one of the stripes, namely the kth from the top, survived the ﬁre. Now Peter wonders whether it is possible to restore the painting based on this stripe. Help him to do it. Input The ﬁrst line of the input ﬁle contains four integer numbers: m, n, s and k (1 ≤ m,n ≤ 5000; 1≤ s ≤min(m,n); 1≤ k ≤ m). The second line contains n characters and describes the kth line of the painting, ‘.’ stands for a white cell, ‘*’ stands for a black cell. Output If the initial painting can be uniquely restored, output “Unique”. If there are several paintings that could have been painted by Peter, output “Ambiguous”. If there are no possible paintings, output “Impossible”. Examples black.in black.out 4 4 1 2 ..*. Unique 4 4 2 2 ..** Ambiguous 4 4 3 2 .*.* Impossible
Square Coins _course
20170510People in Silverland use square coins. Not only they have square shapes but also their values are square numbers. Coins with values of all square numbers up to 289 (=17^2), i.e., 1credit coins, 4credit coins, 9credit coins, ..., and 289credit coins, are available in Silverland. There are four combinations of coins to pay ten credits: ten 1credit coins, one 4credit coin and six 1credit coins, two 4credit coins and two 1credit coins, and one 9credit coin and one 1credit coin. Your mission is to count the number of ways to pay a given amount using coins of Silverland. Input The input consists of lines each containing an integer meaning an amount to be paid, followed by a line containing a zero. You may assume that all the amounts are positive and less than 300. Output For each of the given amount, one line containing a single integer representing the number of combinations of coins should be output. No other characters should appear in the output. Sample Input 2 10 30 0 Sample Output 1 4 27
Lagrange's FourSquare Theorem _course
20170911The fact that any positive integer has a representation as the sum of at most four positive squares (i.e. squares of positive integers) is known as Lagrange's FourSquare Theorem. The first published proof of the theorem was given by JosephLouis Lagrange in 1770. Your mission however is not to explain the original proof nor to discover a new proof but to show that the theorem holds for some specific numbers by counting how many such possible representations there are. For a given positive integer n, you should report the number of all representations of n as the sum of at most four positive squares. The order of addition does not matter, e.g. you should consider 4^2 + 3^2 and 3^2 + 4^2 are the same representation. For example, let's check the case of 25. This integer has just three representations 1^2+2^2+2^2+4^2, 3^2 + 4^2, and 5^2. Thus you should report 3 in this case. Be careful not to count 4^2 + 3^2 and 3^2 + 4^2 separately. Input The input is composed of at most 255 lines, each containing a single positive integer less than 2^15, followed by a line containing a single zero. The last line is not a part of the input data. Output The output should be composed of lines, each containing a single integer. No other characters should appear in the output. The output integer corresponding to the input integer n is the number of all representations of n as the sum of at most four positive squares. Sample Input 1 25 2003 211 20007 0 Sample Output 1 3 48 7 738
入门小白求解北京2004ACM的Square题_course
20160213入门小白开始啃题，然而啃不动（无奈摊手） 求大神帮忙解答（最好是有解释啦）(ฅ>ω<*ฅ) SquareTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KBTotal submit users: 177, Accepted users: 26Problem 10002 : No special judgementProblem descriptionGiven a square at [0, 1] * [0, 1] that has N points ( P1, P2, ..., PN ) in the square (you may assume that different points can be at the same position), we can connect the N points and the four corners of the square with some line segments so that through these segments any two of the N+4 points can reach each other (directly or indirectly). The graph length is defined as the total length of the line segments. When N points' positions are fixed, there must exist a way of connecting them, such that it will make the shortest graph length. We can use LEN (P1, P2, ..., PN) to record the graph length using this way of connecting. In this situation, LEN (P1, P2, ..., PN) is a function of P1, P2, ..., PN. When P1, P2, ..., PN change their positions, LEN (P1, P2, ..., PN) also changes. It's easy to prove that there exist some P1', P2', ..., PN' in the square such that LEN (P1', P2', ..., PN') is at its minimum. Given the initial positions of N points, your task is to find out N points P1", P2", ..., PN" in the square such that P1P1" + P2P2" + ... + PNPN" is minimum and LEN (P1", P2", ..., PN") = LEN (P1', P2', ..., PN') . You are requested to output the value of P1P1" + P2P2" + ... + PNPN", where PiPi" is the distance between Pi and Pi". ?￼ For example, Figure1 gives the initial position of P1 and the way of connecting to obtain LEN (P1). In Figure2, it gives the position of P1", which is at the center of the square, and the way of connecting to obtain LEN (P1"). It can be proved that LEN (P1") = LEN (P1?); your job is to output the distance between P1 and P1". InputThe input consists of several test cases. For each test case, the first line consists of one integer N (1 <= N <= 100), the number of points, and N lines follow to give the coordinates for every point in the following format: x y Here, x and y are float numbers within the value [0, 1]. A test case of N = 0 indicates the end of input, and should not be processed. OutputFor each test case, output the value of P1P1" + P2P2" + ... + PNPN". The value should be rounded to three digits after the decimal point. Sample Input1 0.2 0.5 2 0 0.5 0.5 0.5 0Sample Output0.300 0.500Judge Tips费马点 Problem SourceBeijing 2004![图片](https://imgask.csdn.net/upload/201602/13/1455372077_80112.png)
Form a Square _course
20170410Have you ever put up a tent on top of a mountain? The difficulty lies in finding the appropriate positions to fix the nails on the ground, which is a mostly exposed rock where we can hardly press the nails. In our problem we have a square tent, which means we need to fix the four vertices on the ground. For some reason the size of the tent is not very important, but we need to accurately fix the vertices to form a square. Now we have picked four spots that are suitable to press the nails and your job is to decide whether the spots form a square. Input Description Standard input will contain multiple test cases. The first line of the input is a single integer T (1 <= T <= 50) which is the number of test cases. T test cases follow, each preceded by a single blank line. Each test case contains 4 lines for the coordinates of the four distinct vertices that are picked. Each line contains the x and y coordinates separated by a single space (0 < x, y < 1,000). But please notice that the coordinates are not necessarily given in either clockwise or counterclockwise order for a square. Output Description Results should be directed to standard output. Start each case with "Case #:" on a single line, where # is the case number starting from 1. Two consecutive cases should be separated by a single blank line. No blank line should be produced after the last test case. The output should be either "Yes" or "No", indicating whether or not the four given positions can form a square. Sample Input 3 1 1 1 2 2 1 2 2 1 1 2 2 3 3 4 4 1 2 2 1 2 3 3 2 Sample Output Case 1: Yes Case 2: No Case 3: Yes
Square in Circle _course
20170330How many squares can be cut from a circle at most. The problem comes from semiconductor industry. We want to know how many silicon chips can be cut from a circular wafer. And for some technical reason, all squares'(chips) sides should be parallel and it is only allowed to cut the circular wafer into several strips at the first working procedure. NOTE: The chips in the circle should not be divided into pieces. Input Two numbers indicates the sidelength of square and the radius of circle respectively. Two 0 indicates the end of the input. Output A number of squares on a single line which is guaranteed to fit a signed 16bit integer. Sample Input 1 1.42 1 0.8 0 0 Sample Output 4 1
这js代码中的thisSquare参数，怎么理解？_course
20170911这js代码中的thisSquare参数，怎么理解？![图片](https://imgask.csdn.net/upload/201709/11/1505142054_92816.jpg)![图片](https://imgask.csdn.net/upload/201709/11/1505142036_999093.jpg)![图片](https://imgask.csdn.net/upload/201709/11/1505142071_932775.jpg)
Cover the Square _course
20170620Problem Description Oh no! The Enterprise is being attacked by a Borg unit cube. We all know that resistance is futile, but that won’t prevent the captain from trying anyway! The engineers aboard the Enterprise have recently upgraded the size of the ships’s laser beam weapons, such that it can now cut large circular holes into enemy ships. In fact, they can even cut out holes of diameter one, which should get rid of most of the Borg cube in one deadly blow. However, the Borgs are frighteningly persistent, and the captain fears that the remaining undestroyed pieces will cause trouble. Thus, he wants to destroy at least n percent of the cube. The Borg cube is positioned such that one of its faces is perpendicular to the enterprise’s line of sight, so the problem is approximately equivalent to trying to cover a unit square with circles of diameter one. Under this approximation and assuming that the undestroyed parts simply remain motionless at their original position, how many shots are required to destroy at least n percent of the cube? Input The first line of the input will contain m, the number of test cases. m lines will follow, each containing an integer n between 0 and 100 inclusively. Output For each test case, output the number of circles required to cover n percent of the square. Sample Input 3 0 50 100 Sample Output 0 1 4
Square Carpets _course
20170505Mr. Frugal bought a new house. He feels deeply in love with his new house because it has a comfortable living room in which he can put himself completely at ease. He thinks his new house is a really good buy. But, to his disappointment, the floor of its living room has some scratches on it. The floor has a rectangle shape, covered with square panels. He wants to replace all the scratched panels with flawless panels, but he cannot afford to do so. Then, he decides to cover all the scratched panels with carpets. The features of the carpets he can use are as follows. > Carpets are squareshaped. > Carpets may overlap each other. > Carpets cannot be folded. > Different sizes of carpets are available. Lengths of sides of carpets are multiples of that of the panels. The carpets must cover all the scratched panels, but must not cover any of the flawless ones. For example, if the scratched panels are as shown in Figure 1, at least 6 carpets are needed. Figure 1: Example Covering As carpets cost the same irrespective of their sizes, Mr. Frugal would like to use as few number of carpets as possible. Your job is to write a program which tells the minimum number of the carpets to cover all the scratched panels. Input The input consists of multiple data sets. As in the following, the end of the input is indicated by a line containing two zeros. DataSet1 DataSet2 ... DataSetn 0 0 Each data set (DataSeti) represents the state of a floor. The format of a data set is as follows. W H P11 P12 P13 ... P1W P21 P22 P23 ... P2W ... PH1 PH2 PH3 ... PHW The positive integers W and H are the numbers of panels on the living room in the x and y direction, respectively. The values of W and H are no more than 10. The integer Pyx represents the state of the panel. The value of Pyx means, 0: flawless panel (must not be covered), 1: scratched panel (must be covered). Output For each data set, your program should output a line containing one integer which represents the minimum number of the carpets to cover all of the scratched panels. Sample Input 4 3 0 1 1 1 1 1 1 1 1 1 1 1 8 5 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 0 1 1 1 8 8 0 1 1 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 0 1 1 0 10 10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 0 0 Sample Output 2 6 14 29
自定义URL或深层链接打开Square app ios / android吗？_course
20180821<div class="posttext" itemprop="text"> <p>I already have link to pay charges from web app to square ios/android app</p> <p>I learnt form <a href="https://medium.com/squarecornerblog/buildingwebbasedpointsofsaleforandroidios9dfbc0f261e4" rel="nofollow noreferrer">this link</a></p> <p>but actually I am looking for link that open only square app via web button click </p> <p>Like:</p> <pre><code><a href="square://" >Open POS</a> </code></pre> <p>thank you for helping me adv.</p> </div>
Counting square 怎么计算的呢_course
20200622Problem Description There is a matrix of size R rows by C columns. Each element in the matrix is either “0” or “1”. A square is called magic square if it meets the following three conditions. (1) The elements on the four borders are all “1”. (2) Inside the square (excluding the elements on the borders), the number of “1”s and the number of “0”s are different at most by 1. (3) The size of the square is at least 2 by 2. Now given the matrix, please tell me how many magic square are there in the matrix. Input The input begins with a line containing an integer T, the number of test cases. Each case begins with two integers R, C(1<=R,C<=300), representing the size of the matrix. Then R lines follow. Each contains C integers, either 0 or 1. The integers are separated by a single space. Output For each case, output the number of magic square in a single line. Sample Input 3 4 4 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 5 5 1 0 1 1 1 1 0 1 0 1 1 1 0 1 1 1 0 0 1 1 1 1 1 1 1 2 2 1 1 1 1 Sample Output 3 2 1
Bigger Square Please... _course
20170225Tomy has many papersquares. The side length(we call it 'size') of them range from 1 to N1, and he has a really COUNTLESS squares of each kind. He used to be very proud of his squares, but one day, he suddenly wants to have a bigger one  a square of size N! Though he doesn't have such a square, he can make it up with the squares he has. For example. A square of size 7 can be made up with 9 smaller squares, shown below. Note that there should be NO empty space in the square, and NO extra paper outside the square, and the small squares should NOT overlap. As you may guess, Tomy wants to make it using the minimal number of squares he has, can you help? Input The first line of the input contains a single integer T, indicating the number of test cases. (1<=T<=20) Each case contains a single integer N. (2<=N<=50) Output For each test case in the input, print a line containing a single integer K, indicating the minimal number of squares needed to build the target square. In the following K lines, each contains three integers x,y,l indicating the coordinates of topleft corner, and the side length of the corresponding square. (1<=x,y<=N) Sample Input 3 4 3 7 Sample Output 4 1 1 2 1 3 2 3 1 2 3 3 2 6 1 1 2 1 3 1 2 3 1 3 1 1 3 2 1 3 3 1 9 1 1 2 1 3 2 3 1 1 4 1 1 3 2 2 5 1 3 4 4 4 1 5 3 3 4 1
Cover the Square 正方形覆盖_course
20200810Problem Description Oh no! The Enterprise is being attacked by a Borg unit cube. We all know that resistance is futile, but that won’t prevent the captain from trying anyway! The engineers aboard the Enterprise have recently upgraded the size of the ships’s laser beam weapons, such that it can now cut large circular holes into enemy ships. In fact, they can even cut out holes of diameter one, which should get rid of most of the Borg cube in one deadly blow. However, the Borgs are frighteningly persistent, and the captain fears that the remaining undestroyed pieces will cause trouble. Thus, he wants to destroy at least n percent of the cube. The Borg cube is positioned such that one of its faces is perpendicular to the enterprise’s line of sight, so the problem is approximately equivalent to trying to cover a unit square with circles of diameter one. Under this approximation and assuming that the undestroyed parts simply remain motionless at their original position, how many shots are required to destroy at least n percent of the cube? Input The first line of the input will contain m, the number of test cases. m lines will follow, each containing an integer n between 0 and 100 inclusively. Output For each test case, output the number of circles required to cover n percent of the square. Sample Input 3 0 50 100 Sample Output 0 1 4
R语言入门基础
20190601本课程旨在帮助学习者快速入门R语言： 课程系统详细地介绍了使用R语言进行数据处理的基本思路和方法。 课程能够帮助初学者快速入门数据处理。 课程通过大量的案例详细地介绍了如何使用R语言进行数据分析和处理 课程操作实际案例教学，通过编写代码演示R语言的基本使用方法和技巧
 [HarmonyOS][鸿蒙专栏开篇]快速入门OpenHarmony的LiteOS微内核 1557220200913文章目录1、获取源码2、什么是LiteOS3、LiteOS的目录介绍4、LiteOS 中Make体系5、LiteOS 中Kconfig的配置5.1、顶层Kconfig5.2、具体板级的deconfig文件6、编译7、顶层目录下的config.mk文件主要完成如下功能的配置： 1、获取源码 OpenHarmony是HarmonyOS的开源版，由华为捐赠给开放原子开源基金会（OpenAtom Foundation）开源。第一个开源版本支持在128KB~128MB设备上运行，欢迎参加开源社区一起持续演进。 代码.
 12.42MB
华为机考题库(全）
20121222包括招聘的机考题，及面试过程中会问到的数据结构的相关内容，排序算法全部包括并且有改进算法，一点点改进可以让你表现的与众不同，如果好的话给点评价吧亲
 14.93MB
2020年研究生数学建模A题最佳参考资料.zip
20200917时间过的真快，又到了2020年的研究生数学建模竞赛，经过本人一天的时间相关论文资料搜索，发现这几篇论文对于华为题《ASIC芯片上的载波恢复DSP算法设计与实现》具有一定的参考价值，仅供参考，祝大家建模
 学院 Pytorch快速入门
 学院 呆瓜半小时入门python数据分析
 博客 Java中一些jar包的作用
 下载 FreeRTOSv10.4.0.zip与开发手册
 下载 12步入门Python中的decorator装饰器使用方法
 下载 详解Python中使用base64模块来处理base64编码的方法
 博客 20200921
 博客 5分钟看懂XCP协议
 学院 推荐系统实战系列(Python)
 学院 python基础及自动化运维
 学院 微信小程序入门套餐
 博客 RocksDB Wiki
 下载 Python的Tornado框架的异步任务与AsyncHTTPClient
 学院 MATLAB人脸定位识别系统【附GUI+源码】
 下载 深入解析Python中的descriptor描述器的作用及用法
 下载 深入解析Python中的线程同步方法
 学院 软件测试之行为驱动开发（CucumberJava
 下载 Python中json格式数据的编码与解码方法详解
 下载 dos命令大全 黑客必知的DOS命令集合
 博客 Python核心基础第五讲 流程控制及作业
 学院 从前端到全栈的晋级之路
 学院 vueelementadmin快速入门课程
 博客 【网络安全学习笔记】day4 用户与组管理 20200921
 博客 Linux运维  使用LAMP架构部署Cacti监控
 博客 Spring Cloud Eureka Client启动时报错：Completed shut down of DiscoveryClient
 下载 Java中使用GPRC实现客户端与服务端通信示例代码.rar
 博客 《Head First Java》20200921读书笔记
 下载 ABCNet Realtime Scene Text Spotting with Adaptive BezierCurve Network
 学院 python自动化办公【高级】
 博客 分享一下好用的本地格式化软件hijson，这个居然还有人要收费才能下载，真是醉了