<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[kitalekita的博客]]></title><description><![CDATA[一个很笨又很懒人的博客]]></description><link>https://blog.youkuaiyun.com/qq_45612697</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_45612697]]></copyright><item><title><![CDATA[html学习日记(自用)]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/126754902</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/126754902</guid><author>qq_45612697</author><pubDate>Wed, 07 Sep 2022 22:03:45 +0800</pubDate><description><![CDATA[道阻且长，且行且珍惜。]]></description><category></category></item><item><title><![CDATA[CodeForces-1438D Powerful Ksenia（构造）]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/120965833</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/120965833</guid><author>qq_45612697</author><pubDate>Tue, 26 Oct 2021 09:42:43 +0800</pubDate><description><![CDATA[Powerful Ksenia（构造）
题目链接
Problem statment
Ksenia has an array aaa consisting of nnn positive integers a1,a2,…,ana_1, a_2, \ldots, a_na1​,a2​,…,an​.
In one operation she can do the following:

choose three distinct indices i,j,ki, j, ki,j,k, and then
change]]></description><category></category></item><item><title><![CDATA[ARC 115A Two Choices(思维)]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/120876770</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/120876770</guid><author>qq_45612697</author><pubDate>Wed, 20 Oct 2021 22:39:15 +0800</pubDate><description><![CDATA[Two Choices 
题目链接
题意
​		给你N个人的M选项的答案，让你去统计有几对无论怎么构造正确答案，它们的得分结果都不相同。
思路
​		显然，如果两个答案x,yx,yx,y不相等的位置数量为偶数的话，那么一定能够构造出来答案使得两个人的得分结果一样。那么我们可以发现当两个答案分别存在奇数个111和偶数个111的时候，这个时候我无论怎么构造我都不可能使得其答案相同，原因如下：假设a1a_1a1​和b1b_1b1​中相同111的个数为zzz,a1a_1a1​中111的个数为xxx,b1b_1b1​]]></description><category></category></item><item><title><![CDATA[ABC221E LEQ]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/120876739</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/120876739</guid><author>qq_45612697</author><pubDate>Wed, 20 Oct 2021 22:36:17 +0800</pubDate><description><![CDATA[ABC221E(树状数组+乘法逆元)
题目链接
Problem Statement
Given is a sequence of NNN integers:$ A = (A_1, A_2, \dots, A_N)$
Find the number of (not necessarily contiguous) subsequences A′=(A1′,A2′,…,Ak′)A'=(A'_1,A'_2,\ldots,A'_k)A′=(A1′​,A2′​,…,Ak′​) of length at least 22]]></description><category></category></item><item><title><![CDATA[ARC116C Multiple Sequences(隔板法，枚举)]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/120876664</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/120876664</guid><author>qq_45612697</author><pubDate>Wed, 20 Oct 2021 22:31:30 +0800</pubDate><description><![CDATA[ARC116C(隔板法，枚举)
题目链接
Problem Statement
Given are integers NNN and MMM. How many sequences AAA of NNN integers satisfy the following conditions?

1≤Ai≤M(i=1,2,…,N)1 \leq A_i \leq M \left(i = 1, 2, \ldots, N\right)1≤Ai​≤M(i=1,2,…,N)
Ai+1A_{i+1}Ai+1​ is a mul]]></description><category></category></item><item><title><![CDATA[CodeForces - 294C_Shaass and Lights（组合数学）]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/120337137</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/120337137</guid><author>qq_45612697</author><pubDate>Thu, 16 Sep 2021 20:41:27 +0800</pubDate><description><![CDATA[CodeForces - 294C_Shaass and Lights
There are nnn lights aligned in a row. These lights are numbered 1 to nnn from left to right. Initially some of the lights are switched on. Shaass wants to switch all the lights on. At each step he can switch a light on ]]></description><category></category></item><item><title><![CDATA[AtCoder abc156_E_Roaming（组合数学，隔板法）]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/120336139</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/120336139</guid><author>qq_45612697</author><pubDate>Thu, 16 Sep 2021 19:49:17 +0800</pubDate><description><![CDATA[AtCoder abc156_e_Roaming
Problem Statement
There is a building with n rooms, numbered 1 to n.
We can move from any room to any other room in the building.
Let us call the following event a move: a person in some room ii goes to another room j (iii≠\neq​=$]]></description><category></category></item><item><title><![CDATA[HDU7048 Link with EQ]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/119878898</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/119878898</guid><author>qq_45612697</author><pubDate>Tue, 24 Aug 2021 10:03:35 +0800</pubDate><description><![CDATA[题目链接
题目大意：
  有一张桌子长度为n，第一个人是随便坐的，但是接下来坐的一个人，要尽可能的远离旁边的人，就是要求与最近距离的人靠得尽可能的远，问你长度为n的桌子能够坐的期望人数是多少?
思路:
  通过推几个样例，我们可以发现当第一个人坐下以后，这张桌子能够坐总人数也已经可以知道了，那么我们就是要求1n∗∑i=1nq(x)\frac {1}{n}*\sum_{i=1}^{n}q(x)n1​∗∑i=1n​q(x)(1n\frac{1}{n}n1​为第一个人随机选择一个位置的概率，q(x)为选择x这个位]]></description><category></category></item><item><title><![CDATA[Light oj 1138 Trailing Zeroes (III) （二分）]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/115083519</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/115083519</guid><author>qq_45612697</author><pubDate>Mon, 22 Mar 2021 16:21:52 +0800</pubDate><description><![CDATA[Trailing Zeroes (III)
You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1 * 2 * … * N. For example, 5! = 120, 120 contains one zero on the trail.
input
Input starts with an]]></description><category></category></item><item><title><![CDATA[floyd && dijkstra]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/115045693</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/115045693</guid><author>qq_45612697</author><pubDate>Sun, 21 Mar 2021 11:07:44 +0800</pubDate><description><![CDATA[dijkstra
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#include&lt;iostream&gt;
#include&lt;queue&gt;
#include&lt;stack&gt;
#include&lt;algorithm&gt;
#include&lt;vector&gt;
#include&lt;cmath&gt;
#include&lt;map&gt;
#include&lt;string&gt;
#include&lt;set&g]]></description><category></category></item><item><title><![CDATA[2018-2019 ACM-ICPC, Asia Jiaozuo Regional Contest部分题解]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/110727433</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/110727433</guid><author>qq_45612697</author><pubDate>Sat, 05 Dec 2020 21:41:37 +0800</pubDate><description><![CDATA[题目
A
B
C
D
E
F
G
H
I
J
K
L




solve
✔
-
-
✔
✔
????
-
-
✔
-
-
-


✔：比赛时通过；????：赛后通过；⚪：比赛时尝试了未通过；-：比赛时未尝试
D.Keiichi Tsuchiya the Drift King（思维）
solved by pp__qq、kitalekita
这道题唯一难点就是考虑转弯的时候，汽车有无脱离直线赛道（根据角度判断），考虑重合的部分就可以了，这里不放图了。
#include&lt;cstdio&gt;
#inclu]]></description><category></category></item><item><title><![CDATA[The 14th Chinese Northeast Collegiate Programming Contest部分题解]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/110441861</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/110441861</guid><author>qq_45612697</author><pubDate>Tue, 01 Dec 2020 18:57:27 +0800</pubDate><description><![CDATA[题目
A
B
C
D
E
F
G
H
I
J
K
L




solved
-
????
✔
????
-
-
✔
-
????
✔
-
-


✔：比赛时通过；????：赛后通过；⚪：比赛时尝试了未通过；-：比赛时未尝试
这一场比赛是我们队伍队内自己第一次打的训练赛。配合的不是很到位，因为也没打过几场团体赛，平时训练都是自己打自己的。总体来说队友很强，就是我一个人在拖后腿，要努力变强，呜呜呜。
B:Team

...]]></description><category></category></item><item><title><![CDATA[【fight for first wrong answer】的训练记录]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/110441221</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/110441221</guid><author>qq_45612697</author><pubDate>Tue, 01 Dec 2020 17:29:22 +0800</pubDate><description><![CDATA[队员:pp__qq、Andy01_、kitalekita
本篇文章主要是用来记录fight for first wrong answer队伍的日常训练的记录（打过的那几个训练赛的赛时做出的题以及赛后所补的题）和一些赛后的总结，便于更好的查漏补缺。
自主训练：
2020/11/7:The 14th Chinese Northeast Collegiate Programming Contest(题数：5/12)

...]]></description><category></category></item><item><title><![CDATA[10-28]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/109330596</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/109330596</guid><author>qq_45612697</author><pubDate>Wed, 28 Oct 2020 14:19:10 +0800</pubDate><description><![CDATA[Dubious Cyrpto



题目的大致意思为：已知正整数 l, r, m 求任意一组 a, b, c 使得存在正整数 n 满足 n * a + b - c = m 且a, b, c 均在 [l, r] 这个范围之内，让你构造一个a,b,c使得na+b-c==m。
题解：  这道题它确保了至少有一个a,b,c能够使得na+b-c=m，所以我只要让c=l,或者c=r，然后去遍历一遍l到r之间的值就行了。
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#in]]></description><category></category></item><item><title><![CDATA[POJ1006 Biorhythms（暴力）]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/108555040</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/108555040</guid><author>qq_45612697</author><pubDate>Sat, 12 Sep 2020 21:43:01 +0800</pubDate><description><![CDATA[题目链接
Description
Some people believe that there are three cycles in a person’s life that start the day he or she is born. These three cycles are the physical, emotional, and intellectual cycles, and they have periods of lengths 23, 28, and 33 days, respect]]></description><category></category></item><item><title><![CDATA[A Dangerous Maze（期望问题）]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/108542688</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/108542688</guid><author>qq_45612697</author><pubDate>Fri, 11 Sep 2020 22:29:04 +0800</pubDate><description><![CDATA[题目链接
You are in a maze; seeing n doors in front of you in beginning. You can choose any door you like. The probability for choosing a door is equal for all doors.
If you choose the ith door, it can either take you back to the same position where you begun ]]></description><category></category></item><item><title><![CDATA[Codeforces Round #669 (Div. 2) A，B题解]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/108524041</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/108524041</guid><author>qq_45612697</author><pubDate>Thu, 10 Sep 2020 22:36:01 +0800</pubDate><description><![CDATA[A. Ahahahahahahahaha
Alexandra has an even-length array a, consisting of 0s and 1s. The elements of the array are enumerated from 1 to n. She wants to remove at most n2 elements (where n — length of array) in the way that alternating sum of the array will ]]></description><category></category></item><item><title><![CDATA[HDU1808&&POJ3370 Halloween treats（鸽巢定理）]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/108500912</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/108500912</guid><author>qq_45612697</author><pubDate>Wed, 09 Sep 2020 20:04:31 +0800</pubDate><description><![CDATA[HDU题目链接
POJ题目链接
Problem Description
Every year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many children call on him, so it may happen that a child will get noth]]></description><category></category></item><item><title><![CDATA[HDU 5776 sum（鸽巢定理简单题）]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/108476292</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/108476292</guid><author>qq_45612697</author><pubDate>Tue, 08 Sep 2020 20:23:04 +0800</pubDate><description><![CDATA[题目链接
Problem Description
Given a sequence, you’re asked whether there exists a consecutive subsequence whose sum is divisible by m. output YES, otherwise output NO
Input
The first line of the input has an integer T (1≤T≤10), which represents the number of ]]></description><category></category></item><item><title><![CDATA[HDU 1205 吃糖果（鸽巢定理）]]></title><link>https://blog.youkuaiyun.com/qq_45612697/article/details/108453935</link><guid>https://blog.youkuaiyun.com/qq_45612697/article/details/108453935</guid><author>qq_45612697</author><pubDate>Mon, 07 Sep 2020 19:31:58 +0800</pubDate><description><![CDATA[题目链接
Problem Description
HOHO，终于从Speakless手上赢走了所有的糖果，是Gardon吃糖果时有个特殊的癖好，就是不喜欢将一样的糖果放在一起吃，喜欢先吃一种，下一次吃另一种，这样；可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完？请你写个程序帮忙计算一下。
Input
第一行有一个整数T，接下来T组数据，每组数据占2行，第一行是一个整数N（0&lt;N&lt;=1000000)，第二行是N个数，表示N种糖果的数目Mi(0&lt;Mi&lt;=10000]]></description><category></category></item></channel></rss>