<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ailei7251的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ailei7251</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ailei7251]]></copyright><item><title><![CDATA[Codeforces Round #575 (Div. 3) A B C]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382918</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382918</guid><author>ailei7251</author><pubDate>Thu, 25 Jul 2019 14:48:00 +0800</pubDate><description><![CDATA[Codeforces Round #575 (Div. 3)
A

#include&lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
const int N = 1e5+100;
int n;
ll a,sum=0;
int main(){
	cin &gt;&gt; n;
	whil...]]></description><category></category></item><item><title><![CDATA[Educational Codeforces Round 69 (Rated for Div. 2)  A B C D]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382915</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382915</guid><author>ailei7251</author><pubDate>Thu, 25 Jul 2019 14:43:00 +0800</pubDate><description><![CDATA[Educational Codeforces Round 69 (Rated for Div. 2)
A

#include&lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
const int N = 1e5+100;

int t;
int n;
int a[N];
int main(...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #574 (Div. 2) A B C D1]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382898</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382898</guid><author>ailei7251</author><pubDate>Thu, 18 Jul 2019 10:22:00 +0800</pubDate><description><![CDATA[Codeforces Round #574 (Div. 2)

ADrinks Choosing

#include&lt;bits/stdc++.h&gt;
using namespace std;
const int N = 1e3+100;
typedef long long ll;

int n,k;
int a[N];
int b;
int cnt=...]]></description><category></category></item><item><title><![CDATA[洛谷 P1048 采药  01背包入门]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382916</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382916</guid><author>ailei7251</author><pubDate>Tue, 16 Jul 2019 11:17:00 +0800</pubDate><description><![CDATA[P1048采药
最近想学dp了
一道非常简单入门的01背包，写此博客做一个教训，对01背包还不是特别熟，动态方程很容易就推出来了，但是写二维状态方程时wa了，然后改为一维过了。
主要还是对01背包不熟悉。
dp[i][j] 表示用 j 单位时间采前 i 种药草的最大价值。
dp[i][j] = max( dp[i-1][j-e[i].t] + e[i].w , dp[i-1...]]></description><category></category></item><item><title><![CDATA[Educational Codeforces Round 68 (Rated for Div. 2) A  B  C]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382920</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382920</guid><author>ailei7251</author><pubDate>Mon, 15 Jul 2019 18:58:00 +0800</pubDate><description><![CDATA[ARemove a Progression

#include&lt;bits/stdc++.h&gt;
using namespace std;
#define ll long long
const int N=1e5+100;

int main(){
	int t;
	cin &gt;&gt; t;
	while(t--){
		ll n , x;
		ci...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #573 (Div. 2)  A B C D]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382913</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382913</guid><author>ailei7251</author><pubDate>Sat, 13 Jul 2019 11:51:00 +0800</pubDate><description><![CDATA[ATokitsukaze and Enhancement

#include&lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
const int N=1e5+100;

int x;
int main(){
	cin &gt;&gt; x;
	int cnt = 0;
	if( x%4 ...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #270  A B C]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382914</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382914</guid><author>ailei7251</author><pubDate>Sat, 13 Jul 2019 11:44:00 +0800</pubDate><description><![CDATA[ADesign Tutorial: Learn from Math
素数筛

#include&lt;bits/stdc++.h&gt;
using namespace std;
const int N = 1e6 + 100;
int a[N]={0};
int main(){
	int n;
	cin &gt;&gt; n;
	a[1] = 1;
	for(in...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #269 (Div. 2)  A B C]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382912</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382912</guid><author>ailei7251</author><pubDate>Fri, 12 Jul 2019 11:56:00 +0800</pubDate><description><![CDATA[A:MUH and Sticks
水题

#include&lt;bits/stdc++.h&gt;
using namespace std;

int a[10]={0};

int main(){
	int c;
	for(int i=0;i&lt;6;i++){
		cin&gt;&gt;c;
		a[c]++;
	}
	bool flag=false;...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #268 (Div. 2)  A B C D]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382911</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382911</guid><author>ailei7251</author><pubDate>Thu, 11 Jul 2019 16:10:00 +0800</pubDate><description><![CDATA[Codeforces Round #268 (Div. 2)

AI Wanna Be the Guy
水题

#include&lt;bits/stdc++.h&gt;
using namespace std;

int a[1000]={0};
int main(){
	int n,p,c;
	cin&gt;&gt;n;
	for(int i=0;i&lt;...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #565 (Div. 3) A B C E]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382908</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382908</guid><author>ailei7251</author><pubDate>Tue, 11 Jun 2019 17:15:00 +0800</pubDate><description><![CDATA[Codeforces Round #565 (Div. 3)
ADivide it!
由题可知，分别消掉1个2,3,5分别需要1,2,3的花费


#include&lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
ll q,n;
int main(){
    cin&gt;&gt;q;...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #563 (Div. 2)  A B C D]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382909</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382909</guid><author>ailei7251</author><pubDate>Tue, 04 Jun 2019 17:39:00 +0800</pubDate><description><![CDATA[Codeforces Round #563 (Div. 2)

A:Ehab Fails to Be Thanos
题意：给你一个数组，是否存在一种顺序，使数组前一半和与后一半和不相等
排序，前n项和 后n项和 是否相等。


#include&lt;bits/stdc++.h&gt;
using namespace std;
const int N=1e4;

...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #402 (Div. 2) A B C D]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382906</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382906</guid><author>ailei7251</author><pubDate>Tue, 04 Jun 2019 16:18:00 +0800</pubDate><description><![CDATA[Codeforces Round #402 (Div. 2)
没补完。。。
A:Pupils Redistribution
题意：交换a、b数组中的值，使a、b中每个数值得数量相同
统计a、b数组中每个数值得个数，用ai表示数组a中含 i 的个数
if（ai+bi是奇数） 那么无论怎么交换，a、b中i的数量都不一样，输出-1；
else | ai-bi | /2 表示数值 i...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #401 (Div. 2) A B C D E]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382905</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382905</guid><author>ailei7251</author><pubDate>Sat, 25 May 2019 22:03:00 +0800</pubDate><description><![CDATA[Codeforces Round #401 (Div. 2)
第一套。
刷100套cf，加油加油！！！

ps：写题解时没看题，题意可能有错
A:Shell Game
题意：三个杯子，其中一个下面有东西，操作：先交换左和中间，再交换右和中间。给出n次操作后的状态，东西在x（0,1，或2）位置，让你求出初始东西在哪个位置。
0 1 2
1 0 2
1 2 0
2 1 ...]]></description><category></category></item><item><title><![CDATA[图论点、边集和二分图的相关概念和性质]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382901</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382901</guid><author>ailei7251</author><pubDate>Thu, 09 May 2019 16:28:00 +0800</pubDate><description><![CDATA[转自https://dsqiu.iteye.com/blog/1689505
点覆盖、最小点覆盖
点覆盖集即一个点集，使得所有边至少有一个端点在集合里。或者说是“点” 覆盖了所有“边”。。极小点覆盖(minimal vertex covering)：本身为点覆盖，其真子集都不是。最小点覆盖(minimum vertex covering)：点最少的点覆盖。点覆盖数(vertex co...]]></description><category></category></item><item><title><![CDATA[2019年湘潭大学程序设计竞赛（重现赛）]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382899</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382899</guid><author>ailei7251</author><pubDate>Sat, 04 May 2019 23:21:00 +0800</pubDate><description><![CDATA[2019年湘潭大学程序设计竞赛（重现赛）
A:Who's better?


#include&lt;bits/stdc++.h&gt;
using namespace std;
int main(){
    int n1,p1,s1,n2,p2,s2;
    cin&gt;&gt;n1&gt;&gt;p1&gt;&gt;s1;
    cin&gt;&gt;n2...]]></description><category></category></item><item><title><![CDATA[牛客练习赛43]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382900</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382900</guid><author>ailei7251</author><pubDate>Sat, 06 Apr 2019 15:03:00 +0800</pubDate><description><![CDATA[牛客练习赛43
A题：Tachibana Kanade Loves School
水题，看清"YE5"和"N0"而不是"YES"、"NO";


#include&lt;bits/stdc++.h&gt;
using namespace std;
int main(){
    int n,a[110],b[110];
    cin&gt;&gt;n;
    fo...]]></description><category></category></item><item><title><![CDATA[博客页面定制]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382897</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382897</guid><author>ailei7251</author><pubDate>Fri, 05 Apr 2019 13:47:00 +0800</pubDate><description><![CDATA[通过两个大佬代码改的
1.页面主体框架http://www.cnblogs.com/yescoolfan/p/3462350.html
2.美化：https://www.cnblogs.com/yjlblog/p/8724881.html
选择lesslsmore
页面定制css代码：


/*公用*/
body {
    font-size:15px;
    p...]]></description><category></category></item><item><title><![CDATA[2251: Code Cleanups]]></title><link>https://blog.youkuaiyun.com/ailei7251/article/details/101382896</link><guid>https://blog.youkuaiyun.com/ailei7251/article/details/101382896</guid><author>ailei7251</author><pubDate>Mon, 11 Mar 2019 12:54:00 +0800</pubDate><description><![CDATA[原题：http://acm.csu.edu.cn:20080/csuoj/problemset/problem?pid=2251
题意：a[i]天会出现一个垃圾，如果不清扫每天都会+1个垃圾.不能超过20个垃圾不清扫，问你最少清扫几次
题解：

 1 #include&lt;bits/stdc++.h&gt;
 2 using namespace std;
 3 
 4 i...]]></description><category></category></item></channel></rss>