 A Day at the Races

Problem Description
Formula One is the highest class of car racing sports. A typical Formula One season consists of a series of races called ``Grands Prix" which constructors like Ferrari, Renault, etc. and others participate with one or more cars driven by the best drivers in the world. During the season, teams compete in two parallel championships: the drivers championship and the teams championship.In the drivers championship, drivers compete to achieve the maximum total number of points by the end of the season, the rules of the competition states that the top eight drivers at each Grand Prix receive 10,8,6,5,4,3,2,1 points respectively. In case of points tie, the driver with the highest number of first places leads. If still tied, then the highest second places, and so on till the highest 8th places. If still tied, then drivers are sorted lexicographically by their last and then by their first names.
After each race, the points received by each driver are added to his team's pocket, and at the end of the season the team with the highest number of points wins the teams championship. To add excitement to the season, team sponsors are allowed to buy drivers from other teams even within the same season. In case of points tie between teams, teams are sorted lexicographically by their names. In this problem, you are given data of a formula one season and you're asked to process these data according to the rules above to determine both the drivers and teams standings.
Input
Your program will be tested on one or more datasets, each representing a Formula One season. All input lines are 255 characters or less. Studying the sample I/O you'll discover that the first line of each season has an integer N , where 0 < N < 32 and representing the number of Grands Prix in that season. For each Grand Prix, the name of the Grand Prix appears on a line by itself (maximum length is 64 characters) followed by a table of the first name, last name and team name of the top eight drivers, from 1 to 8, in that Grand Prix. Each of the first and last names is a sequence of printable ASCII characters, no longer than 12 characters, and contains no spaces. Each team name is a sequence of printable ASCII characters, no longer than 18 characters, and may contain spaces (but no leading or trailing spaces.) Each team name is followed by a single period `.' which is not part of the name. Trailing white space may follow. A line of three 's follows the listing of each Grand Prix. The last line of the input file contains a single zero.Output
For each data set in the input you must printSeason k :" where k is the dataset number (starting from 1.) The next line must state
Drivers Standing:". On subsequent lines list the drivers standing for that season. For each driver, print their first and last names separated by exactly one space and left justified in a field of width 25, followed by a single space, followed by the total number of points achieved by the driver during the season. The drivers standing should be followed by a blank line.The next line must state ``Teams Standing:" On subsequent lines list the teams standing for the that season. For each team, print the team name left justified in a field of width 25, followed by a single space, followed by the total number of points the team has scored during the season. The teams standing should be followed by a blank line.
Sample Input
2
FORMULA 1 Gran Premio Telefonica de Espana 2006
Pos Driver Team
1 Fernando Alonso Renault.
2 Michael Schumacher Ferrari.
3 Giancarlo Fisichella Renault.
4 Felipe Massa Ferrari.
5 Kimi Raikkonen McLarenMercedes.
6 Jenson Button Honda.
7 Rubens Barrichello Honda.8 Nick Heidfeld SauberBMW.
FORMULA 1 Grand Prix de Monaco 2006
Pos Driver Team
1 Fernando Alonso Renault.
2 JaunPablo Montoya McLarenMercedes.
3 David Coulthard RBRFerrari.
4 Rubens Barrichello Honda.
5 Michael Schumacher Ferrari.
6 Giancarlo Fisichella Renault.
7 Nick Heidfeld SauberBMW.8 Ralf Schumacher Toyota.
0
Sample Output
Season 1:
Drivers Standing:
Fernando Alonso 20
Michael Schumacher 12
Giancarlo Fisichella 9
JaunPablo Montoya 8
Rubens Barrichello 7
David Coulthard 6
Felipe Massa 5
Kimi Raikkonen 4
Jenson Button 3
Nick Heidfeld 3
Ralf Schumacher 1Teams Standing:
Renault 29
Ferrari 17
McLarenMercedes 12
Honda 10
RBRFerrari 6
SauberBMW 3
Toyota 1
 ASCII码对应表chr(9)、chr(10)、chr(13)、chr(32)、chr(34)、chr(39) 367820170104 chr(9) tab空&#26684;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; chr(10) 换行&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; chr(13) 回车&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Chr(13)&amp;chr(10) 回车换行&nbsp;&nbsp;&nbsp;&nbs
