<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[布呗之路]]></title><description><![CDATA[每个人都有不同的路，所以每个人都会孤独。]]></description><link>https://blog.youkuaiyun.com/hypHuangYanPing</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hypHuangYanPing]]></copyright><item><title><![CDATA[以后不在这里更新，转B站啦！！！]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/108367152</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/108367152</guid><author>hypHuangYanPing</author><pubDate>Wed, 02 Sep 2020 17:54:02 +0800</pubDate><description><![CDATA[b站链接：smallguoguo
]]></description><category></category></item><item><title><![CDATA[Codeforces Global Round 7 D2. Prefix-Suffix Palindrome]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/105011353</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/105011353</guid><author>hypHuangYanPing</author><pubDate>Sat, 21 Mar 2020 16:18:56 +0800</pubDate><description><![CDATA[D2. Prefix-Suffix Palindrome (Hard version)

题意

给定一个字符串SSS，找出最长的符合下列条件的字符串TTT

TTT的长度不超过SSS
TTT是一个回文串
存在字符串aaa和bbb，使得T=a+bT=a+bT=a+b，其中aaa，bbb分别为TTT的前缀和后缀。


输入描述

多组测试数据，第一行一个ttt，表示测试样例的组数。
接下来ttt行，...]]></description><category></category></item><item><title><![CDATA[AtCoder Product of Arithmetic Progression]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/104921345</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/104921345</guid><author>hypHuangYanPing</author><pubDate>Tue, 17 Mar 2020 14:28:35 +0800</pubDate><description><![CDATA[/**
链接：https://atcoder.jp/contests/m-solutions2019/tasks/m_solutions2019_e
题意：给出等差数列的首项ｘ，公差ｄ，项数ｎ。求该等差数列的前ｎ项积；
分析：考虑从模数为１e6+3出发，很显然算法复杂度是一个多log的或者更优的写法。
    tag1: ｄ＝０时，ans = ksm(x,n);
    tag2: d!=0 时...]]></description><category></category></item><item><title><![CDATA[CodeChef REMMAX 数字翻转后的最大数]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/104921252</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/104921252</guid><author>hypHuangYanPing</author><pubDate>Tue, 17 Mar 2020 14:23:43 +0800</pubDate><description><![CDATA[/**
链接:https://www.codechef.com/problems/REMMAX
题意:找1,2,3,...,n中，翻转之后的数值最大的那个数
ｅｇ:  n==31  ans = 29
分析:主要是考虑这样几种情况：
    １００００００
    １００１９９９
    １００３７６９
    １９９９９９９
    ３９９９９９９
    ２００１１１１
*/

#includ...]]></description><category></category></item><item><title><![CDATA[UVALive 2889 第n个回文数字]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/104921200</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/104921200</guid><author>hypHuangYanPing</author><pubDate>Tue, 17 Mar 2020 14:21:08 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;

#define ll long long
#define ull unsigned long long
#define  all(x) (x).begin(),(x).end()
using namespace std;


/***
 * 链接:https://vjudge.net/problem/UVALive-2889
 * 求...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #628 (Div. 2) C，D]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/104875639</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/104875639</guid><author>hypHuangYanPing</author><pubDate>Sun, 15 Mar 2020 12:35:45 +0800</pubDate><description><![CDATA[C. Ehab and Path-etic MEXs

题意

给定一颗包含nnn个节点的树，现在需要对树的边进行添加权值，所填权值的范围为[0,n−2][0,n-2][0,n−2]，问怎么添加权值，使得任意两点的简单路径的长度最大值最小。

输入描述

第一行一个nnn表示树节点的个数
接下来n−1n-1n−1行，每行两个数u,vu,vu,v，表示u和v存在一条边.
输入保证是一颗树，2≤n≤1...]]></description><category></category></item><item><title><![CDATA[2020 CCPC Wannafly Winter Camp Day1 H,F,B,I]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/104130457</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/104130457</guid><author>hypHuangYanPing</author><pubDate>Sat, 01 Feb 2020 10:08:59 +0800</pubDate><description><![CDATA[H最大公约数

题意
给定两个整数n,kn,kn,k，找到最小的yyy，使得gcd⁡(k,y)≤n\gcd (k,y) \leq ngcd(k,y)≤n，不存在这样的yyy，则输出−1-1−1。
分析
由于每次给出的结果是gcd⁡(k,y)\gcd(k,y)gcd(k,y)，因此需要枚举小于等于nnn的素数xxx，使得x∗k&lt;nx*k&lt;nx∗k&lt;n，故累乘之后的结果即为所求。大数...]]></description><category></category></item><item><title><![CDATA[ACM-ICPC 2016 上海赛区ECFINAL A，Ｄ]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/100108806</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/100108806</guid><author>hypHuangYanPing</author><pubDate>Tue, 27 Aug 2019 21:25:25 +0800</pubDate><description><![CDATA[题目链接：Number Theory Problem


#include&lt;bits/stdc++.h&gt;

#define ll long long
using namespace std;

int solve(int cas) {
    int n;cin&gt;&gt;n;
    cout&lt;&lt;"Case #"&lt;&lt;cas&lt;&lt;": ";
   ...]]></description><category></category></item><item><title><![CDATA[ACM-ICPC 2014 鞍山赛区现场赛 C]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/100107450</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/100107450</guid><author>hypHuangYanPing</author><pubDate>Tue, 27 Aug 2019 19:59:43 +0800</pubDate><description><![CDATA[题目链接：Coprime


#include&lt;bits/stdc++.h&gt;

#define ll long long
using namespace std;

const int maxn = 1e5 + 7;
int n, a[maxn], prime[maxn], cnt = 0;
int num[maxn];

vector&lt;int&gt; vec[maxn];

v...]]></description><category></category></item><item><title><![CDATA[ACM-ICPC 2016 大连赛区现场赛 A，D，F，B，J]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/100071170</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/100071170</guid><author>hypHuangYanPing</author><pubDate>Mon, 26 Aug 2019 09:23:29 +0800</pubDate><description><![CDATA[题目链接：Wrestling Match


#include&lt;bits/stdc++.h&gt;
#define ll long long 
using namespace std;

const int maxn=1e6+7;
int go[maxn],vis[maxn],col[maxn],bad[maxn];
vector&lt;int &gt;vec[maxn];
 
int df...]]></description><category></category></item><item><title><![CDATA[ACM-ICPC 2016 沈阳赛区现场赛 A，Ｂ]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/100068069</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/100068069</guid><author>hypHuangYanPing</author><pubDate>Sun, 25 Aug 2019 21:30:41 +0800</pubDate><description><![CDATA[题目链接：Thickest Burger


#include&lt;bits/stdc++.h&gt;
using namespace std;
int main (){
    int t;cin&gt;&gt;t;
    while(t--){
    
        int a,b;cin&gt;&gt;a&gt;&gt;b;
        cout&lt;&lt;max(a*2+b...]]></description><category></category></item><item><title><![CDATA[HDU - 5306 　Gorgeous Sequence]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99982197</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99982197</guid><author>hypHuangYanPing</author><pubDate>Wed, 21 Aug 2019 18:07:29 +0800</pubDate><description><![CDATA[题目链接：Gorgeous Sequence


/**
 * 维护区间最大值，及其个数，再记录一个次大值。
 * 感谢jry_2..的论文
 *
 */

#include &lt;bits/stdc++.h&gt;

#define  ll long long
using namespace std;

void scan() {
#ifndef ONLINE_JUDGE
    freop...]]></description><category></category></item><item><title><![CDATA[HDU - 4027　Can you answer these queries?]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99892960</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99892960</guid><author>hypHuangYanPing</author><pubDate>Tue, 20 Aug 2019 22:41:25 +0800</pubDate><description><![CDATA[题目链接：Can you answer these queries?


#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;map&gt;
#include &lt;stack&gt;
#include &lt;queue&gt;
#include &lt;set&gt;
#include &lt;vector&g...]]></description><category></category></item><item><title><![CDATA[POJ - 3468 　A Simple Problem with Integers]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99890872</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99890872</guid><author>hypHuangYanPing</author><pubDate>Tue, 20 Aug 2019 22:15:51 +0800</pubDate><description><![CDATA[题目链接：A Simple Problem with Integers


#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;map&gt;
#include &lt;stack&gt;
#include &lt;queue&gt;
#include &lt;set&gt;
#include &lt;vector&g...]]></description><category></category></item><item><title><![CDATA[HDU 1698 Just a Hook]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99870783</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99870783</guid><author>hypHuangYanPing</author><pubDate>Tue, 20 Aug 2019 18:35:15 +0800</pubDate><description><![CDATA[#include &lt;bits/stdc++.h&gt;

#define  ll long long
#define all(x) (x).begin(),(x).end()
using namespace std;

void scan() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("...]]></description><category></category></item><item><title><![CDATA[HDU 1754 I Hate It]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99856165</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99856165</guid><author>hypHuangYanPing</author><pubDate>Tue, 20 Aug 2019 16:23:44 +0800</pubDate><description><![CDATA[#include &lt;bits/stdc++.h&gt;

#define  ll long long
#define all(x) (x).begin(),(x).end()
using namespace std;

void scan() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("...]]></description><category></category></item><item><title><![CDATA[HDU 1166　敌兵布阵]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99854781</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99854781</guid><author>hypHuangYanPing</author><pubDate>Tue, 20 Aug 2019 16:11:57 +0800</pubDate><description><![CDATA[#include &lt;bits/stdc++.h&gt;

#define  ll long long
#define all(x) (x).begin(),(x).end()
using namespace std;

void scan() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("...]]></description><category></category></item><item><title><![CDATA[2019 年百度之星·程序设计大赛 - 初赛一 1001,1002,1003,1005]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99837329</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99837329</guid><author>hypHuangYanPing</author><pubDate>Tue, 20 Aug 2019 13:16:27 +0800</pubDate><description><![CDATA[题目链接：Polynomial


/*
 * [链接]：
 *
 * [题意]：计算ｎ次多项式趋近与无穷时的极限。
 * [分析]：看最高次即可。
 *
 * [tricks]:
 *
 * [时间复杂度]：
 *
 * */

#include &lt;bits/stdc++.h&gt;

#define  ll long long
#define all(x) (x).begin(),(x)...]]></description><category></category></item><item><title><![CDATA[ACM-ICPC 2016 青岛赛区现场赛 A，Ｂ，Ｃ]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99753134</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99753134</guid><author>hypHuangYanPing</author><pubDate>Mon, 19 Aug 2019 19:41:13 +0800</pubDate><description><![CDATA[题目链接：Relic Discovery


#include &lt;bits/stdc++.h&gt;

#define  ll long long
#define all(x) (x).begin(),(x).end()
using namespace std;

void scan() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r",...]]></description><category></category></item><item><title><![CDATA[ACM-ICPC 2016 北京赛区现场赛 D，E]]></title><link>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99701103</link><guid>https://blog.youkuaiyun.com/hypHuangYanPing/article/details/99701103</guid><author>hypHuangYanPing</author><pubDate>Sun, 18 Aug 2019 08:46:47 +0800</pubDate><description><![CDATA[题目链接：What a Beautiful lake


/*
 * [链接]：http://hihocoder.com/problemset/problem/1425
 *
 * [题意]：给出长度为n的环形数组，问最长连续递增或递减的区间的长度－１。
 *
 * [分析]：模拟即可。
 *
 * [tricks]:
 *
 * [时间复杂度]：
 *
 * */

#include &lt;b...]]></description><category></category></item></channel></rss>