 链表解决这里的路径的一个遍历的算法问题的做法怎么实现，用C语言的程序设计语言

Problem Description
自从见识了平安夜苹果的涨价后，Lele就在他家门口水平种了一排苹果树，共有N棵。突然Lele发现在左起第P棵树上(从1开始计数)有一条毛毛虫。为了看到毛毛虫变蝴蝶的过程，Lele在苹果树旁观察了很久。虽然没有看到蝴蝶，但Lele发现了一个规律：每过1分钟，毛毛虫会随机从一棵树爬到相邻的一棵树上。
比如刚开始毛毛虫在第2棵树上，过1分钟后，毛毛虫可能会在第1棵树上或者第3棵树上。如果刚开始时毛毛虫在第1棵树上，过1分钟以后，毛毛虫一定会在第2棵树上。
现在告诉你苹果树的数目N，以及毛毛刚开始所在的位置P，请问，在M分钟后，毛毛虫到达第T棵树，一共有多少种行走方案数。
Input
本题目包含多组测试，请处理到文件结束(EOF)。
每组测试占一行，包括四个正整数N,P,M,T(含义见题目描述，0<N,P,M,T<100)Output
对于每组数据，在一行里输出一共的方案数。
题目数据保证答案小于10^9Sample Input
3 2 4 2
3 2 3 2Sample Output
4
0
Go , SuSu 的编写_course
20200107Problem Description When SuSu and his friends visited GanQuan village , something dangerous happened on them . They were trapped in a mysterious cave , what was worse ,there was a terrible monster lived in the cave , so they had to escape from the cave as quickly as possible . But little monsters were also in the cave, as a result ,when SuSu was seen by the little monsters ,they would notice their boss to catch SuSu back. Little monsters' visual field is showed in figure A. The grid colored red represents where the monster stands, the arrow represents which direction the monster walk to ,and the grids colored blue and red represents where the very monster can see at this moment. The monsters often walks in a straight line, and when they faces a wall or the boundary of the maze in front of him, they will cost 1 seconds to turn back, and then walk back along the straight line, until reach a wall again. If SuSu was seen by the monsters ,it's impossible for them to escape from the cave . SuSu needs your help , please tell him the minimum time he needs to walk from the start point to the exit of the cave , be careful not to be seen by the monsters. Every seconds SuSu can move upward downward leftward and rightward , and can also make no movement. Figure A Input The first line of input gives the number of cases, T (at most 90). the first line of each case has four numbers n,m. (2<=n,m<=50) then n lines with m characters describe the maze 'A' represents the init position of SuSu. 'B' represents the exit position of the cave. '.' represents the grids can be walked on. '*' represents the wall which can not be stepped on. Then follows a number k (at most 50). Next k lines with three integers x , y , d (1 <= x <= n,1 <= y <= m,1 <= d <= 4).represents a monster walking to d direction is in (x,y) positon (the topleft grid is (1,1) ) at 0 seconds . The monster walks up when d == 1. walk down when d == 2.walk left when d == 3.walk right when d == 4. Output If SuSu can get to the exit in 1000 seconds ,output the minimum time he need. print "胜败兵家事不期 卷土重来是大侠" otherwise. Following the case number (start with 1). Sample Input 1 3 4 *.*. .A.B ***. 1 3 4 1 Sample Output Case 1: 2
C 语言来实现进制转换_course
20190819Problem Description 输入一个十进制数N，将它转换成R进制数输出。 Input 输入数据包含多个测试实例，每个测试实例包含两个整数N(32位整数)和R（2<=R<=16, R<>10）。 Output 为每个测试实例输出转换后的数，每个输出占一行。如果R大于10，则对应的数字规则参考16进制（比如，10用A表示，等等）。 Sample Input 7 2 23 12 4 3 Sample Output 111 1B 11
怎么运用 C 语言的程序，Cylinder_course
20190810Problem Description Using a sheet of paper and scissors, you can cut out two faces to form a cylinder in the following way: 1. Cut the paper horizontally (parallel to the shorter side) to get two rectangular parts. 2. From the first part, cut out a circle of maximum radius. The circle will form the bottom of the cylinder. 3. Roll the second part up in such a way that it has a perimeter of equal length with the circle's circumference, and attach one end of the roll to the circle. Note that the roll may have some overlapping parts in order to get the required length of the perimeter. Given the dimensions of the sheet of paper, can you calculate the biggest possible volume of a cylinder which can be constructed using the procedure described above? Input The input consists of several test cases. Each test case consists of two numbers w and h (1 ≤ w ≤ h ≤ 100), which indicate the width and height of the sheet of paper. The last test case is followed by a line containing two zeros. Output For each test case, print one line with the biggest possible volume of the cylinder. Round this number to 3 places after the decimal point. Sample Input 10 10 10 50 10 30 0 0 Sample Output 54.247 785.398 412.095
Sum 求和问题_course
20200203Description Consider 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 given sum S the minimum number N for which we can obtain S by associating signs for all numbers between 1 to N. For a given S, find out the minimum value N in order to obtain S according to the conditions of the problem. Input The only line contains in the first line a positive integer S (0< S <= 100000) which represents the sum to be obtained. Output The output will contain the minimum number N for which the sum S can be obtained. Sample Input 12 Sample Output 7
模仿通配符的定义实现字符串的模糊查询问题，怎么采用C程序的语言的编写的思路实现_course
20190419Problem Description WisKey downloaded much software in winter vacation, and the disk was in a state of confusion. He wastes many times to find the file everyday. So he wants a tool to help him do this work. The file name consists of lowercase letters. The name pattern is a string of lowercases, '?'s and '*'s. In a pattern, a '?' matches any single lowercase, and a '*' matches none or more lowercases. Let’s do this~ Input The first line of input contains two integers N (0 < N <= 10000) and M (0 < M <=100), representing the number of file names and the number of word patterns. Each of the following N lines contains a file name. After those, each of the last M lines contains a name pattern. You can assume that the length of patterns will not exceed 6, and the length of file names will not exceed 20. There are multiple cases in the data file, process to end of file. Output For each pattern, print a line contains the number of matched file names. If there is no file name that can match the pattern, print "Not match". Sample Input 4 5 this the an is t* ?h*s ??e* *s e Sample Output 2 1 1 2 Not match
首字母变大写 应该如何实现呢_course
20200526Problem Description 输入一个英文句子，将每个单词的第一个字母改成大写字母。 Input 输入数据包含多个测试实例，每个测试实例是一个长度不超过100的英文句子，占一行。 Output 请输出按照要求改写后的英文句子。 Sample Input i like acm i want to get an accepted Sample Output I Like Acm I Want To Get An Accepted
偶数求和 是怎么实现的呢_course
20200526偶数求和 Problem Description 有一个长度为n(n<=100)的数列，该数列定义为从2开始的递增有序偶数，现在要求你按照顺序每m个数求出一个平均值，如果最后不足m个，则以实际数量求平均值。编程输出该平均值序列。 Input 输入数据有多组，每组占一行，包含两个正整数n和m，n和m的含义如上所述。 Output 对于每组输入数据，输出一个平均值序列，每组输出占一行。 Sample Input 3 2 4 2 Sample Output 3 6 3 7
Range 区间的问题_course
20200416Problem Description Some automobiles display the estimated driving range, that is, the distance you can expect to drive it (without adding fuel) before running out of fuel. Here is how it works: periodically, the vehicle's computer records the odometer reading and the weight of fuel in the fuel tank. From this data, the fuel consumption over a certain distance can be computed. From the fuel consumption and the most recent measurement of fuel tank contents (which we assume is current for all practical purposes), the range can be calculated. Intervals over which the quantity of fuel increased (fuel was added to the tank) will not be used in the computations. For example, in the first problem instance of the sample input, the interval where the fuel weight increased from 29.9 kilograms to 34.2 kilograms will not be used. In this example, 16.3 kilograms of fuel were consumed over a distance of 228.6 kilometers. Therefore, the most recently measured fuel contents of 31.2 kilograms will enable you to drive another 438 kilometers (rounded to the nearest integer). The input will always contain at least one interval (two consecutive lines of input) where no fuel was added to the tank. Input The input contains data for a number of problem instances. Each problem instance consists of three or more (odometer reading, fuel weight) pairs, one pair per line. Distances are measured in kilometers and fuel weight in kilograms. All input numbers will be given to one decimal place. The end of each problem instance will be signaled by a (0.0, 0.0) pair. The last problem instance will be followed by a (1.0, 1.0) pair. Output For each problem instance, print the range, rounded to the nearest integer. Sample Input 18400.5 43.2 18440.4 40.4 18482.7 37.0 18540.2 33.1 18585.3 29.9 18620.8 34.2 18664.6 31.2 0.0 0.0 18400.5 43.2 18440.4 40.4 18482.7 37.0 18540.2 33.1 18585.3 29.9 0.0 0.0 1.0 1.0 Sample Output 438 415
SCV集合的查询和数组操作的问题，采用C技术语言_course
20190123Problem Description StarCraft 2 (SC2) is a famous game. More and more people fall in love with this game. As a crazy fan of SC2, Ahua (flower fairy) play it day and night. Recently, he found that the most important part of being a top player of SC2 is economic development, which means you should get as much mine as possible by training SCVs (space construction vehicle) to collect mine. Train a SCV at ith second costs Ci units of mine. After training, this SCV can collect Di units of mine each second. Training a SCV needs one second of time. Based on that, he composes a formula to evaluate the development in a time span from xth second to yth second. Assume at xth second, Ahua has no SCV and mine. He trains one SCV at each second during xth second and yth second (the mount of mine can be negative, so that he always can train SCV). Each SCV will collect some amount of mines for Ahua in each second after it was trained. At ith second Ahua has Mi units of mine in total. The development value is defined as sum(Mi) (x ≤ i ≤ y). Now he asks you to help him calculate the development value. To make it more interesting, Ahua can apply following operations: Cost x y z: the cost of training a SCV between xth second to yth second will increase by z units of mine. i.e. Ci for x ≤ i ≤ y will increase by z. Collect x y z: each SCV trained between xth second and yth second can collect z more mines every second after it has been trained. i.e. Di for x ≤ i ≤ y will increase by z. Query x y: output the development value between xth second and yth second. Input First line of the input is a single integer T (T ≤ 10), indicates there are T test cases. For each test case, the first line is an integer N (1 ≤ N ≤ 100000), means the maximum time you should deal with. Following N lines, each contain two integers Ci and Di (0 ≤ Ci, Di ≤ 100000), the cost and collect speed of SCV training in ith second initially as described above. The next line is an integer Q (1 ≤ Q ≤ 10000), the number of operations you should deal with. Then Q lines followed, each line will be “Cost x y z”, "Collect x y z” or “Query x y”. 1 ≤ x ≤ y ≤ N, 0 ≤ z ≤ 100000 Output For each test case, first output “Case k: “ in a single line, k is the number of the test case, from 1 to T. Then for each "Q x y", you should output a single line contains the answer mod 20110911. Sample Input 1 5 1 3 2 3 3 1 2 2 3 3 5 Query 1 3 Cost 2 2 1 Query 1 3 Collect 1 1 5 Query 1 3 Sample Output Case 1: 2 0 15
矩阵和行列式的一种计算的方式的问题，怎么采用 C 程序的语言代码的编写过程去实现呢？_course
20190518Problem Description There is a matrix M that has n rows and m columns (1≤n≤1000,1≤m≤1000).Then we perform q(1≤q≤100,000) operations: 1 x y: Swap row x and row y (1≤x,y≤n); 2 x y: Swap column x and column y (1≤x,y≤m); 3 x y: Add y to all elements in row x (1≤x≤n,1≤y≤10,000); 4 x y: Add y to all elements in column x (1≤x≤m,1≤y≤10,000); Input There are multiple test cases. The first line of input contains an integer T(1≤T≤20) indicating the number of test cases. For each test case: The first line contains three integers n, m and q. The following n lines describe the matrix M.(1≤Mi,j≤10,000) for all (1≤i≤n,1≤j≤m). The following q lines contains three integers a(1≤a≤4), x and y. Output For each test case, output the matrix M after all q operations. Sample Input 2 3 4 2 1 2 3 4 2 3 4 5 3 4 5 6 1 1 2 3 1 10 2 2 2 1 10 10 1 1 1 2 2 1 2 Sample Output 12 13 14 15 1 2 3 4 3 4 5 6 1 10 10 1
数据结构字符串数组的一个运用，怎么采用C程序编写的语言的算法实现的程序？_course
20190502Problem Description Name PK is a funny game on the Internet. The game will calculate character's property based on its name. Now we're simulating a simple Name PK game. Each character has 3 parameters: HP, STR and SPD (HP for health point, STR for strength and SPD for attacking speed). For a name string of length N, Ci is ASCII code (decimal) of the ith char. PK rule: 1. Timer begins to increase from 1. When it is a multiple of (20SPD), the corresponding character A has that SPD attack once, the opposite lose STR(A's) HP. 2. When any side has a HP ≤ 0, the PK is over. Input The input consists of several test cases. The first line of input consists of an integer T, indicating the number of test cases. Each test case is on a separate line, and it consists two strings separated by a whitespace, indicating the name of the characters. Technical Specification 1. Names contain only English letters. 2. The length of each character's name is more than 1 and no more than 20. 3. T ≤ 1000. Output For each test case, output a line consisting of the result of the first character: "win", "lose" or "tie". Sample Input 3 Sylvia xay Ivan Stacy Boyd Greg Sample Output lose win lose
C语言作为一种高级语言，有3个优点，除了代码效率高，还有什么别的优点_course
20191231C语言作为一种高级语言，有3个优点，除了代码效率高，还有什么别的优点
排序，输出出现次数最多的颜色，用C语言怎么实现？_course
20181229Problem Description Contest 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 is over, they will count the balloons of each color and find the result. This year, they decide to leave this lovely job to you. Input Input contains multiple test cases. Each test case starts with a number N (0 < N <= 1000)  the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lowercase letters. A test case with N = 0 terminates the input and this test case is not to be processed. Output For each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case. Sample Input 5 green red blue red red 3 pink orange pink 0 Sample Output red pink
数字的多次的迭代的算法的问题的解决的方式，用的是C程序的语言的编写的过程怎么做_course
20190409Problem Description For any positive integer n, we define function F(n) and XEN(n). For a collection S(n)={1,2,...,2n}, we select some numbers from it. For a selection, if each selected number could not be divided exactly by any other number in this selection, we will call the selection good selection. Further, we call a good selection best selection if the selection has more elements than any other good selection from S(n). We define F(n) the number of elements in the best selection from S(n). For example, n=2, F(n)=2. From the collection {1,2,3,4}, we can make good selection just like {2,3} or {3,4}, but we can't make any larger selection. So F(2) = 2. Then we pay attention to XEN(n). For every S(n), there are always some numbers could not be selected to make up any best selection. For instance, when n=2, 1 is always could not be chosen. What's more, for every S(n), there is a number k which satisfies that all the number, from 0 to k, are always could not be chosen. Now we let XEN(n)=k: n=2, F(n)=2, XEN(2)=1; n=4, F(n)=4, XEN(4)=1. You should write a program to calculate the value of F(n) and XEN(n) with a given number n. Input Your program is to read from standard input. There are multiple cases. For each case, one integer n (1 ≤ n ≤ 10^7) in a line. Output Output two integers with one space between them in one line per case. Sample Input 2 4 Sample Output 2 1 4 1
人名字符串排序的计算，用C程序的语言代码编写技术去实现的方式是什么？_course
20190515Problem Description Dear Contestant, I'm going to have a party at my villa at HaliBula to celebrate my retirement from BCM. I wish I could invite all my coworkers, but imagine how an employee can enjoy a party when he finds his boss among the guests! So, I decide not to invite both an employee and his/her boss. The organizational hierarchy at BCM is such that nobody has more than one boss, and there is one and only one employee with no boss at all (the Big Boss)! Can I ask you to please write a program to determine the maximum number of guests so that no employee is invited when his/her boss is invited too? I've attached the list of employees and the organizational hierarchy of BCM. Best, Brian Bennett P.S. I would be very grateful if your program can indicate whether the list of people is uniquely determined if I choose to invite the maximum number of guests with that condition. Input The input consists of multiple test cases. Each test case is started with a line containing an integer n (1 ≤ n ≤ 200), the number of BCM employees. The next line contains the name of the Big Boss only. Each of the following n1 lines contains the name of an employee together with the name of his/her boss. All names are strings of at least one and at most 100 letters and are separated by blanks. The last line of each test case contains a single 0. Output For each test case, write a single line containing a number indicating the maximum number of guests that can be invited according to the required condition, and a word Yes or No, depending on whether the list of guests is unique in that case. Sample Input 6 Jason Jack Jason Joe Jack Jill Jason John Jack Jim Jill 2 Ming Cho Ming 0 Sample Output 4 Yes 1 No
等差数列的问题，采用C 语言如何才能进行求解呢？？_course
20190107Problem Description A sequence b1,b2,⋯,bn are called (d1,d2)arithmetic sequence if and only if there exist i(1≤i≤n) such that for every j(1≤j<i),bj+1=bj+d1 and for every j(i≤j<n),bj+1=bj+d2. Teacher Mai has a sequence a1,a2,⋯,an. He wants to know how many intervals [l,r](1≤l≤r≤n) there are that al,al+1,⋯,ar are (d1,d2)arithmetic sequence. Input There are multiple test cases. For each test case, the first line contains three numbers n,d1,d2(1≤n≤105,d1,d2≤1000), the next line contains n integers a1,a2,⋯,an(ai≤109). Output For each test case, print the answer. Sample Input 5 2 2 0 2 0 2 0 5 2 3 2 3 3 3 3 Sample Output 12 5
十进制的数字对应的罗马数字字母的计算，怎么使用C程序语言代码高效实现的算法？_course
20190509Problem Description Roman numerals are an ancient numbering system used extensively throughout Europe through the 13th century (where it was eventually replaced by our current positional system). Vestiges of this system still exist today on clock faces, building cornerstones, Super Bowls and Star Wars episodes. The system uses the following 7 symbols: Symbols I, X, C and M can be repeated as needed (though never more than three times for I, X and C), so that 3 is represented as III, 27 as XXVII and 4865 as MMMMDCCCLXV. The symbols are always written from the highest value to the lowest, but for one exception: if a lower symbol precedes a higher one, it is subtracted from the higher. Thus 4 is written not as IIII but as IV, and 900 is written as CM. The rules for this subtractive behavior are the following: 1. Only I, X and C can be subtracted. 2. These numbers can only appear once in their subtractive versions (e.g., you can’t write 8 as IIX). 3. Each can only come before symbols that are no larger than 10 times their value. Thus we can not write IC for 99 or XD for 490 (these would be XCIX and CDXC, respectively). Note that the first two words in this problem title are invalid Roman numerals, but the third is fine. Your task for this problem is simple: read in a set of Roman numeral values and output their sum as a Roman numeral. Input Input will consist of multiple test cases. Each test case starts with a positive integer n indicating the number of values to add. After this will come n values (potentially several on a line), all valid Roman numerals with whitespace only coming between values. A value of n = 0 will indicate end of input. All sums will be less than 5000. Output For each test case, output the case number and the sum, both as Roman numerals, using the format shown below. Case numbers should start at I. Sample Input 2 XII MDL 4 I I I I 0 Sample Output Case I: MDLXII Case II: IV
图形的旋转问题 Endless Spin_course
20190825Problem Description I spin it again and again,and throw it away finally. So now I have a row of n ball,named from 1 to n,each ball is white initially. At each step I randomly chose a interval [l, r] and paint all ball in this interval to black. It means every interval have a equal chance of being chosen. And I'll stop if all ball are black.What is the expected steps before I stop? Input The first line contains integer T(1<=T<=50). Denoting the number of the test cases. Then T lines follows, each line contains an integer n (1<=n<=50). Output For each test cases,print the answer in a line. Print the answer rounded to 15 decimal places. Sample Input 3 1 2 3 Sample Output 1.000000000000000 2.000000000000000 2.900000000000000
因数的寻找提取的算法，请教下采用C程序的语言的实现的设计的方式_course
20190409Problem Description There is a sequence of n positive integers. Fancycoder is addicted to learn their product, but this product may be extremely huge! However, it is lucky that FancyCoder only needs to find out one factor of this huge product: the smallest factor that contains more than 2 factors（including itself; i.e. 4 has 3 factors so that it is a qualified factor）. You need to find it out and print it. As we know, there may be none of such factors; in this occasion, please print 1 instead. Input The first line contains one integer T (1≤T≤15), which represents the number of testcases. For each testcase, there are two lines: 1. The first line contains one integer denoting the value of n (1≤n≤100). 2. The second line contains n integers a1,…,an (1≤a1,…,an≤2×109), which denote these n positive integers. Output Print T answers in T lines. Sample Input 2 3 1 2 3 5 6 6 6 6 6 Sample Output 6 4
按照绝对值从大到小排序后输出，这个排序的算法用 C 语言的程序的设计的思想方式怎么实现的？_course
20190527Problem Description 输入n(n<=100)个整数，按照绝对值从大到小排序后输出。题目保证对于每一个测试实例，所有的数的绝对值都不相等。 Input 输入数据有多组，每组占一行，每行的第一个数字为n,接着是n个整数，n=0表示输入数据的结束，不做处理。 Output 对于每个测试实例，输出排序后的结果，两个数之间用一个空格隔开。每个测试实例占一行。 Sample Input 3 3 4 2 4 0 1 2 3 0 Sample Output 4 3 2 3 2 1 0
R语言入门基础
20190601本课程旨在帮助学习者快速入门R语言： 课程系统详细地介绍了使用R语言进行数据处理的基本思路和方法。 课程能够帮助初学者快速入门数据处理。 课程通过大量的案例详细地介绍了如何使用R语言进行数据分析和处理 课程操作实际案例教学，通过编写代码演示R语言的基本使用方法和技巧
 681KB
14年大疆校招硬件试题
2017112514年大疆校招硬件试题，你看看能答多少？也看看大疆的技术路径。
 164.19MB
jdk8u261windowsx64.exe
20200719jdk8u261windowsx64.exe 压缩包 jdk8u261windowsx64.zip
 5.22MB
posman4.7.0Crx4Chrome.com
20170424postman4.70 后台api开发神器。get,post,put,delete等调用方式.并支持自动生成代码.postman使用教程:http://blog.csdn.net/qazwsxpcm/
 75.76MB
华为海思数字IC提前批笔试题目，2020届华为海思校园招聘，西南地区
20190827华为海思数字IC提前批笔试题目，2020届华为海思校园招聘，西南地区。单选和多选题华为海思数字IC提前批笔试题目，2020届华为海思校园招聘，西南地区。单选和多选题
Python入门视频精讲
20180904Python入门视频培训课程以通俗易懂的方式讲解Python核心技术，Python基础，Python入门。适合初学者的教程，让你少走弯路！ 课程内容包括：1.Python简介和安装 、2.第一个Python程序、PyCharm的使用 、3.Python基础、4.函数、5.高级特性、6.面向对象、7.模块、8.异常处理和IO操作、9.访问数据库MySQL。教学全程采用笔记+代码案例的形式讲解，通俗易懂！！！
 172KB
谷粒商城 2020.5月最新升级全套版基础+高级+高可用集群.zip
20200714谷粒商城2020.5月最新升级全套版基础+高级+高可用集群，已完结！有课件
 3KB
谷粒商城2020.5月最新升级全套版基础+高级+高可用集群
20200716谷粒商城2020.5月最新升级全套版基础+高级+高可用集群，已完结！
 学院 敏捷开发60分钟基础入门
 学院 2020年 Kubernetes架构师：k8s从零开始的进阶之路
 下载 Mac版chrome浏览器chrome84谷歌浏览器googlechrome.dmg
 下载 基于嵌入式器件AT89C51SNDlC的电子治疗仪设计
 学院 大厂安全运营实战/安全法/渗透测试/代码审计/等保测评
 博客 TabLayout+ViewPager制作简单导航栏
 学院 Docker应用与实战
 学院 nuxtjs+vue+SpringBoot+Shiro+mybatisPlus博客项目（利于seo）
 博客 RationalDMIS 7.1 测量过程中需要换测头角度，但是又不知道明确的角度该怎么办？
 学院 Python全栈+GUI实战
 学院 梁老师课程A套餐
 博客 HTTP与AJAX深入揭秘，不使用AJAX实现页面无刷新
 下载 亚马逊远程调用接口并方法JSON数据DEMO.rar
 下载 芳纶及其混编纤维的三维织物 GB/T 336192017
 博客 UI自动化第一讲：简单了解html标签
 下载 androidsupportv4（适合老项目）.zip
 博客 窗台上晒了一本书，三个人问了三个问题
 博客 DataWhale7月学习——Python入门
 学院 Java全栈工程师MyBatis框架
 下载 热连轧主传动十字轴式万向联轴器 GB/T 340272017
 下载 通风系统用空气净化装置 GB/T 340122017
 下载 模糊控制与神经网络的应用研究
 博客 SqlServer2008实例44类型转换
 下载 Na2EDTA滴定法 GB/T 33948.22017 铜钢复合金属化学分析方法 第2部分：锌含量的测定
 学院 minikube之带你玩转k8s集群
 学院 2020年 Kubernetes架构师：k8s从零开始的进阶之路
 学院 解读源码很难？十年技术老兵手把手带你解读
 学院 Python全栈开发之web前端（纯面授课程）
 博客 15、环境数据库初始化
 博客 博弈——Being a Good Boy in Spring Festival（尼姆博弈）