<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[black_hole6的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/lbperfect123</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lbperfect123]]></copyright><item><title><![CDATA[【优快云】竞赛第7期题解&建议]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/127418356</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/127418356</guid><author>lbperfect123</author><pubDate>Thu, 20 Oct 2022 00:14:57 +0800</pubDate><description><![CDATA[已知存在集合A包含n个整数，从1到n。存在m个整数a[1…在集合A中去除这m个整数的的倍数。输出集合中包含的元素的个数。给定两组长度为n的二进制串，请问有多少种方法在第一个串中交换两个不同位置上的数字，使得这两个二进制串“或”的 结果发生改变？用马拉车算法求一下最长回文子串的长度即可，很经典。思路：统计一下会产生数值变化的情况即可。思路：经典二进制枚举+gcd+lcm。按照既定的顺序进行排序即可。]]></description><category></category></item><item><title><![CDATA[第十三届蓝桥杯JAVAB组国赛部分思路及代码]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/125358971</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/125358971</guid><author>lbperfect123</author><pubDate>Sun, 19 Jun 2022 16:18:32 +0800</pubDate><description><![CDATA[蓝桥杯解析]]></description><category></category></item><item><title><![CDATA[页面导航Navigation]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/123849158</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/123849158</guid><author>lbperfect123</author><pubDate>Wed, 30 Mar 2022 16:14:29 +0800</pubDate><description><![CDATA[页面导航Navigation
基本说明

做了两个Fragment
然后做了两个动作，将两个可以进行切换

HomeFragment代码
import android.os.Bundle
import com.example.navigation.HomeFragment
import android.view.LayoutInflater
import android.view.View
import android.view.ViewGroup
import android.widget.Button
]]></description><category></category></item><item><title><![CDATA[双列计分+reset+撤销]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/123827467</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/123827467</guid><author>lbperfect123</author><pubDate>Tue, 29 Mar 2022 17:43:18 +0800</pubDate><description><![CDATA[小练习]]></description><category></category></item><item><title><![CDATA[【Android】DataBinding+ViewModel+LiveData练习-kotlin]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/123817965</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/123817965</guid><author>lbperfect123</author><pubDate>Tue, 29 Mar 2022 12:07:08 +0800</pubDate><description><![CDATA[基本说明

利用ViewModel的Observe对数据进行检测
存储的数据类型是LiveData
ImageButton实现-1操作，button实现+1操作

MainActivity代码
import androidx.appcompat.app.AppCompatActivity
import android.os.Bundle
import androidx.databinding.DataBindingUtil
import androidx.lifecycle.Observer
import ]]></description><category></category></item><item><title><![CDATA[leetcode字符串生成二叉树模板]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/118163351</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/118163351</guid><author>lbperfect123</author><pubDate>Wed, 23 Jun 2021 21:54:15 +0800</pubDate><description><![CDATA[leetcode字符串生成二叉树模板
code：
#include&lt;iostream&gt;
#include&lt;vector&gt;
#include&lt;queue&gt;
#include&lt;string&gt;

using namespace std;

struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x) : val(x), left(NULL), r]]></description><category></category></item><item><title><![CDATA[c++对拍程序]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/108817961</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/108817961</guid><author>lbperfect123</author><pubDate>Sat, 26 Sep 2020 21:58:07 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstdlib&gt;
#include&lt;ctime&gt;
#include&lt;windows.h&gt;
using namespace std;
int main()
{
	int ok=0;
	int n=50;
    for(int i=1; i&lt;=n; ++i)
    {
        system("make.exe &gt; make.txt");
.]]></description><category></category></item><item><title><![CDATA[小B的魔法]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/104452449</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/104452449</guid><author>lbperfect123</author><pubDate>Sat, 22 Feb 2020 22:54:20 +0800</pubDate><description><![CDATA[小 B 的魔法
小 B 表演魔法。
观众给他两个 字符串 S,TS,T ，这两个字符串中只包含 小写 字母。
现在小 B 可以把两个字符串中任意所有的字母 xx 替换成 yy（ x,yx,y 代表任意字母），记为一次魔法操作。
注：任意所有指的是任何一种字母，它在两个串中的所有出现的位置都可以替换成同一种字母，当然也可以替换它们中的几个。
观众想知道，将两个字符串变为全等的最少操作次数是多少？
小...]]></description><category></category></item><item><title><![CDATA[D - Pairs-思维+二分]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/104410970</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/104410970</guid><author>lbperfect123</author><pubDate>Thu, 20 Feb 2020 15:04:30 +0800</pubDate><description><![CDATA[D - Pairs

这是一个思维+二分的好题。
思路：先分情况 小于0,等于0和大于0
然后进行二分答案即可
#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#include&lt;algorithm&gt;
#include&lt;queue&gt;
#include&lt;stack&gt;
#i...]]></description><category></category></item><item><title><![CDATA[建通道（思维题）]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/104200173</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/104200173</guid><author>lbperfect123</author><pubDate>Thu, 06 Feb 2020 18:29:38 +0800</pubDate><description><![CDATA[链接：https://ac.nowcoder.com/acm/contest/3003/I
来源：牛客网


时间限制：C/C++ 3秒，其他语言6秒
空间限制：C/C++ 262144K，其他语言524288K
64bit IO Format: %lld

题目描述

在无垠的宇宙中，有 n 个星球，第 i 个星球有权值 viv_ivi​。
由于星球之间距离极远，因此想在有限的时间内在星际间旅...]]></description><category></category></item><item><title><![CDATA[u‘s的影响力（两次矩阵快速幂+费马小定理+细节）]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/104187898</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/104187898</guid><author>lbperfect123</author><pubDate>Wed, 05 Feb 2020 20:24:32 +0800</pubDate><description><![CDATA[链接：https://ac.nowcoder.com/acm/contest/3002/J
来源：牛客网


时间限制：C/C++ 1秒，其他语言2秒
空间限制：C/C++ 262144K，其他语言524288K
64bit IO Format: %lld

题目描述

本题测试样例已经更(jia)新(qiang)。

求f[n]=f[n-1]*f[n-2]*(a^b);

μ's在九人齐心协力...]]></description><category></category></item><item><title><![CDATA[图形学实验三：二维几何变换]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/103134091</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/103134091</guid><author>lbperfect123</author><pubDate>Mon, 18 Nov 2019 23:27:26 +0800</pubDate><description><![CDATA[代码：


// ====== Computer Graphics Experiment #5 ======
// |       Two-Dimensional Transformation      |
// =============================================
//
// Requirement:
// (1) Implement funct...]]></description><category></category></item><item><title><![CDATA[C++ 实验一 创建CDate类]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/102852109</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/102852109</guid><author>lbperfect123</author><pubDate>Fri, 01 Nov 2019 10:01:36 +0800</pubDate><description><![CDATA[代码：


#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cstdio&gt;

using namespace std;

class CDate
{
private:
    int year, month, day;

public:
    CDate()...]]></description><category></category></item><item><title><![CDATA[图形学实验一：Bresenham 画直线算法]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/102792895</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/102792895</guid><author>lbperfect123</author><pubDate>Tue, 29 Oct 2019 09:25:37 +0800</pubDate><description><![CDATA[Bresenham's画线算法作图如下：




给定两个点起点P1(x1, y1), P2(x2, y2),如何画它们直连的直线呢，即是如何得到上图所示的蓝色的点。假设直线的斜率0&lt;k&gt;0,直线在第一象限，Bresenham算法的过程如下：
1.画起点(x1, y1).
2.准备画下一个点，X坐标加1，判断如果达到终点，则完成。否则找下一个点，由图可知要画的点要么为当前点的右邻接点，...]]></description><category></category></item><item><title><![CDATA[HDU第四场1003（构造）]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/98031076</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/98031076</guid><author>lbperfect123</author><pubDate>Thu, 01 Aug 2019 09:44:03 +0800</pubDate><description><![CDATA[更新在了博客园https://www.cnblogs.com/Staceyacm/p/11280622.html
]]></description><category></category></item><item><title><![CDATA[大数模板（存）]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/96428473</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/96428473</guid><author>lbperfect123</author><pubDate>Thu, 18 Jul 2019 12:31:30 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;
#include &lt;stdlib.h&gt;
#include &lt;iostream&gt; 
#include &lt;string&gt; 
#include &lt;cstring&gt; 
#include &lt;cstdio&gt; 
using namespace std; 

const int maxn ...]]></description><category></category></item><item><title><![CDATA[微信小程序关于登陆界面的资料]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/90378070</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/90378070</guid><author>lbperfect123</author><pubDate>Mon, 20 May 2019 16:54:59 +0800</pubDate><description><![CDATA[https://developers.weixin.qq.com/miniprogram/dev/index.html

https://www.cnblogs.com/dashucoding/p/10166485.html



https://blog.youkuaiyun.com/weixin_38807994/article/details/80391085
]]></description><category></category></item><item><title><![CDATA[“美登杯”上海市高校大学生程序设计邀请赛（BCD解析链接）]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/90321398</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/90321398</guid><author>lbperfect123</author><pubDate>Sat, 18 May 2019 22:13:16 +0800</pubDate><description><![CDATA[B题

D题

C题
]]></description><category></category></item><item><title><![CDATA[linux 常用命令]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/89945364</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/89945364</guid><author>lbperfect123</author><pubDate>Wed, 08 May 2019 09:35:44 +0800</pubDate><description><![CDATA[链接：https://www.cnblogs.com/Staceyacm/p/10821053.html
]]></description><category></category></item><item><title><![CDATA[FZUOJ小坑点-------long long 的输入输出]]></title><link>https://blog.youkuaiyun.com/lbperfect123/article/details/89811508</link><guid>https://blog.youkuaiyun.com/lbperfect123/article/details/89811508</guid><author>lbperfect123</author><pubDate>Sat, 04 May 2019 11:07:07 +0800</pubDate><description><![CDATA[在FZU用long long 要特别注意输入输出要用%I64d，如果用%lld会报WA
]]></description><category></category></item></channel></rss>