Return of the Jedi _course
20170125Description Luke Skywalker races through the forest on a speeder bike, trying to outrun a patrol of Imperial scouts on Endor. A small moon near a new Death Star, Endor is covered by dense foliage and a thick forest of ancient towering trees. The speeder bike , which Luke stole from an Imperial scout, is an antigravity vehicle capable of speeds of 200 miles an hour. How quickly can Luke reach Princess Leia in the Ewok village? The forest is a plane with T trees. Luke's position is specified by a pair of coordinates ( xluke , yluke ) within the plane. The Ewok village has coordinates ( xewok , yewok ). You are to find the shortest travel time from Luke's position to the Ewok village. Input The first line of input contains T, xluke , yluke xewok , yewok . T lines follow; each gives the coordinates and diameter of a tree: xtreei , ytreei , dtreei . T is an integer not exceeding 10; coordinates and diameters are real numbers in miles. Trees do not intersect or touch one another. Output Output is a single real number, to two decimal places, giving the minimum travel time in seconds. Sample Input 2 0.0 0.0 10.0 0.0 4.0 0.0 1.0 6.0 0.0 1.0 Sample Output 181.13
Ball bearings _course
20161227Description The Swedish company SKF makes ball bearings. As explained by Britannica Online, a ball bearing is "one of the two types of rolling, or anti friction, bearings (the other is the roller bearing). ![](http://poj.org/images/2959_1.jpg) Its function is to connect two machine members that move relative to one another so that the frictional resistance to motion is minimal. In many applications, one of the members is a rotating shaft and the other a fixed housing. Each ball bearing has three main parts: two grooved, ring like races and a number of balls. The balls fill the space between the two races and roll with negligible friction in the grooves. The balls may be loosely restrained and separated by means of a retainer or cage." Presumably, the more balls you have inside the outer ring, the smoother the ride will be, but how many can you fit within the outer ring? You will be given the inner diameter of the outer ring, the diameter of the balls, and the minimum distance between neighboring balls. Your task is to compute the maximum number of balls that will fit on the inside of the outer ring (all balls must touch the outer ring). Input The first line of input contains a positive integer n that indicates the number of test cases. Then follow n lines, each describing a test case. Each test case consists of three positive floating point numbers, D, d, s, where D is the inner diameter of the outer ring, d is the diameter of a ball, and s is the minimum distance between balls. All parameters are in the range [0.0001, 500.0]. Output For each test case output a single integer m on a line by itself, where m is the maximum number of balls that can fit in the ball bearing, given the above constraints. There will always be room for at least three balls. Sample Input 2 20 1 0.1 100.0 13.0 0.2 Sample Output 54 20
Bug Races _course
20170821Two species of bugs, Red iNT and Green fLOAT, are living in Blue Matrix. They have a race at Code Cube every four years. Code Cube is a cuboid with integer dimensions. Bugs will run from the corner of Code Cube to the opposite corner in the race, choosing the shortest route. However, Red iNT can only run on the surfaces of the cuboid, and the shortest distance it runs is always an integer. Green fLOAT can run inside the cuboid, and the shortest distance it runs may be any real number. The race seems to be unfair, but iNT runs much more faster than fLOAT, so both have chance to win. ![](http://acm.zju.edu.cn/onlinejudge/showImage.do?name=bugracescuboid.jpg) The scale of a Code Cube is defined as the maximum dimension of it. There are two different minimum cuboids satisfying the requirements above, 2×2×3 and 1×3×3, where the distances of Red iNT's routes are both 5 and the distances of Green fLOAT's routes are sqrt(17) and sqrt(19). Of course, the distances vary from one cuboid to another cuboid. Now the problem comes that bugs want to know the mean squared distances for all cuboids with the same scale. Input The input contains thousands of lines of integers n, which indicates the scale of Code Cube. n will be between 1 and 1000000, inclusive. Output Output the mean squared distance Red iNT runs and the one Green fLOAT runs as irreducible fraction, or "NaN" if both the numerator and the denominator are zero. See sample for more details. Sample Input 1 2 3 4 1000 Sample Output NaN NaN NaN NaN 25/1 18/1 25/1 21/1 220986875/114 538411225/342
Against Mammoths _course
20170904Problem Description Back to year 3024, humans finally developed a new technology that enables them to conquer the alien races. The new technology made it possible to produce huge spaceships known as Saber Tooth spaceships as powerful as the aliens' defending mammoths. At that time, humans ruled several planets while some others were under control of the aliens. Using Saber Tooth ships, humans finally defeated aliens and this became the first Planet War in history. Our goal is to run a simulation of the ancient war to verify some historical hypotheses. Producing each spaceship takes an amount of time which is constant for each planet but may vary among different planets. We call the number of spaceships each planet can produce in a year, the production rate of that planet. Note that each planet has a number of spaceships in it initially (before the simulation starts). The planets start producing ships when the simulation starts, so if a planet has nships initially, and has the production rate p, it will have n + p ships at the beginning of year 1, and n + i × p ships at the beginning of year i (years are started from zero). Bradley Bennett, the commander in chief of the human armies, decided a strategy for the war. For each alien planet A, he chooses a corresponding human planet P, and produces spaceships in P until a certain moment at which he sends all spaceships in P to invade the planet A. No alien planet is invaded by two human planets and no human planet sends its spaceships to two different alien planets. The defense power of the alien planets comes from their powerful mammoths. Each alien planet contains a number of mammoths initially and produces a number of mammoths each year (called the production rate of the planet). When a fight between spaceships and mammoths takes place, the side having the greater number of troops is the winner. If the spaceships win, the alien planet is defeated. In case the number of mammoths and spaceships are equal, the spaceships win. The difficulty with planning this strategy is that it takes some time for the spaceships to reach the alien planets, and during this time, the aliens produce mammoths. The time required for spaceships to travel from each human planet to each alien planet is known. The ships can leave their planets only at the beginning of years (right after the ships are produced) and reach the alien planets at the beginning of years too (right after the mammoths are produced). As an example, consider a human planet with two initial spaceships and production rate three invading an alien planet with two initial mammoths and production rate two. The time required to travel between the two planets is two years and the ships are ordered to leave at year one. In this case, five ships leave the human planet. When they reach the alien planet, they confront eight mammoths and will be defeated during the fight. Bennett decided to prepare a plan that destroys every alien planet in the shortest possible time. Your task is to write a program to generate such a plan. The output is the shortest possible time (in years) in which every alien planet is defeated. Input There are multiple test cases in the input. The first line of each test case contains two numbers H and A which are the number of planets under the control of humans and aliens respectively (both between 1 and 250). The second line of the test case contains H nonnegative integers n1 m1 n2 m2 … nH mH. The number ni is the initial number of Saber Tooth spaceships in the ith human planet and mi is the production rate of that planet. The third line contains A nonnegative integers which specify the initial number of mammoths and the production rate of the alien planets in the same format as the second line. After the third line, there are H lines each containing A positive integers. The jth number on the ith line shows how many years it takes a spaceship to travel from the ith human planet to the jth alien planet. The last line of the input contains two zero numbers. Every number in the input except H and A is between 0 and 40000. Output The output for each test case contains a single integer which is the minimum time in which all alien planets can be defeated. If it is impossible to destroy all alien planets, the output should be IMPOSSIBLE. Sample Input 2 1 2 3 0 3 2 2 2 2 0 0 Sample Output 6
[python报错问题]哪位老司机能带带我~~~~~_course
20161030[最近在做GitHut上的Harvardcs109，遇到一个地方疯狂报错，求老司机指指路（右边是链接）](https://github.com/cs109/content/blob/caffc21c8f7c758c1884852ed023d29dccea063f/HW1_solutions.ipynb "") 以下是报错的地方： ``` errors = all_error_data()  AttributeError Traceback (most recent call last) <ipythoninput18aea6d425eefd> in <module>() > 1 errors = all_error_data() <ipythoninput172a9c686164e8> in all_error_data() 17 #your code here 18 def all_error_data(): > 19 data = [error_data(race_page) for race_page in find_governor_races(page)] 20 return pd.concat(data, ignore_index=True) <ipythoninput145c576ec1e316> in error_data(url) 48 #compute forecast length in days 49 #(assuming that last forecast happens on the day of the election, for simplicity) > 50 forecast_length = (df.date.max()  df.date).values 51 forecast_length = forecast_length / np.timedelta64(1, 'D') # convert to number of days 52 //anaconda/lib/python2.7/sitepackages/pandas/core/generic.pyc in __getattr__(self, name) 2667 if name in self._info_axis: 2668 return self[name] > 2669 return object.__getattribute__(self, name) 2670 2671 def __setattr__(self, name, value): AttributeError: 'DataFrame' object has no attribute 'date' ```
He is Flying _course
20170816Problem Description JRY wants to drag racing along a long road. There are n sections on the road, the ith section has a nonnegative integer length si. JRY will choose some continuous sections to race (at an unbelievable speed), so there are totally n(n+1)2 different ways for him to ride. If JRY rides across from the ith section to the jth section, he would gain j−i+1 pleasure. Now JRY wants to know, if he tries all the ways whose length is s, what's the total pleasure he can get. Please be aware that in the problem, the length of one section could be zero, which means that the length is so trivial that we can regard it as 0. Input The first line of the input is a single integer T (T=5), indicating the number of testcases. For each testcase, the first line contains one integer n. The second line contains n nonnegative integers, which mean the length of every section. If we denote the total length of all the sections as s, we can guarantee that 0≤s≤50000 and 1≤n≤100000. Output For each testcase, print s+1 lines. The single number in the ith line indicates the total pleasure JRY can get if he races all the ways of length i−1. Sample Input 2 3 1 2 3 4 0 1 2 3 Sample Output 0 1 1 3 0 2 3 1 3 1 6 0 2 7
Harmony Forever _course
20170620Problem Description We believe that every inhabitant of this universe eventually will find a way to live together in harmony and peace; that trust, patience, kindness and loyalty will exist between every living being of this earth; people will find a way to appreciate and cooperate with each other instead of continuous bickering, arguing and fighting. Harmony  the stage of society so many people dream of and yet it seems so far away from now ... Fortunately, the method of unlocking the key to true Harmony is just discovered by a group of philosophers. It is recorded on a strange meteorite which has just hit the earth. You need to decipher the true meaning behind those seemingly random symbols ... More precisely, you are to write a program which will support the following two kinds of operation on an initially empty set S : 1. B X : Add number X to set S . The Kth command in the form of B X always happens at time K , and number X does not belong to set S before this operation. 2. A Y : Of all the numbers in set S currently, find the one which has the minimum remainder when divided by Y . In case a tie occurs, you should choose the one which appeared latest in the input. Report the time when this element is inserted. It is said that if the answer can be given in the minimum possible time, true Harmony can be achieved by human races. You task is to write a program to help us. Input There are multiple test cases in the input file. Each test case starts with one integer T where 1<=T<=40000 . The following T lines each describe an operation, either in the form of ``B X " or ``A Y " where 1<=X , Y<=500000 . T = 0 indicates the end of input file and should not be processed by your program. Output Print the result of each test case in the format as indicated in the sample output. For every line in the form of ``A Y ", you should output one number, the requested number, on a new line; output 1 if no such number can be found. Separate the results of two successive inputs with one single blank line. Sample Input 5 B 1 A 5 B 10 A 5 A 40 2 B 1 A 2 0 Sample Output Case 1: 1 2 1 Case 2: 1
ASP.NET MVC5如何搜索数字区间？_course
20190322会做普通的搜索，想根据数字做一个范围搜索。比如搜索价格区间200元到400元。以下是常用的搜索代码 ``` var races = from r in db.Races select r; if (!String.IsNullOrEmpty(sGender)) { races = races.Where(s => s.Gender.Contains(sGender)); } return View(races); ```
PHP数组合并问题_course
20170322<div class="posttext" itemprop="text"> <p>I have a table of races that have the <em>race name</em>, <em>race id</em>, and <em>race date</em>.</p> <p>I am trying to build a <strong>single array</strong> (it has to be a single array returned via a function call) which would contain a list of the races in the following format:</p> <pre><code>,,2017 The Resolution AR, 58, 1.14.2017 Heartbreaker AR, 59, 2.11.2017 ,,2016 The Blue Ridge AR, 38, 5.21.2016 The Fathers Day AR, 43, 6.18.2016 Adventure Bike (Santos), 54, 7.30.2016 ,,2015 Gemini Springs AR, 4, 12.14.2015 </code></pre> <p>I am almost there! But I am having one issue.</p> <p>This is the current code I have:</p> <pre><code>function get_races() { // get all the years that have races $years = $wpdb&gt;get_results(" select DATE_FORMAT(r.race_date,'%Y') year from race_calendar r group by DATE_FORMAT(r.race_date,'%Y') order by DATE_FORMAT(r.race_date,'%Y') desc; "); // loop through all years that have races foreach ( $years as $year ) { // add year header to array $year_header = array(array ('','',''.$year&gt;year.'')); // get races for this particular year $races = $wpdb&gt;get_results(" select r.race_name ,r.race_id ,date_format(r.race_date,'%c.%d.%Y') race_date from race_calendar r where DATE_FORMAT(r.race_date,'%Y') = ".$year&gt;year." order by r.race_date; ", ARRAY_N); // merge the year header and the races into an array $merged_arr = array_merge($year_header, $races); } return $merged_arr; } // call function to get list of races $races = get_races(); // display the list of races (with the year separator) foreach ( $races as $race ) { echo $race['0'] . ',' . $race['1'] . ',' . $race['2'] . '&lt;br /&gt;'; } </code></pre> <p>It works. But problem is, that code above only displays the last iteration of the <strong>years</strong> loop, in this case, <strong>2015</strong>:</p> <pre><code>,,2015 Gemini Springs AR, 4, 12.14.2015 </code></pre> <p>Obviously <strong>$merged_arr</strong> is begin reset with each iteration of the years loop</p> <p>How can I update it so that the resulting array in the function contains the data for all the iterations of the <strong>years</strong> loop?</p> </div>
PHP / HTML如何创建打开另一个下拉列表的下拉列表？_course
20110125<div class="posttext" itemprop="text"> <p>All, I am writting a php script that runs as part of a joomla site. I have a table<br> Event<br> day;<br> time;<br> races; (is an array of race id's)<br> ....</p> <p>here is the Race table<br> Race<br> id;<br> name;<br> ... </p> <p>On the site I want to have a drop down list of table Event. When they click on an Event in that list, I want to open a second drop down list on that page of possible races (using the values of the Event.races for my query). Any idea on how to get the first drop down selected so I can create the second on the page?</p> </div>
广度优先算法遍历一个数据结构里面的图相关的算法运用C语言的实现_course
20190226Problem Description Back to year 3024, humans finally developed a new technology that enables them to conquer the alien races. The new technology made it possible to produce huge spaceships known as Saber Tooth spaceships as powerful as the aliens' defending mammoths. At that time, humans ruled several planets while some others were under control of the aliens. Using Saber Tooth ships, humans finally defeated aliens and this became the first Planet War in history. Our goal is to run a simulation of the ancient war to verify some historical hypotheses. Producing each spaceship takes an amount of time which is constant for each planet but may vary among different planets. We call the number of spaceships each planet can produce in a year, the production rate of that planet. Note that each planet has a number of spaceships in it initially (before the simulation starts). The planets start producing ships when the simulation starts, so if a planet has nships initially, and has the production rate p, it will have n + p ships at the beginning of year 1, and n + i × p ships at the beginning of year i (years are started from zero). Bradley Bennett, the commander in chief of the human armies, decided a strategy for the war. For each alien planet A, he chooses a corresponding human planet P, and produces spaceships in P until a certain moment at which he sends all spaceships in P to invade the planet A. No alien planet is invaded by two human planets and no human planet sends its spaceships to two different alien planets. The defense power of the alien planets comes from their powerful mammoths. Each alien planet contains a number of mammoths initially and produces a number of mammoths each year (called the production rate of the planet). When a fight between spaceships and mammoths takes place, the side having the greater number of troops is the winner. If the spaceships win, the alien planet is defeated. In case the number of mammoths and spaceships are equal, the spaceships win. The difficulty with planning this strategy is that it takes some time for the spaceships to reach the alien planets, and during this time, the aliens produce mammoths. The time required for spaceships to travel from each human planet to each alien planet is known. The ships can leave their planets only at the beginning of years (right after the ships are produced) and reach the alien planets at the beginning of years too (right after the mammoths are produced). As an example, consider a human planet with two initial spaceships and production rate three invading an alien planet with two initial mammoths and production rate two. The time required to travel between the two planets is two years and the ships are ordered to leave at year one. In this case, five ships leave the human planet. When they reach the alien planet, they confront eight mammoths and will be defeated during the fight. Bennett decided to prepare a plan that destroys every alien planet in the shortest possible time. Your task is to write a program to generate such a plan. The output is the shortest possible time (in years) in which every alien planet is defeated. Input There are multiple test cases in the input. The first line of each test case contains two numbers H and A which are the number of planets under the control of humans and aliens respectively (both between 1 and 250). The second line of the test case contains H nonnegative integers n1 m1 n2 m2 … nH mH. The number ni is the initial number of Saber Tooth spaceships in the ith human planet and mi is the production rate of that planet. The third line contains A nonnegative integers which specify the initial number of mammoths and the production rate of the alien planets in the same format as the second line. After the third line, there are H lines each containing A positive integers. The jth number on the ith line shows how many years it takes a spaceship to travel from the ith human planet to the jth alien planet. The last line of the input contains two zero numbers. Every number in the input except H and A is between 0 and 40000. Output The output for each test case contains a single integer which is the minimum time in which all alien planets can be defeated. If it is impossible to destroy all alien planets, the output should be IMPOSSIBLE. Sample Input 2 1 2 3 0 3 2 2 2 2 0 0 Sample Output 6
手把手带你学会Python
20200303当下最火的计算机语言，难道你还只停留知道的阶段吗？快跟着老司机一起起飞吧~ 零基础开始学，只要跟着视频一步一步来，多思考，多练习，我相信你会有质的飞越。 学习路上会很苦，也会很累。但是这些等你学会以后，会发现这些都是值得。 还在等什么？快来学习吧~
 1.31MB
Python3.2.3官方文档（中文版）高清完整PDF
20140519Python3.2.3官方文档（中文版） 由笔者自己翻译，有不当之处希望在博客上相互交流
 24.39MB
c++学习资料汇总
20130801包括： 高质量C++_C编程指南.pdf C+++Primer中文非扫描版.pdf C++程序员必备常识.pdf Effective C++.chm More+Exceptional+C++.chm
跟汤老师学Java：初识Java
20190129【课程背景】 JAVA是市场份额最大的编程语言，每天各大招聘网站上都会有数万个JAVA开发工程师的在招岗位，学习JAVA成为很多人人生逆袭的绝佳工具，但是JAVA的技术体系庞大复杂，要想扎实掌握JAVA不是一件容易的事，随着在线教育的兴起线上学习也成为很多人的选择之一。通过本门课程的学习，可以让系统学习到JAVA相关知识点，轻松进入JAVA领域。 【课程收获】 本课程从零开始，以通俗易懂的方式讲解Java入门，手把手教你掌握每一个知识点。&nbsp; 课程中使用的所有英文单词都会逐一查询并记录，真正做到零基础入门学习，最适合初学者的教程！&nbsp; 【课程大纲】 为了让大家快速系统了解JAVA入门知识全貌，我为你总结了「JAVA入门知识框架图」,帮你梳理学习重点，建议收藏！
 12.91MB
2020双十一淘宝自动领喵币
202010212020最新双十一自动领喵币 1、打开Auto.js（该软件的相关用法就不细说了，无障碍，悬浮窗权限这些），右下角导入脚本 2、打开淘宝，进入活动页面，点开任务列表界面 3、点击Auto.js悬浮窗，
 1.67MB
c语言项目开发实例
20111101十个c语言案例 （1）贪吃蛇 （2）五子棋游戏 （3）电话薄管理系统 （4）计算器 （5）万年历 （6）电子表 （7）客户端和服务器通信 （8）潜艇大战游戏 （9）鼠标器程序 （10）手机通讯录系统
《C语言/C++学习指南》语法篇（从入门到精通）
20150603一门初级、从入门到精通的C语言C++语法教程，由毕业于清华大学的业内人士执课。从简单的HelloWorld入门程序，到深入的C语言C++核心概念，均为您娓娓道来，言之必详、听之必懂。让C语言C++编程变得简单，让C语言C++编程变得有趣，让喜欢C语言C++的人学会C语言C++！
 学院 轻松学习Python 69个内置函数(持续更新中)
 学院 视觉应用工程师第32期
 博客 将文件中的数据通过python传到mysql中
 博客 ＜css引入css的4种方式＞
 学院 Java微信小程序服装商城 大学生毕业设计教学视频
 下载 上海建筑轮廓shp数据.rar
 博客 Postgresql like错误的坑(ERROR: could not determine data type of parameter $7)
 学院 人工智能特训营第32期
 博客 vue倒计时
 下载 汕头建筑shp数据.rar
 学院 FFmpeg4.3黄金系列课程：c++版
 博客 算法
 学院 在金融行业中如何使用Python加速建模运算
 博客 Eclipse配置tomcat服务器
 下载 读取json文件生成菜单，arcgis js api一些常用功能及web开发常用插件
 博客 C++读取txt文件
 下载 javascript中关于执行环境的杂谈
 下载 让aspx页面自主控制调用记录的数量,类型,随时更改,不用重新编译的实现方法
 学院 CMake工程管理入门精讲
 博客 电容封装类型
 博客 2.一台电脑起两个tomcat项目
 学院 SpringBoot2实战教程
 博客 LeetCode845.数组中的最长山脉（Java+循环）
 学院 Java微信小程序鲜花礼品购物商城 大学生毕业设计教学视频
 下载 lavarel 6.0
 博客 csr 矩阵 转为 tensor
 博客 互联网背后的秘密，商城网站建设的原因
 学院 Spring Boot集成EasyPoi
 学院 多元线性回归模型的参数与统计量深度解读基于Python编程复现
 博客 找到 K 个最接近的元素