<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[凳子]]></title><description><![CDATA[笔记]]></description><link>https://blog.youkuaiyun.com/christry_stool</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; christry_stool]]></copyright><item><title><![CDATA[Python yield关键字 【QA With ChatGPT】]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/129644071</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/129644071</guid><author>christry_stool</author><pubDate>Sat, 18 Mar 2023 22:26:27 +0800</pubDate><description><![CDATA[下一次迭代时，生成器函数会从上一次暂停的地方继续执行，继续生成值，直到遇到下一个 yield 关键字或者函数结束。下一次迭代时，生成器函数会从上一次暂停的地方继续执行，继续生成值，直到遇到下一个 yield 关键字或者函数结束。() 方法再次被调用时，Python 会恢复生成器函数的状态，并从上一次暂停的地方继续执行，直到遇到下一个 yield 关键字或者函数结束。() 方法被调用时，Python 会在生成器函数的代码中执行到下一个 yield 关键字处，并将生成的值返回给调用者。]]></description><category></category></item><item><title><![CDATA[关于MyBatis中Mapper的XML中何时需要显式定义TypeHandler]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/82795681</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/82795681</guid><author>christry_stool</author><pubDate>Fri, 21 Sep 2018 01:19:36 +0800</pubDate><description><![CDATA[关于MyBatis中Mapper的XML中何时需要显式定义TypeHandler
标签（空格分隔）： mybatis

