<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Sternley的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Sternley</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Sternley]]></copyright><item><title><![CDATA[6-3 Add Two Polynomials (20 分)]]></title><link>https://blog.youkuaiyun.com/Sternley/article/details/101079252</link><guid>https://blog.youkuaiyun.com/Sternley/article/details/101079252</guid><author>Sternley</author><pubDate>Fri, 20 Sep 2019 21:21:12 +0800</pubDate><description><![CDATA[6-3 Add Two Polynomials (20 分)
Write a function to add two polynomials. Do not destroy the input. Use a linked list implementation with a dummy head node. Note: The zero polynomial is represented by a...]]></description><category></category></item><item><title><![CDATA[[PAT甲级] 1018 Public Bike Management (DFS)]]></title><link>https://blog.youkuaiyun.com/Sternley/article/details/82349894</link><guid>https://blog.youkuaiyun.com/Sternley/article/details/82349894</guid><author>Sternley</author><pubDate>Mon, 03 Sep 2018 15:53:08 +0800</pubDate><description><![CDATA[题目大意：给你一张无向图，让你从Public Bike Management Center (PBMC)出发去往目标站点Sp，将其自行车数量维护成最大容量Cmax的一半，并将沿途的所有站点都维护一遍，即都变成Cmax/2。需要计算从PBMC带出自行车的数量，以及从Sp带回多余的自行车的数量，并给出相应的最优路线。

要求：优先选择最段路线；有多条最短路线时，选择带出自行车最少的路线；如果还是有多条...]]></description><category></category></item><item><title><![CDATA[[PAT甲级] 1017 Queueing at Bank (25)]]></title><link>https://blog.youkuaiyun.com/Sternley/article/details/81480842</link><guid>https://blog.youkuaiyun.com/Sternley/article/details/81480842</guid><author>Sternley</author><pubDate>Tue, 07 Aug 2018 14:37:32 +0800</pubDate><description><![CDATA[题目：

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. All the customers have to wait in line behind the yell...]]></description><category></category></item><item><title><![CDATA[Mysql 8.0 (mac版)登陆问题，解决ERROR 1045 (28000)]]></title><link>https://blog.youkuaiyun.com/Sternley/article/details/81278916</link><guid>https://blog.youkuaiyun.com/Sternley/article/details/81278916</guid><author>Sternley</author><pubDate>Mon, 30 Jul 2018 08:40:40 +0800</pubDate><description><![CDATA[Mysql 8.0推出以后，有了新的密码加密方案，安装好后就不需要改用户、改密码、改ini跳过密码这些操作了，曾经困扰许多人的ERROR 1045 (28000)可以很方便地解决。

在安装时，选择Strong Password Encryption，即8.0新增的密码加密，这样可以直接设置root用户的密码。 


安装完成后，打开终端，找到mysql的路径：

cd /usr/local/my...]]></description><category></category></item><item><title><![CDATA[[PAT甲级] 1009 Product of Polynomials (25)]]></title><link>https://blog.youkuaiyun.com/Sternley/article/details/81233585</link><guid>https://blog.youkuaiyun.com/Sternley/article/details/81233585</guid><author>Sternley</author><pubDate>Fri, 27 Jul 2018 10:56:43 +0800</pubDate><description><![CDATA[题目：

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 case occupies 2 lines, and each line contains the in...]]></description><category></category></item><item><title><![CDATA[[PAT甲级] 1001 A+B Format (20)]]></title><link>https://blog.youkuaiyun.com/Sternley/article/details/81233301</link><guid>https://blog.youkuaiyun.com/Sternley/article/details/81233301</guid><author>Sternley</author><pubDate>Fri, 27 Jul 2018 10:45:16 +0800</pubDate><description><![CDATA[题目：

Calculate a + b and output the sum in standard format – that is, the digits must be separated into groups of three by commas (unless there are less than four digits).

Input

Each input file cont...]]></description><category></category></item><item><title><![CDATA[[PAT甲级] 1069 The Black Hole of Numbers (20)]]></title><link>https://blog.youkuaiyun.com/Sternley/article/details/81232117</link><guid>https://blog.youkuaiyun.com/Sternley/article/details/81232117</guid><author>Sternley</author><pubDate>Fri, 27 Jul 2018 10:08:48 +0800</pubDate><description><![CDATA[For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decreasing order, a new number can be obtained by takin...]]></description><category></category></item></channel></rss>