<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dbt3498的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dbt3498</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dbt3498]]></copyright><item><title><![CDATA[HBuilderX使用Vant组件库]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101236775</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101236775</guid><author>dbt3498</author><pubDate>Sun, 11 Aug 2019 22:03:00 +0800</pubDate><description><![CDATA[HBuilderX使用Vant组件库
   HBuilderX是一款由国人开发的开发工具，其官网称其为轻如编辑器、强如IDE的合体版本。但是官方的社区中关于Vant组件的安装大多都是针对微信小程序开发安装Vant Weapp，鄙人尝试了各种方法，经历各种错误后终于成功安装vant组件库，在这里分享一下使用HBuilderX进行vue.js开发时安装Vant组件库的经验，使用的版...]]></description><category></category></item><item><title><![CDATA[Java断点续传（基于socket与RandomAccessFile的简单实现）]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101236768</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101236768</guid><author>dbt3498</author><pubDate>Thu, 09 May 2019 16:58:00 +0800</pubDate><description><![CDATA[Java断点续传（基于socket与RandomAccessFile的简单实现）
　　这是一个简单的C/S架构，基本实现思路是将服务器注册至某个空闲端口用来监视并处理每个客户端的传输请求。
　　客户端先获得用户给予的需传输文件与目标路径，之后根据该文件实例化RandomAccessFile为只读，之后客户端向服务器发送需传输的文件名文件大小与目标路径，服务器没接收到一个客户端的请求就...]]></description><category></category></item><item><title><![CDATA[PTA (Advanced Level) 1009 Product of Polynomials]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101236771</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101236771</guid><author>dbt3498</author><pubDate>Wed, 17 Apr 2019 21:00:00 +0800</pubDate><description><![CDATA[1009 Product of Polynomials
　　This time, you are supposed to findA×BwhereAandBare two polynomials.
Input Specification:
　　Each input file contains one test case. Each case occupies 2 lin...]]></description><category></category></item><item><title><![CDATA[Qt5——从零开始的学生管理系统]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101236769</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101236769</guid><author>dbt3498</author><pubDate>Wed, 17 Apr 2019 14:44:00 +0800</pubDate><description><![CDATA[Qt教程——从零开始的学生管理系统（文件）
一、项目设计
　　1、需求分析
　　记录并处理学生成绩信息。
　　1）添加新的学生数据；
　　2）根据学号对已有的学生数据进行修改；
　　3）根据学号删除已存在的学生信息；
　　4）根据学号查询学生信息；
　　5）根据各门成绩与平均成绩进行排序。
　　2、窗口设计
　　1）菜单窗口；
　　2）添加学生窗口；
　　3）修改...]]></description><category></category></item><item><title><![CDATA[2015年第六届蓝桥杯C/C++程序设计本科B组决赛 完美正方形]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101236762</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101236762</guid><author>dbt3498</author><pubDate>Thu, 11 Apr 2019 21:54:00 +0800</pubDate><description><![CDATA[完美正方形
　　如果一些边长互不相同的正方形，可以恰好拼出一个更大的正方形，则称其为完美正方形。历史上，人们花了很久才找到了若干完美正方形。比如：如下边长的22个正方形
2 3 4 6 7 8 12 13 14 15 16 17 18 21 22 23 24 26 27 28 50 60
如【图1.png】那样组合，就是一种解法。
　　此时，紧贴上边沿的是：60 50，紧贴下边沿...]]></description><category></category></item><item><title><![CDATA[PTA (Advanced Level) 1008 Elevator]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101236758</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101236758</guid><author>dbt3498</author><pubDate>Mon, 08 Apr 2019 17:59:00 +0800</pubDate><description><![CDATA[Elevator
　　The highest building in our city has only one elevator. A request list is made up withNpositive numbers. The numbers denote at which floors the elevator will stop, in specified order...]]></description><category></category></item><item><title><![CDATA[PTA (Advanced Level) 1007 Maximum Subsequence Sum]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101236767</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101236767</guid><author>dbt3498</author><pubDate>Mon, 08 Apr 2019 17:25:00 +0800</pubDate><description><![CDATA[Maximum Subsequence Sum
　　Given a sequence ofKintegers {N​1​​,N​2​​, ...,N​K​​}. A continuous subsequence is defined to be {N​i​​,N​i+1​​, ...,N​j​​} where1. The Maximum Subsequence i...]]></description><category></category></item><item><title><![CDATA[PTA (Advanced Level) 1006 Sign In and Sign Out]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101236757</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101236757</guid><author>dbt3498</author><pubDate>Wed, 03 Apr 2019 20:17:00 +0800</pubDate><description><![CDATA[Sign In and Sign Out
　　At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records o...]]></description><category></category></item><item><title><![CDATA[PTA (Advanced Level) 1005 Spell It Right]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101236755</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101236755</guid><author>dbt3498</author><pubDate>Tue, 02 Apr 2019 21:48:00 +0800</pubDate><description><![CDATA[Spell It Right
　　Given a non-negative integerN, your task is to compute the sum of all the digits ofN, and output every digit of the sum in English.
Input Specification:
　　Each input file co...]]></description><category></category></item><item><title><![CDATA[PTA (Advanced Level) 1004 Counting Leaves]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101236761</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101236761</guid><author>dbt3498</author><pubDate>Tue, 02 Apr 2019 21:04:00 +0800</pubDate><description><![CDATA[Counting Leaves
　　A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.
Input Specification:
　　Each input file contains one t...]]></description><category></category></item><item><title><![CDATA[Qt5——从零开始的Hello World教程(Qt Creator)]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101237181</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101237181</guid><author>dbt3498</author><pubDate>Tue, 02 Apr 2019 17:10:00 +0800</pubDate><description><![CDATA[简单Qt教程
一、打开Qt Creator
　　本次的目的是用Qt Creator建立一个Hello World项目，在安装Qt之后，首先要打开QtCreator。

　　就是它啦，打开后会显示如下页面。

二、建立新项目
　　点击文件——新建文件或项目 或者使用快捷键Ctrl+N便可以打开新建项目菜单。

　　这里选择其他项目——Empty qmake Projec...]]></description><category></category></item><item><title><![CDATA[PTA (Advanced Level) 1003 Emergency]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101237180</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101237180</guid><author>dbt3498</author><pubDate>Fri, 29 Mar 2019 21:14:00 +0800</pubDate><description><![CDATA[Emergency
　　As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in e...]]></description><category></category></item><item><title><![CDATA[PTA (Advanced Level) 1002 A+B for Polynomials]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101237179</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101237179</guid><author>dbt3498</author><pubDate>Fri, 29 Mar 2019 19:12:00 +0800</pubDate><description><![CDATA[1002A+B for Polynomials
　　This time, you are supposed to findA+BwhereAandBare two polynomials.
Input Specification:
　　Each input file contains one test case. Each case occupies 2 lines,...]]></description><category></category></item><item><title><![CDATA[PTA (Advanced Level) 1001  A+B Format]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101237178</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101237178</guid><author>dbt3498</author><pubDate>Thu, 28 Mar 2019 19:24:00 +0800</pubDate><description><![CDATA[1001A+B Format
　　Calculatea+band 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 Spe...]]></description><category></category></item><item><title><![CDATA[HDU 1272 小希的迷宫]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101237177</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101237177</guid><author>dbt3498</author><pubDate>Mon, 25 Feb 2019 14:03:00 +0800</pubDate><description><![CDATA[小希的迷宫
上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走了回头路）。小希现在把她的设计...]]></description><category></category></item><item><title><![CDATA[FZU 2150 Fire Game]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101237175</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101237175</guid><author>dbt3498</author><pubDate>Sun, 24 Feb 2019 17:20:00 +0800</pubDate><description><![CDATA[Fire Game

　　Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty...]]></description><category></category></item><item><title><![CDATA[HihoCoder - 1478 水陆距离]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101237173</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101237173</guid><author>dbt3498</author><pubDate>Mon, 28 Jan 2019 20:00:00 +0800</pubDate><description><![CDATA[水陆距离

描述
　　给定一个N x M的01矩阵，其中1表示陆地，0表示水域。对于每一个位置，求出它距离最近的水域的距离是多少。 
　　矩阵中每个位置与它上下左右相邻的格子距离为1。
输入
　　第一行包含两个整数，N和M。
　　以下N行每行M个0或者1，代表地图。
　　数据保证至少有1块水域。
　　对于30%的数据，1 &lt;= N, M &lt;= 100 ...]]></description><category></category></item><item><title><![CDATA[HihoCoder - 1040  矩形判断]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101237172</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101237172</guid><author>dbt3498</author><pubDate>Mon, 28 Jan 2019 19:13:00 +0800</pubDate><description><![CDATA[矩形判断
　　给出平面上4条线段，判断这4条线段是否恰好围成一个面积大于0的矩形。
Input
　　输入第一行是一个整数T(1&lt;=T&lt;=100)，代表测试数据的数量。
　　每组数据包含4行，每行包含4个整数x1, y1, x2, y2 (0 &lt;= x1, y1, x2, y2 &lt;= 100000)；其中(x1, y1), (x2,y2)代表一条线段的两...]]></description><category></category></item><item><title><![CDATA[PTA (Advanced Level) 1028 List Sorting]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101237170</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101237170</guid><author>dbt3498</author><pubDate>Sat, 26 Jan 2019 15:44:00 +0800</pubDate><description><![CDATA[List Sorting
　　Excel can sort records according to any column. Now you are supposed to imitate this function.
Input Specification:
　　Each input file contains one test case. For each case, the ...]]></description><category></category></item><item><title><![CDATA[PTA (Advanced Level) 1027 Colors in Mars]]></title><link>https://blog.youkuaiyun.com/dbt3498/article/details/101237106</link><guid>https://blog.youkuaiyun.com/dbt3498/article/details/101237106</guid><author>dbt3498</author><pubDate>Sat, 26 Jan 2019 15:26:00 +0800</pubDate><description><![CDATA[Colors in Mars
　　People in Mars represent the colors in their computers in a similar way as the Earth people. That is, a color is represented by a 6-digit number, where the first 2 digits are fo...]]></description><category></category></item></channel></rss>