题目中的显式定义TypeHandler，也包括定义parameterType、parameterMap等，这些都是MyBatis用来找TypeHandler的依据。
我们知道，MyBatis可以一定程度地简化Mapper的xml配置文件的编写，但到底简化到什么程度呢？
最近在写项...]]></description><category></category></item><item><title><![CDATA[使用 Java NIO 实现 Simple Redis 服务端 客户端]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/81092109</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/81092109</guid><author>christry_stool</author><pubDate>Wed, 18 Jul 2018 09:11:48 +0800</pubDate><description><![CDATA[最近在学习NIO，想找个demo来练练手，然后发现用java nio来简单实现redis应该挺有趣的。



Java NIO 概览

首先，java nio有3个重要的类： 
* ByteBuffer: 用于读写数据，实际上是byte数组的一个封装。它的使用方式还是比较有趣的，需要注意的一点是在写模式转换为读模式时需要flip()。 
* Channel: 用于维护服务端与客户端的通信通道。 
...]]></description><category></category></item><item><title><![CDATA[uva_12298 Super Jokwe II（FFT）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/73075311</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/73075311</guid><author>christry_stool</author><pubDate>Sun, 11 Jun 2017 23:14:45 +0800</pubDate><description><![CDATA[题目链接题目要求牌的组合数，可以转化为多项式乘法。 
设某种花色对应的多项式为 
 
则的指数则可以表示扑克牌的点数，系数则可以赋值为0或1，来表示该点数是否存在。 
四种花色，则一共有4条多项式，将这些多项式乘起来，结果的的系数即为点数之和为r的方法数。 
那么现在的问题是如何进行多项式的乘法，直接暴力的复杂度会超时，需要用FFT加速，时间复杂度为。 
FFT的原理和实现的话推荐看这位小哥的视频，]]></description><category></category></item><item><title><![CDATA[BZOJ_2038 小Z的袜子（莫队算法）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/65747837</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/65747837</guid><author>christry_stool</author><pubDate>Sat, 25 Mar 2017 01:41:13 +0800</pubDate><description><![CDATA[BZOJ【2038】—— [2009国家集训队]小Z的袜子(hose)





Time Limit: 20 Sec

Memory Limit: 259 MB




Description

作为一个生活散漫的人，小Z每天早上都要耗费很久从一堆五颜六色的袜子中找出一双来穿。终于有一天，小Z再也无法忍受这恼人的找袜子过程，于是他决定听天由命…… 
具体来说，小Z]]></description><category></category></item><item><title><![CDATA[poj_2480 Longge's problem（素因子分解+积性函数+欧拉phi函数）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/62440801</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/62440801</guid><author>christry_stool</author><pubDate>Thu, 16 Mar 2017 21:51:37 +0800</pubDate><description><![CDATA[Longge's problem




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 8297
 
Accepted: 2765




Description
Longge is good at mathematics and he likes to think about ha]]></description><category></category></item><item><title><![CDATA[codeforces 456B. Fedya and Maths（大数取模/大数的幂）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/62215889</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/62215889</guid><author>christry_stool</author><pubDate>Wed, 15 Mar 2017 09:57:43 +0800</pubDate><description><![CDATA[B. Fedya and Maths


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



Fedya studies in a gymnasium. Fedya's mat]]></description><category></category></item><item><title><![CDATA[codeforces 603C. Lieges of Legendre（博弈+SG函数）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/61925316</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/61925316</guid><author>christry_stool</author><pubDate>Mon, 13 Mar 2017 20:16:35 +0800</pubDate><description><![CDATA[C. Lieges of Legendre


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



Kevin and Nicky Sun have invented a n]]></description><category></category></item><item><title><![CDATA[codeforces 777E. Hanoi Factory （LIS+dp+树状数组/线段树维护区间最大值及单点更新）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/60889641</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/60889641</guid><author>christry_stool</author><pubDate>Thu, 09 Mar 2017 00:48:35 +0800</pubDate><description><![CDATA[E. Hanoi Factory


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



Of course you have heard the famous task ab]]></description><category></category></item><item><title><![CDATA[codeforces 782D Innokenty and a Football League（2-SAT）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/60604286</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/60604286</guid><author>christry_stool</author><pubDate>Mon, 06 Mar 2017 22:41:10 +0800</pubDate><description><![CDATA[D. Innokenty and a Football League


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



Innokenty is a president]]></description><category></category></item><item><title><![CDATA[poj_2454 Jersey Politics（贪心+随机）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/54316070</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/54316070</guid><author>christry_stool</author><pubDate>Tue, 10 Jan 2017 17:49:46 +0800</pubDate><description><![CDATA[Jersey Politics




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 5596
 
Accepted: 1416
 
Special Judge




Description
In the newest census of Jersey Cows and Hol]]></description><category></category></item><item><title><![CDATA[poj_1487 Single-Player Games（高斯消元+自由元）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/53824451</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/53824451</guid><author>christry_stool</author><pubDate>Fri, 23 Dec 2016 00:22:04 +0800</pubDate><description><![CDATA[Single-Player Games




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 1479
 
Accepted: 407




Description
Playing games is the most fun if other people take part. B]]></description><category></category></item><item><title><![CDATA[poj_1166 The Clocks（高斯消元）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/53750036</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/53750036</guid><author>christry_stool</author><pubDate>Mon, 19 Dec 2016 22:44:56 +0800</pubDate><description><![CDATA[The Clocks




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 16797
 
Accepted: 6939




Description


|-------|    |-------|    |-------|

|       |    |       |]]></description><category></category></item><item><title><![CDATA[poj_2187 Beauty Contest（凸包+旋转卡壳）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/53309570</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/53309570</guid><author>christry_stool</author><pubDate>Wed, 23 Nov 2016 19:19:09 +0800</pubDate><description><![CDATA[Beauty Contest




Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 35711
 
Accepted: 11066




Description
Bessie, Farmer John's prize cow, has just won first place in]]></description><category></category></item><item><title><![CDATA[poj_1416 Shredding Company（dfs）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/53192397</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/53192397</guid><author>christry_stool</author><pubDate>Wed, 16 Nov 2016 22:13:28 +0800</pubDate><description><![CDATA[Shredding Company




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 5684
 
Accepted: 3190




Description

You have just been put in charge of developing a new shre]]></description><category></category></item><item><title><![CDATA[poj_1426 Find The Multiple（bfs + 同余模定理）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/53080642</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/53080642</guid><author>christry_stool</author><pubDate>Tue, 08 Nov 2016 12:14:39 +0800</pubDate><description><![CDATA[Find The Multiple




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 27988
 
Accepted: 11621
 
Special Judge




Description

Given a positive integer n, write a p]]></description><category></category></item><item><title><![CDATA[poj_3278 Catch That Cow（bfs）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/53065543</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/53065543</guid><author>christry_stool</author><pubDate>Mon, 07 Nov 2016 13:40:19 +0800</pubDate><description><![CDATA[Catch That Cow




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 79009
 
Accepted: 24912




Description

Farmer John has been informed of the location of a fugitiv]]></description><category></category></item><item><title><![CDATA[poj_1321 棋盘问题（dfs）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/53055364</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/53055364</guid><author>christry_stool</author><pubDate>Sun, 06 Nov 2016 17:44:54 +0800</pubDate><description><![CDATA[棋盘问题




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 37781
 
Accepted: 18537




Description

在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求]]></description><category></category></item><item><title><![CDATA[poj_2513 Colored Sticks（字典树+并查集+欧拉通路）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/53033918</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/53033918</guid><author>christry_stool</author><pubDate>Fri, 04 Nov 2016 13:42:29 +0800</pubDate><description><![CDATA[Colored Sticks




Time Limit: 5000MS
 
Memory Limit: 128000K


Total Submissions: 36048
 
Accepted: 9431




Description

You are given a bunch of wooden sticks. Each endpoint of e]]></description><category></category></item><item><title><![CDATA[poj_3253 Fence Repair（优先队列 / 堆）]]></title><link>https://blog.youkuaiyun.com/christry_stool/article/details/53021052</link><guid>https://blog.youkuaiyun.com/christry_stool/article/details/53021052</guid><author>christry_stool</author><pubDate>Thu, 03 Nov 2016 14:26:02 +0800</pubDate><description><![CDATA[Fence Repair




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 41793
 
Accepted: 13611




Description

Farmer John wants to repair a small length of the fence arou]]></description><category></category></item></channel></rss>