<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/baobi7088</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; baobi7088]]></copyright><item><title><![CDATA[CjgNoGlOiZ]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618604</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618604</guid><author>baobi7088</author><pubDate>Sat, 20 Jul 2019 10:55:00 +0800</pubDate><description><![CDATA[CjgNoGlOiZ

转载于:https://www.cnblogs.com/wysAC666/p/11216989.html]]></description><category></category></item><item><title><![CDATA[等比数列二分法求和]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618603</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618603</guid><author>baobi7088</author><pubDate>Sat, 25 May 2019 15:59:00 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt; 
#define ll long long
using namespace std;

ll pow_mod(ll a, ll b, ll mod) {
    ll ans = 1;
    a %= mod;
    while (b) {
        if ...]]></description><category></category></item><item><title><![CDATA[字符串子串去重之后的个数]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618601</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618601</guid><author>baobi7088</author><pubDate>Sun, 14 Apr 2019 17:14:00 +0800</pubDate><description><![CDATA[给定一个长度为N的字符串S，问所有它的子串Sl…r(1≤l≤r≤N)，去重后有多少种。
输入描述:
一行一个字符串S。
输出描述:
一行一个整数，表示答案。

示例1


输入

ababa



输出

9




备注:
1≤N≤105，字符都是小写字母

#include &lt;cstdio&gt;
#include &lt;c...]]></description><category></category></item><item><title><![CDATA[别人总结好的ACM模板]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618600</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618600</guid><author>baobi7088</author><pubDate>Mon, 08 Apr 2019 13:21:00 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/qq_32265245/article/details/53046750?tdsourcetag=s_pcqq_aiomsg

转载于:https://www.cnblogs.com/wysAC666/p/10669929.html]]></description><category></category></item><item><title><![CDATA[牛客练习赛43 B题]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618599</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618599</guid><author>baobi7088</author><pubDate>Sat, 06 Apr 2019 11:40:00 +0800</pubDate><description><![CDATA[“设箱子内有 n 个球，其中给 m 个球打上标记，设一次摸球摸到每一个球的概率均等，求一次摸球摸到打标记的球的概率”
 “emmm...语言入门题” 但是她改了一下询问方式：设最终的答案为 p ,请输出 p 小数点后 K1K1 到 K2K2 位的所有数字（若不足则用 0 补齐）
输入描述:
第一行一个整数 T,表示有 T 组数据。接下来每行包含四个整数 m,n,K1,K2m,n,K...]]></description><category></category></item><item><title><![CDATA[vector定义方式]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618596</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618596</guid><author>baobi7088</author><pubDate>Fri, 05 Apr 2019 09:09:00 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;vector&gt;
using namespace std;
int main()
{
    //第一种定义方式
    vector&lt;int&gt; vec;
    //第二种定义方法,把n个长度的数初始化为0
    vector&lt;int&gt; vec(n,0);
  ...]]></description><category></category></item><item><title><![CDATA[快速幂模板]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618595</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618595</guid><author>baobi7088</author><pubDate>Wed, 03 Apr 2019 21:07:00 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;string&gt;
#include&lt;cstdio&gt;
#define ll long long
using namespace std;
ll pow_mod(ll a,ll b,ll mod){
    ll ans = 1;
    a %= mod;
    while(b)...]]></description><category></category></item><item><title><![CDATA[L2-031 深入虎穴 （25 分)]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618594</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618594</guid><author>baobi7088</author><pubDate>Sun, 31 Mar 2019 23:47:00 +0800</pubDate><description><![CDATA[著名的王牌间谍 007 需要执行一次任务，获取敌方的机密情报。已知情报藏在一个地下迷宫里，迷宫只有一个入口，里面有很多条通路，每条路通向一扇门。每一扇门背后或者是一个房间，或者又有很多条路，同样是每条路通向一扇门…… 他的手里有一张表格，是其他间谍帮他收集到的情报，他们记下了每扇门的编号，以及这扇门背后的每一条通路所到达的门的编号。007 发现不存在两条路通向同一扇门。
内线告诉他，情...]]></description><category></category></item><item><title><![CDATA[L2-032 彩虹瓶 （25 分)]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618593</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618593</guid><author>baobi7088</author><pubDate>Sun, 31 Mar 2019 12:26:00 +0800</pubDate><description><![CDATA[彩虹瓶的制作过程（并不）是这样的：先把一大批空瓶铺放在装填场地上，然后按照一定的顺序将每种颜色的小球均匀撒到这批瓶子里。
假设彩虹瓶里要按顺序装 N 种颜色的小球（不妨将顺序就编号为 1 到 N）。现在工厂里有每种颜色的小球各一箱，工人需要一箱一箱地将小球从工厂里搬到装填场地。如果搬来的这箱小球正好是可以装填的颜色，就直接拆箱装填；如果不是，就把箱...]]></description><category></category></item><item><title><![CDATA[天梯赛赛后感悟]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618591</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618591</guid><author>baobi7088</author><pubDate>Sun, 31 Mar 2019 10:33:00 +0800</pubDate><description><![CDATA[1.首先我去年打这个比赛仅仅得了80分,所以这次参加比赛的时候挺慌的,因为数据结构实在太菜了
2.这次比赛的一阶题挺简单的,看够了80分就没看最后一题
3.这次那个迷宫最远门那个题,一看首先想到的是DFS,最后18分,赛后同学告诉我是并查集
4.2-5那一题是栈,我也想到了,最后答案对了,但是三个测试点段错误,我猜是某个小地方没考虑到
5.幸福指数那道题没看懂, 我还要好好的对这...]]></description><category></category></item><item><title><![CDATA[汉诺塔模板]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618592</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618592</guid><author>baobi7088</author><pubDate>Thu, 28 Mar 2019 22:56:00 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstdio&gt;
using  namespace std;
void hanor(int src,int mid,int desk,int count){
    if(count==1){
        printf("%c -&gt; %c\n",src,desk);
        r...]]></description><category></category></item><item><title><![CDATA[BFS迷宫最短路径模板]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618588</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618588</guid><author>baobi7088</author><pubDate>Wed, 27 Mar 2019 00:19:00 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;queue&gt;
#define INF 65535
using namespace std;
int vis[100][100]; //路径长度 
int map[100][100]; //迷宫地图 
typedef pair&lt;int,int&gt; P; //节点坐标 
P p;
i...]]></description><category></category></item><item><title><![CDATA[快排模板]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618589</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618589</guid><author>baobi7088</author><pubDate>Tue, 26 Mar 2019 22:39:00 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt; 
using namespace std;
int arr[5] = {5,4,1,3,6};     //待排序数组 
void quick_sort(int left,int right){ 
    int tmp = arr[left];  //找基准 
    if(left&gt;=right){  //如果左边...]]></description><category></category></item><item><title><![CDATA[蓝桥杯炸了]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618585</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618585</guid><author>baobi7088</author><pubDate>Sun, 24 Mar 2019 21:57:00 +0800</pubDate><description><![CDATA[这么简单的题都能炸...我心态都崩了,已经没有什么想说的了,只有难受了

--------------------------------------------------------------------------------------------------------
Ps更新:
　　我TM四道编程没写...摸了个三等奖...明年拿省一!!!!!!!!!!!!!!...]]></description><category></category></item><item><title><![CDATA[LIS,LCS,LICS模板]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618586</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618586</guid><author>baobi7088</author><pubDate>Fri, 15 Mar 2019 15:47:00 +0800</pubDate><description><![CDATA[最长递增子序列模板(1)
　　

#include&lt;iostream&gt;
#include&lt;algorithm&gt;
#include&lt;cstdio&gt;
using namespace std; 
int main()
{
    int n;
    int ans = 0;
    int dp[1005];
    int num...]]></description><category></category></item><item><title><![CDATA[算法导论初学之插入排序]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618583</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618583</guid><author>baobi7088</author><pubDate>Wed, 06 Mar 2019 01:46:00 +0800</pubDate><description><![CDATA[arr = [8,2,4,7,3,6]
length = len(arr)
for j in range(1,length):
    key = arr[j]
    i = j-1
    while i&gt;-1 and arr[i]&gt;key:
        arr[i+1] = arr[i]
        i = i-1
    arr[i+1] ...]]></description><category></category></item><item><title><![CDATA[jsp提交表单到servlet路径问题]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618584</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618584</guid><author>baobi7088</author><pubDate>Mon, 04 Mar 2019 23:52:00 +0800</pubDate><description><![CDATA[${pageContext.request.contextPath}”的作用是取出部署的应用程序名，这样不管如何部署，所用路径都是正确的

转载于:https://www.cnblogs.com/wysAC666/p/10474210.html...]]></description><category></category></item><item><title><![CDATA[jsp到servletURL编码问题]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618527</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618527</guid><author>baobi7088</author><pubDate>Mon, 11 Feb 2019 11:28:00 +0800</pubDate><description><![CDATA[在servlet中获取的jsp表单内容java.net.URLDecoder.decode(body,"UTF-8");用这个方法进行编码就能获取到中文字符了.

转载于:https://www.cnblogs.com/wysAC666/p/10361286.html...]]></description><category></category></item><item><title><![CDATA[out.print与out.println]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618523</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618523</guid><author>baobi7088</author><pubDate>Sun, 10 Feb 2019 10:57:00 +0800</pubDate><description><![CDATA[println不是换行在网页中转化为一个空格了
如果页面上需要换行的话，需要用&lt;br/&gt;。

转载于:https://www.cnblogs.com/wysAC666/p/10358895.html]]></description><category></category></item><item><title><![CDATA[jsp初学总结]]></title><link>https://blog.youkuaiyun.com/baobi7088/article/details/101618521</link><guid>https://blog.youkuaiyun.com/baobi7088/article/details/101618521</guid><author>baobi7088</author><pubDate>Sat, 09 Feb 2019 09:21:00 +0800</pubDate><description><![CDATA[JSP初学总结
什么是jsp?


jsp页面实际上也是一个htnl页面,只不过它包含了产生动态网页内容的java 代码,这些代码可以是java Bean.SQL语句等等.


在jsp页面中,动态内容与静态内容相互分离,实现界面与业务逻辑的分离,从而使jsp代码的高度复用.


jsp的优势


开发简单,跨平台,高效率和高性能,低成本


jsp执行顺...]]></description><category></category></item></channel></rss>