<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.soullan.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=BreakFast</id>
	<title>SDNU ICPC Wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.soullan.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=BreakFast"/>
	<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php/Special:Contributions/BreakFast"/>
	<updated>2026-05-13T16:05:22Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.36.0</generator>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2021_ICPC_Shenyang&amp;diff=272</id>
		<title>BreakFast:2021 ICPC Shenyang</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2021_ICPC_Shenyang&amp;diff=272"/>
		<updated>2021-11-21T13:55:30Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Replay */ add replay&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Replay ==&lt;br /&gt;
&lt;br /&gt;
比赛一开始，瞬间找到签到，lz两行直接AC，怒拿一血！！！！&lt;br /&gt;
&lt;br /&gt;
接着hr口胡b题解法，lz第一发tle了，接着去写F小模拟，顺利过F后，xj指出b的问题，忐忑地交一发后神奇AC了&lt;br /&gt;
&lt;br /&gt;
然后卡j，xj口胡解法，交一发喜提一wa，一万年后对拍才发现有种情况没考虑，lz特别嫌弃地写完后得到AC&lt;br /&gt;
&lt;br /&gt;
接下来lz去卡A和M，hr和xj卡H和L，四线卡题到赛末&lt;br /&gt;
&lt;br /&gt;
最后还剩10min，xj开始提出听起来极其不靠谱的做法，根据样例修正细节后，才发现居然就是正解？？？&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2021_ICPC_Shenyang&amp;diff=271</id>
		<title>BreakFast:2021 ICPC Shenyang</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2021_ICPC_Shenyang&amp;diff=271"/>
		<updated>2021-11-21T13:42:28Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add Replay&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Replay ==&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=270</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=270"/>
		<updated>2021-11-21T13:42:06Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Trainings */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:ACPC Kickoff 2021|ACPC Kickoff 2021]] || Sep/29/2021 || 12/12 || O || O || O || Ø || O || O || Ø || O || Ø || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2018牛客多校day3|2018牛客多校day3]] || Oct/03/2021 || 4/10 || O || . || O || . || O || . || . || O || . || . ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2017 Benelux Algorithm Programming Contest (BAPC 17)|BAPC 2017]] || Nov/03/2021 || 13/13 || O || Ø || Ø || O || Ø || O || Ø || Ø || Ø || Ø || O || O || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:NCPC 2017|NCPC 2017]] || Nov/06/2021 || 5/11 || . || O || . || Ø || Ø || . || O || . || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:NCPC 2016|NCPC 2016]] || Nov/07/2021 || 9/11 || O || O || O || O || O || O || O || Ø || . || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)|2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)]] || Nov/09/2021 || 8/13 || O || O || O || O || O || . || Ø || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021 icpc JiNan|2021 ACM-ICPC JiNan]] || Nov/14/2021 || 2/13 || . || . || . || . || . || . || . || . || . || O || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021 ICPC GuiLin|2021 ICPC GuiLin]] || Nov/15/2021 || 7/12 || O || . || . || Ø || O || Ø || O || . || O || . || Ø || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021 ICPC Shenyang|2021 ICPC Shenyang]] || Nov/21/2021 || 4/12 || . || O || . || . || O || O || . || . || . || O || . || . || Ø&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=269</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=269"/>
		<updated>2021-11-21T13:40:44Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Trainings */ add 2021 ICPC Shenyang&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:ACPC Kickoff 2021|ACPC Kickoff 2021]] || Sep/29/2021 || 12/12 || O || O || O || Ø || O || O || Ø || O || Ø || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2018牛客多校day3|2018牛客多校day3]] || Oct/03/2021 || 4/10 || O || . || O || . || O || . || . || O || . || . ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2017 Benelux Algorithm Programming Contest (BAPC 17)|BAPC 2017]] || Nov/03/2021 || 13/13 || O || Ø || Ø || O || Ø || O || Ø || Ø || Ø || Ø || O || O || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:NCPC 2017|NCPC 2017]] || Nov/06/2021 || 5/11 || . || O || . || Ø || Ø || . || O || . || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:NCPC 2016|NCPC 2016]] || Nov/07/2021 || 9/11 || O || O || O || O || O || O || O || Ø || . || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)|2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)]] || Nov/09/2021 || 8/13 || O || O || O || O || O || . || Ø || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021 icpc JiNan|2021 ACM-ICPC JiNan]] || Nov/14/2021 || 2/13 || . || . || . || . || . || . || . || . || . || O || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021 ICPC GuiLin|2021 ICPC GuiLin]] || Nov/15/2021 || 7/12 || O || . || . || Ø || O || Ø || O || . || O || . || Ø || .&lt;br /&gt;
|-&lt;br /&gt;
[[BreakFast:2021 ICPC Shenyang|2021 ICPC Shenyang]] || Nov/21/2021 || 4/12 || . || O || . || . || O || O || . || . || . || O || . || . || Ø&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2021_icpc_JiNan&amp;diff=268</id>
		<title>BreakFast:2021 icpc JiNan</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2021_icpc_JiNan&amp;diff=268"/>
		<updated>2021-11-15T13:56:44Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: 2021 济南 replay&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
lzw开场看B&lt;br /&gt;
&lt;br /&gt;
看到有人过K， 看K&lt;br /&gt;
&lt;br /&gt;
hr想了一会回了，lzw不会写，好久之后过掉&lt;br /&gt;
&lt;br /&gt;
看J，B，C， 一万年后hr给了个高斯做法&lt;br /&gt;
&lt;br /&gt;
lzw不信，还是实现了，然后又T又wa&lt;br /&gt;
&lt;br /&gt;
最后发现快读写错，AC， lzw手有问题&lt;br /&gt;
&lt;br /&gt;
还剩20分钟，搞什么众数，也没人想C&lt;br /&gt;
&lt;br /&gt;
比赛结束&lt;br /&gt;
&lt;br /&gt;
比赛怪，人也怪，2021赛季，第一场，寄&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2021_ICPC_GuiLin&amp;diff=267</id>
		<title>BreakFast:2021 ICPC GuiLin</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2021_ICPC_GuiLin&amp;diff=267"/>
		<updated>2021-11-15T13:53:19Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add replay&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
开局看A， 读懂题意后过掉，期间网络不稳定&lt;br /&gt;
&lt;br /&gt;
看ptsd，memset时用了int去memsetbool数组， tle， 三发过&lt;br /&gt;
&lt;br /&gt;
g讲完二分后实现， 过掉，实现时间较久&lt;br /&gt;
&lt;br /&gt;
D读完题后，开始各种贪，后来写了个暴力，卡掉了之前所有贪心， 提前写暴力&lt;br /&gt;
&lt;br /&gt;
接着开E， 很久才敢写， 实现后dij写错， 发现后过掉，奇怪优化，六发过掉&lt;br /&gt;
&lt;br /&gt;
继续死在d， 发现f可写，开始写f， 被cin卡常， 细节有点不清楚，最后没写完&lt;br /&gt;
&lt;br /&gt;
最后： D看完题解还是不知道为啥对， K是不容易证明的暴力，E被卡常，读浮点数不要用cin&lt;br /&gt;
&lt;br /&gt;
正经的xcpc，打成一坨💩&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=266</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=266"/>
		<updated>2021-11-15T13:43:54Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add 2021 jinan and guilin&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:ACPC Kickoff 2021|ACPC Kickoff 2021]] || Sep/29/2021 || 12/12 || O || O || O || Ø || O || O || Ø || O || Ø || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2018牛客多校day3|2018牛客多校day3]] || Oct/03/2021 || 4/10 || O || . || O || . || O || . || . || O || . || . ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2017 Benelux Algorithm Programming Contest (BAPC 17)|BAPC 2017]] || Nov/03/2021 || 13/13 || O || Ø || Ø || O || Ø || O || Ø || Ø || Ø || Ø || O || O || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:NCPC 2017|NCPC 2017]] || Nov/06/2021 || 5/11 || . || O || . || Ø || Ø || . || O || . || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:NCPC 2016|NCPC 2016]] || Nov/07/2021 || 9/11 || O || O || O || O || O || O || O || Ø || . || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)|2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)]] || Nov/09/2021 || 8/13 || O || O || O || O || O || . || Ø || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021 icpc JiNan|2021 ACM-ICPC JiNan]] || Nov/14/2021 || 2/13 || . || . || . || . || . || . || . || . || . || O || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021 ICPC GuiLin|2021 ICPC GuiLin]] || Nov/15/2021 || 7/12 || O || . || . || Ø || O || Ø || O || . || O || . || Ø || .&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2019-2020_ACM-ICPC_Pacific_Northwest_Regional_Contest_(Div._1)&amp;diff=265</id>
		<title>BreakFast:2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2019-2020_ACM-ICPC_Pacific_Northwest_Regional_Contest_(Div._1)&amp;diff=265"/>
		<updated>2021-11-09T13:02:44Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Replay */ add 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
开场hr再次读骗子题，诱导lz去写 B，写完了发现题意不对&lt;br /&gt;
&lt;br /&gt;
然后写了会D题，测一发没过样例，开始怀疑算法正确性（后面才发现lz写错了&lt;br /&gt;
&lt;br /&gt;
34min后终于找到真签到题E，一发 AC&lt;br /&gt;
&lt;br /&gt;
再顾D题，xj手摸发现按之前的算法能过，lz改代码后一发AC&lt;br /&gt;
&lt;br /&gt;
C最短路水题一发AC&lt;br /&gt;
&lt;br /&gt;
M题走迷宫，lz实现了一会，直接AC&lt;br /&gt;
&lt;br /&gt;
A题hr手糊了一个换根dp，xj自愿手模（虽然没手模全），lz一发AC&lt;br /&gt;
&lt;br /&gt;
I题经典SB一眼题（xj手模发现没有奇环&lt;br /&gt;
&lt;br /&gt;
回来再度卡B，xj口胡一个解法，但不太清楚复杂度，后来发现就是O(n)，lz三发AC&lt;br /&gt;
&lt;br /&gt;
L题上来找规律，找不出来，hr随便手模一下，发现每次只有两种决策，一开始分析错复杂度开始想卡常算法，后来发现复杂度又算错惹&lt;br /&gt;
&lt;br /&gt;
== 总结 ==&lt;br /&gt;
&lt;br /&gt;
hr开场不要再读骗子题啦啊！&lt;br /&gt;
&lt;br /&gt;
三个人要会复杂度分析&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2019-2020_ACM-ICPC_Pacific_Northwest_Regional_Contest_(Div._1)&amp;diff=264</id>
		<title>BreakFast:2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2019-2020_ACM-ICPC_Pacific_Northwest_Regional_Contest_(Div._1)&amp;diff=264"/>
		<updated>2021-11-09T13:01:10Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Replay */ add 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
开场hr再次读骗子题，诱导lz去写 B，写完了发现题意不对&lt;br /&gt;
&lt;br /&gt;
然后写了会D题，测一发没过样例，开始怀疑算法正确性（后面才发现lz写错了&lt;br /&gt;
&lt;br /&gt;
34min后终于找到真签到题E，一发 AC&lt;br /&gt;
&lt;br /&gt;
再顾D题，xj手摸发现按之前的算法能过，lz改代码后一发AC&lt;br /&gt;
&lt;br /&gt;
C最短路水题一发AC&lt;br /&gt;
&lt;br /&gt;
M题走迷宫，lz实现了一会，直接AC&lt;br /&gt;
&lt;br /&gt;
A题hr手糊了一个换根dp，xj自愿手模（虽然没手模全），lz一发AC&lt;br /&gt;
&lt;br /&gt;
I题经典SB一眼题（xj手模发现没有奇环&lt;br /&gt;
&lt;br /&gt;
回来再度卡B，xj口胡一个解法，但不太清楚复杂度，后来发现就是O(n)，lz三发AC&lt;br /&gt;
&lt;br /&gt;
L题上来找规律，找不出来，hr随便手模一下，发现每次只有两种决策，一开始分析错复杂度开始想卡常算法，后来发现复杂度又算错惹&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:NCPC_2016&amp;diff=263</id>
		<title>BreakFast:NCPC 2016</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:NCPC_2016&amp;diff=263"/>
		<updated>2021-11-09T12:45:35Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Replay */ add NCPC 2016&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
开场20min，靠lz先进的炒股经验通过 D 题&lt;br /&gt;
&lt;br /&gt;
之后瞬间过掉 J 题&lt;br /&gt;
&lt;br /&gt;
G 题小模拟因为大于小于号写反，改后 AC&lt;br /&gt;
&lt;br /&gt;
然后瞬间通过E题欧拉降幂SB题，这题出一万遍了吧QAQ&lt;br /&gt;
&lt;br /&gt;
F 题推了个柿子，再推推转移式，瞬间通过&lt;br /&gt;
&lt;br /&gt;
过会儿，想到反着进行操作，A题通过&lt;br /&gt;
&lt;br /&gt;
B题哈希二分小dp&lt;br /&gt;
&lt;br /&gt;
C题三个人不会LIS，卡半年，最后xj一语惊人，这不是SB lis模板题？？？&lt;br /&gt;
&lt;br /&gt;
K题是lz最爱的xjj，过了一会实现完毕一发AC（tql！！&lt;br /&gt;
&lt;br /&gt;
距比赛结束还剩29min&lt;br /&gt;
&lt;br /&gt;
xj读错H题，强烈谴责！！！！！（hr好像没有发现吧&lt;br /&gt;
&lt;br /&gt;
赛后蓝总写完一交，喜提一wa，hr去对拍，终于发现xj读错题，再次强烈谴责！！！&lt;br /&gt;
&lt;br /&gt;
== hrの总结 ==&lt;br /&gt;
&lt;br /&gt;
水题写的快（怎么都是模板题啊？&lt;br /&gt;
&lt;br /&gt;
xj，hr要提高读题的正确率啊&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2019-2020_ACM-ICPC_Pacific_Northwest_Regional_Contest_(Div._1)&amp;diff=262</id>
		<title>BreakFast:2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2019-2020_ACM-ICPC_Pacific_Northwest_Regional_Contest_(Div._1)&amp;diff=262"/>
		<updated>2021-11-09T12:30:00Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add template&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:NCPC_2016&amp;diff=261</id>
		<title>BreakFast:NCPC 2016</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:NCPC_2016&amp;diff=261"/>
		<updated>2021-11-09T12:29:48Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add template&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=260</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=260"/>
		<updated>2021-11-09T12:29:30Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:ACPC Kickoff 2021|ACPC Kickoff 2021]] || Sep/29/2021 || 12/12 || O || O || O || Ø || O || O || Ø || O || Ø || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2018牛客多校day3|2018牛客多校day3]] || Oct/03/2021 || 4/10 || O || . || O || . || O || . || . || O || . || . ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2017 Benelux Algorithm Programming Contest (BAPC 17)|BAPC 2017]] || Nov/03/2021 || 13/13 || O || Ø || Ø || O || Ø || O || Ø || Ø || Ø || Ø || O || O || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:NCPC 2017|NCPC 2017]] || Nov/06/2021 || 5/11 || . || O || . || Ø || Ø || . || O || . || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:NCPC 2016|NCPC 2016]] || Nov/07/2021 || 9/11 || O || O || O || O || O || O || O || Ø || . || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)|2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)]] || Nov/09/2021 || 8/13 || O || O || O || O || O || . || Ø || . || O || . || . || O || O&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=259</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=259"/>
		<updated>2021-11-09T12:29:17Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add 2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:ACPC Kickoff 2021|ACPC Kickoff 2021]] || Sep/29/2021 || 12/12 || O || O || O || Ø || O || O || Ø || O || Ø || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2018牛客多校day3|2018牛客多校day3]] || Oct/03/2021 || 4/10 || O || . || O || . || O || . || . || O || . || . ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2017 Benelux Algorithm Programming Contest (BAPC 17)|BAPC 2017]] || Nov/03/2021 || 13/13 || O || Ø || Ø || O || Ø || O || Ø || Ø || Ø || Ø || O || O || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:NCPC 2017|NCPC 2017]] || Nov/06/2021 || 5/11 || . || O || . || Ø || Ø || . || O || . || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:NCPC 2016|NCPC 2016]] || Nov/07/2021 || 9/11 || O || O || O || O || O || O || O || Ø || . || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)|2019-2020 ACM-ICPC Pacific Northwest Regional Contest (Div. 1) || Nov/09/2021 || 8/13 || O || O || O || O || O || . || Ø || . || O || . || . || O || O&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=258</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=258"/>
		<updated>2021-11-09T12:27:31Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add ncpc 2016&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:ACPC Kickoff 2021|ACPC Kickoff 2021]] || Sep/29/2021 || 12/12 || O || O || O || Ø || O || O || Ø || O || Ø || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2018牛客多校day3|2018牛客多校day3]] || Oct/03/2021 || 4/10 || O || . || O || . || O || . || . || O || . || . ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2017 Benelux Algorithm Programming Contest (BAPC 17)|BAPC 2017]] || Nov/03/2021 || 13/13 || O || Ø || Ø || O || Ø || O || Ø || Ø || Ø || Ø || O || O || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:NCPC 2017|NCPC 2017]] || Nov/06/2021 || 5/11 || . || O || . || Ø || Ø || . || O || . || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:NCPC 2016|NCPC 2016]] || Nov/07/2021 || 9/11 || O || O || O || O || O || O || O || Ø || . || O || O ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:NCPC_2017&amp;diff=257</id>
		<title>BreakFast:NCPC 2017</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:NCPC_2017&amp;diff=257"/>
		<updated>2021-11-06T10:18:24Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: update replay&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
5:15开 体测搞人&lt;br /&gt;
&lt;br /&gt;
17：25 找到签到J， 读了好久，读完后过&lt;br /&gt;
&lt;br /&gt;
17：50 wx读错题，lhr解释错题，lzw手摸样例，反推题意读错，重读题后，耗时25min，过&lt;br /&gt;
&lt;br /&gt;
18：35 lzw搞错了罚时的概念，lzw没听到解释&lt;br /&gt;
&lt;br /&gt;
19：29 I题WA1 路径记录有误&lt;br /&gt;
&lt;br /&gt;
19：35 lzw发现罚时时小的更优，改完后ac&lt;br /&gt;
&lt;br /&gt;
19：44 通过手捏样例，发现路径记录问题，改完后ac&lt;br /&gt;
&lt;br /&gt;
20：12 莽了一个贪心， WA掉了，通过两次二分+贪心过掉， hr一开始不让写&lt;br /&gt;
&lt;br /&gt;
21：35 D题交了一发随机，果然wa&lt;br /&gt;
&lt;br /&gt;
22：09 E题写了个错误模拟，然后发现是错的&lt;br /&gt;
&lt;br /&gt;
读完题 ！= 过题&lt;br /&gt;
&lt;br /&gt;
lhr和wx读完题后得和lzw稍微商量一下写法&lt;br /&gt;
&lt;br /&gt;
读题！读题！认真读题&lt;br /&gt;
&lt;br /&gt;
lhr要你来干什么的，不读题wx读题压力过大&lt;br /&gt;
&lt;br /&gt;
考虑一下数据的有序性影响， 对拍验证下&lt;br /&gt;
&lt;br /&gt;
心平气和，心平气和&lt;br /&gt;
&lt;br /&gt;
不要过于乱搞&lt;br /&gt;
&lt;br /&gt;
wx多看看lzw代码&lt;br /&gt;
&lt;br /&gt;
== Prolbelm A ==&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:NCPC_2017&amp;diff=256</id>
		<title>BreakFast:NCPC 2017</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:NCPC_2017&amp;diff=256"/>
		<updated>2021-11-06T10:11:53Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add ncpc  2017 replay&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
5:15开 体测搞人&lt;br /&gt;
&lt;br /&gt;
17：25 找到签到J， 读了好久，读完后过&lt;br /&gt;
&lt;br /&gt;
17：50 wx读错题，lhr解释错题，lzw手摸样例，反推题意读错，重读题后，耗时25min，过&lt;br /&gt;
&lt;br /&gt;
18：35 lzw搞错了罚时的概念，lzw没听到解释&lt;br /&gt;
&lt;br /&gt;
19：29 I题WA1 路径记录有误&lt;br /&gt;
&lt;br /&gt;
19：35 lzw发现罚时时小的更优，改完后ac&lt;br /&gt;
&lt;br /&gt;
19：44 通过手捏样例，发现路径记录问题，改完后ac&lt;br /&gt;
&lt;br /&gt;
20：12 莽了一个贪心， WA掉了，通过两次二分+贪心过掉， hr一开始不让写&lt;br /&gt;
&lt;br /&gt;
21：35 D题交了一发随机，果然wa&lt;br /&gt;
&lt;br /&gt;
22：09 E题写了个错误模拟，然后发现是错的&lt;br /&gt;
&lt;br /&gt;
== Prolbelm A ==&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:NCPC_2017&amp;diff=255</id>
		<title>BreakFast:NCPC 2017</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:NCPC_2017&amp;diff=255"/>
		<updated>2021-11-06T09:55:42Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add template&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
== Prolbelm A ==&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=254</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=254"/>
		<updated>2021-11-06T09:54:31Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add ncpc 2017&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:ACPC Kickoff 2021|ACPC Kickoff 2021]] || Sep/29/2021 || 12/12 || O || O || O || Ø || O || O || Ø || O || Ø || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2018牛客多校day3|2018牛客多校day3]] || Oct/03/2021 || 4/10 || O || . || O || . || O || . || . || O || . || . ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2017 Benelux Algorithm Programming Contest (BAPC 17)|BAPC 2017]] || Nov/03/2021 || 13/13 || O || Ø || Ø || O || Ø || O || Ø || Ø || Ø || Ø || O || O || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:NCPC 2017|NCPC 2017]] || Nov/06/2021 || 5/11 || . || O || . || Ø || Ø || . || O || . || O || O || O ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2017_Benelux_Algorithm_Programming_Contest_(BAPC_17)&amp;diff=253</id>
		<title>BreakFast:2017 Benelux Algorithm Programming Contest (BAPC 17)</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2017_Benelux_Algorithm_Programming_Contest_(BAPC_17)&amp;diff=253"/>
		<updated>2021-11-04T14:31:00Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add lzwの总结&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
lzw 迟到time++, 11:15开&lt;br /&gt;
&lt;br /&gt;
lzw开局看A, 直呼sb题,开始写&lt;br /&gt;
&lt;br /&gt;
hr和wx读完f后, 让lzw写,但lzw执着于a&lt;br /&gt;
&lt;br /&gt;
11:27 lzw迷途知返, 开始写F, 过了&lt;br /&gt;
&lt;br /&gt;
11:33 lzw回去写a, 过了&lt;br /&gt;
&lt;br /&gt;
lzw看了b题,直呼sb题,开始写&lt;br /&gt;
&lt;br /&gt;
13:15 一个小时后,lzw觉得b假了, 同时hr和wx读完了D, hr给lzw讲题意,lzw无法理解, 再写了一会b之后, 开始写d, 理解并写完后, 过了&lt;br /&gt;
&lt;br /&gt;
lzw写完了B, 开始疯狂WA, 同时lhr和wx开始想C, lzw发现b真的假了,然后想到了不太好写的写法&lt;br /&gt;
&lt;br /&gt;
14:14 wx提出未证明的暴力做法, lzw写了一发,T了, 就不再想这个暴力了(后续证明那就是正解,是lzw假了&lt;br /&gt;
&lt;br /&gt;
14:30 lhr读完L, 并觉得L好写, 此时, 我们卡了C, L, M, B, 四线卡题, L实现完后, 处理溢出的方法是错误的&lt;br /&gt;
&lt;br /&gt;
Wa了几发后,放弃, 开始写M, 提完做法后感觉很对, 写了个线段树优化dp, 过了,振奋人心 时隔2h多 第一次过题&lt;br /&gt;
&lt;br /&gt;
接着L取log2实现了一遍,过了 振奋人心&lt;br /&gt;
&lt;br /&gt;
lhr口胡K题, 实现后AC, 振奋人心&lt;br /&gt;
&lt;br /&gt;
此时距离比赛结束20min&lt;br /&gt;
&lt;br /&gt;
lhr和wx开始讨论乱搞I, lzw写B&lt;br /&gt;
&lt;br /&gt;
比赛结束&lt;br /&gt;
&lt;br /&gt;
== Problem A ==&lt;br /&gt;
&lt;br /&gt;
== lzwの总结 ==&lt;br /&gt;
&lt;br /&gt;
还是该从简单题开始做, lzw太容易对计几兴奋了, lhr要压制lzw&lt;br /&gt;
&lt;br /&gt;
暴力也要认真写, 万一过了呢&lt;br /&gt;
&lt;br /&gt;
时间最宝贵,快写能写的, 跟榜&lt;br /&gt;
&lt;br /&gt;
I题太着急,不然写dp&lt;br /&gt;
&lt;br /&gt;
B题学到个伸缩变换控制精度, 赛后AC&lt;br /&gt;
&lt;br /&gt;
想清楚再交, 有必要给wx看看&lt;br /&gt;
&lt;br /&gt;
可做题不一定立即做, 标记上&lt;br /&gt;
&lt;br /&gt;
注意时间 注意时间 &lt;br /&gt;
&lt;br /&gt;
E题正难则反, g题全局考虑 h欧拉公式 j题讨论&lt;br /&gt;
&lt;br /&gt;
lzw得跟榜,注意写题时间&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2017_Benelux_Algorithm_Programming_Contest_(BAPC_17)&amp;diff=252</id>
		<title>BreakFast:2017 Benelux Algorithm Programming Contest (BAPC 17)</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2017_Benelux_Algorithm_Programming_Contest_(BAPC_17)&amp;diff=252"/>
		<updated>2021-11-04T14:20:49Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add replay&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
lzw 迟到time++, 11:15开&lt;br /&gt;
&lt;br /&gt;
lzw开局看A, 直呼sb题,开始写&lt;br /&gt;
&lt;br /&gt;
hr和wx读完f后, 让lzw写,但lzw执着于a&lt;br /&gt;
&lt;br /&gt;
11:27 lzw迷途知返, 开始写F, 过了&lt;br /&gt;
&lt;br /&gt;
11:33 lzw回去写a, 过了&lt;br /&gt;
&lt;br /&gt;
lzw看了b题,直呼sb题,开始写&lt;br /&gt;
&lt;br /&gt;
13:15 一个小时后,lzw觉得b假了, 同时hr和wx读完了D, hr给lzw讲题意,lzw无法理解, 再写了一会b之后, 开始写d, 理解并写完后, 过了&lt;br /&gt;
&lt;br /&gt;
lzw写完了B, 开始疯狂WA, 同时lhr和wx开始想C, lzw发现b真的假了,然后想到了不太好写的写法&lt;br /&gt;
&lt;br /&gt;
14:14 wx提出未证明的暴力做法, lzw写了一发,T了, 就不再想这个暴力了(后续证明那就是正解,是lzw假了&lt;br /&gt;
&lt;br /&gt;
14:30 lhr读完L, 并觉得L好写, 此时, 我们卡了C, L, M, B, 四线卡题, L实现完后, 处理溢出的方法是错误的&lt;br /&gt;
&lt;br /&gt;
Wa了几发后,放弃, 开始写M, 提完做法后感觉很对, 写了个线段树优化dp, 过了,振奋人心 时隔2h多 第一次过题&lt;br /&gt;
&lt;br /&gt;
接着L取log2实现了一遍,过了 振奋人心&lt;br /&gt;
&lt;br /&gt;
lhr口胡K题, 实现后AC, 振奋人心&lt;br /&gt;
&lt;br /&gt;
此时距离比赛结束20min&lt;br /&gt;
&lt;br /&gt;
lhr和wx开始讨论乱搞I, lzw写B&lt;br /&gt;
&lt;br /&gt;
比赛结束&lt;br /&gt;
&lt;br /&gt;
== Problem A ==&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=251</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=251"/>
		<updated>2021-11-04T14:07:20Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Trainings */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:ACPC Kickoff 2021|ACPC Kickoff 2021]] || Sep/29/2021 || 12/12 || O || O || O || Ø || O || O || Ø || O || Ø || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2018牛客多校day3|2018牛客多校day3]] || Oct/03/2021 || 4/10 || O || . || O || . || O || . || . || O || . || . ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2017 Benelux Algorithm Programming Contest (BAPC 17)|BAPC 2017]] || Nov/03/2021 || 13/13 || O || Ø || Ø || O || Ø || O || Ø || Ø || Ø || Ø || O || O || O&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=250</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=250"/>
		<updated>2021-11-04T14:07:08Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Trainings */ add data in bapc 2017&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:ACPC Kickoff 2021|ACPC Kickoff 2021]] || Sep/29/2021 || 12/12 || O || O || O || Ø || O || O || Ø || O || Ø || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2018牛客多校day3|2018牛客多校day3]] || Oct/03/2021 || 4/10 || O || . || O || . || O || . || . || O || . || . ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2017 Benelux Algorithm Programming Contest (BAPC 17)|BAPC 2017]] || Nov/03/2021 || 13/13 || O || Ø || Ø || O || Ø || O || Ø || Ø || Ø || Ø || O || O || O ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2017_Benelux_Algorithm_Programming_Contest_(BAPC_17)&amp;diff=249</id>
		<title>BreakFast:2017 Benelux Algorithm Programming Contest (BAPC 17)</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2017_Benelux_Algorithm_Programming_Contest_(BAPC_17)&amp;diff=249"/>
		<updated>2021-11-04T14:04:31Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add template&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Problem A ==&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=248</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=248"/>
		<updated>2021-11-04T14:03:25Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Trainings */  add bcpc 2017&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:ACPC Kickoff 2021|ACPC Kickoff 2021]] || Sep/29/2021 || 12/12 || O || O || O || Ø || O || O || Ø || O || Ø || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2018牛客多校day3|2018牛客多校day3]] || Oct/03/2021 || 4/10 || O || . || O || . || O || . || . || O || . || . ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2017 Benelux Algorithm Programming Contest (BAPC 17)|BAPC 2017]] || 13/13 || O || Ø || Ø || O || Ø || O || Ø || Ø || Ø || Ø || O || O || O ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2018%E7%89%9B%E5%AE%A2%E5%A4%9A%E6%A0%A1day3&amp;diff=247</id>
		<title>BreakFast:2018牛客多校day3</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2018%E7%89%9B%E5%AE%A2%E5%A4%9A%E6%A0%A1day3&amp;diff=247"/>
		<updated>2021-10-03T09:41:51Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add nowcoder day3 replay&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
00:30 开局wx H一发过&lt;br /&gt;
&lt;br /&gt;
02:08 A题压位后过了&lt;br /&gt;
&lt;br /&gt;
04:47 E题循环节后过&lt;br /&gt;
&lt;br /&gt;
04:53 C题一发过&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=246</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=246"/>
		<updated>2021-10-03T09:34:34Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add nowcoder 2018 day3&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:ACPC Kickoff 2021|ACPC Kickoff 2021]] || Sep/29/2021 || 12/12 || O || O || O || Ø || O || O || Ø || O || Ø || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2018牛客多校day3|2018牛客多校day3]] || Oct/03/2021 || 4/10 || O || . || O || . || O || . || . || O || . || . ||&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:ACPC_Kickoff_2021&amp;diff=245</id>
		<title>BreakFast:ACPC Kickoff 2021</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:ACPC_Kickoff_2021&amp;diff=245"/>
		<updated>2021-09-29T14:32:17Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Replay */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Replay ==&lt;br /&gt;
&lt;br /&gt;
开局发现是文件读入&lt;br /&gt;
&lt;br /&gt;
J题，傻逼题直接秒&lt;br /&gt;
&lt;br /&gt;
A题读题耽误了会，读懂了就又秒了&lt;br /&gt;
&lt;br /&gt;
L题读完直接秒&lt;br /&gt;
&lt;br /&gt;
K题lz上了个厕所，回来后直接秒&lt;br /&gt;
&lt;br /&gt;
H题读题读了一万年，有手误WA了一发，发现了就秒了&lt;br /&gt;
&lt;br /&gt;
此时，赛时过去一个小时&lt;br /&gt;
&lt;br /&gt;
C题hr纠结了什么叫公用一条边，没管他，直接秒掉了&lt;br /&gt;
&lt;br /&gt;
中途把L的代码交到I题去了,又交了一发，又因为没用bitset优化T掉了&lt;br /&gt;
&lt;br /&gt;
就去看B了，一开始想错了，纠正后，lz分不清三角函数，又手误了WA了一发，改完就过了&lt;br /&gt;
&lt;br /&gt;
F题一开始没读懂，然后强行又读了一遍，发现是傻逼题直接秒了&lt;br /&gt;
&lt;br /&gt;
然后写了E题，hr提出了暴力解法，lz极不情愿写完了，一直WA，后来发现lz漏判了一个case，改掉之后lz非常震惊，居然过了&lt;br /&gt;
&lt;br /&gt;
然后又强行优化了一下I题，然后T了，比赛结束&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
然后到了激动人心的补题环节&lt;br /&gt;
下了个题解视频&lt;br /&gt;
&lt;br /&gt;
发现I题可以用bitset优化&lt;br /&gt;
&lt;br /&gt;
D题是个奇怪的暴力&lt;br /&gt;
&lt;br /&gt;
G题最后可以转换成Nim&lt;br /&gt;
&lt;br /&gt;
然后就AK啦！！！！！！！！完结撒花&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:ACPC_Kickoff_2021&amp;diff=244</id>
		<title>BreakFast:ACPC Kickoff 2021</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:ACPC_Kickoff_2021&amp;diff=244"/>
		<updated>2021-09-29T13:26:14Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: create ACPC Kickoff 2021&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Replay ==&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=243</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=243"/>
		<updated>2021-09-29T13:25:38Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Trainings */ fix acpc&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:ACPC Kickoff 2021|ACPC Kickoff 2021]] || Sep/29/2021 || 12/12 || O || O || O || Ø || O || O || Ø || O || Ø || O || O || O ||&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=242</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=242"/>
		<updated>2021-09-29T13:25:02Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Trainings */ add ACPC Kickoff 2021&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:ACPC Kickoff 2021|ACPC Kickoff 2021]] || Sep/29/2021 || 12/12 || O || O || O || Ø || O || O || Ø || O || Ø || O || O || O || O || O&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2021-2022_ICPC%E7%BD%91%E7%BB%9C%E8%B5%9Btwo&amp;diff=241</id>
		<title>BreakFast:2021-2022 ICPC网络赛two</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2021-2022_ICPC%E7%BD%91%E7%BB%9C%E8%B5%9Btwo&amp;diff=241"/>
		<updated>2021-09-26T13:58:40Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay == &lt;br /&gt;
&lt;br /&gt;
一开始读G题，极限不会&lt;br /&gt;
&lt;br /&gt;
待有人过M题时，转头去读 M，想了一段时间，发现可以形成连续的区间，从高到低位扫一遍逐一确定，但因为忘记符号位，喜提WA，改后AC&lt;br /&gt;
&lt;br /&gt;
然后继续想极限，lz抽空去看了J题，之后开始写J,一发AC&lt;br /&gt;
&lt;br /&gt;
然后再继续想极限，推了一堆奇怪的东西，与hr的尝试相悖（期间还妄想拿本高数书现学，洛必达起来还极其麻烦，走投无路之下手推了 ln(1+x) 的泰勒展开，又因为一些逻辑有问题，WA++。改后AC&lt;br /&gt;
&lt;br /&gt;
接下来陷入L题一万年，hr迅速口胡出一个错误想法，带着lz和wx走上歧路，写了半天，修了修细节，诶，样例过不去！！！lz指出状态之间有交叉，是没法维护的&lt;br /&gt;
&lt;br /&gt;
xj读完A题后跟hr讲了讲，hr觉得挺对，因为时间复杂度分析失误，迟迟没有让lz去写&lt;br /&gt;
&lt;br /&gt;
后来跟lz讲了一下，lz：“你们在说怪话！！”&lt;br /&gt;
&lt;br /&gt;
于是lz迅速实现完A题，又get一个WA，比赛结束...&lt;br /&gt;
&lt;br /&gt;
赛后光速补完A和L，喜提最快补题奖两枚。&lt;br /&gt;
&lt;br /&gt;
== Soltion == &lt;br /&gt;
&lt;br /&gt;
== 戳[https://pintia.cn/market/item/1442013218528759808 我]进入比赛 ==&lt;br /&gt;
&lt;br /&gt;
以下代码并非赛时AC代码, AC代码较为美观&lt;br /&gt;
&lt;br /&gt;
=== Problem A. Sort ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;T&amp;lt;/math&amp;gt; 组，每组给出一个长度为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 的序列 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 和 整数 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
定义一次操作为将序列 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 分割成 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;v_i&amp;lt;/math&amp;gt; 段，再对段做置换 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;p_i&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
若在有限次数操作中，无法使得序列 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 变成非降序，则输出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;-2&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
若在有限次数操作中，可以使得序列 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 变成非降序，且 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\sum{v_i} \leq 3n&amp;lt;/math&amp;gt;，则输出方案，否则输出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;-1&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq T \leq 10^3, 1 \leq k,n \leq 10^3,1 \leq a[i] \leq 10^9, \sum{n} \leq 3\times 10^4&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
不难发现，当 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k \geq 3&amp;lt;/math&amp;gt; 时，总可以构造出合法方案，就是一傻逼模拟题（被细节搞炸&lt;br /&gt;
&lt;br /&gt;
当 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k=2&amp;lt;/math&amp;gt; 时，注意这个样例&lt;br /&gt;
&lt;br /&gt;
&amp;lt;blockquote&amp;gt;2&amp;lt;br /&amp;gt;&lt;br /&gt;
3 2&amp;lt;br /&amp;gt;&lt;br /&gt;
1 2 1&amp;lt;br /&amp;gt;&lt;br /&gt;
2 1 2&lt;br /&gt;
&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)1e3;&lt;br /&gt;
&lt;br /&gt;
int n, k;&lt;br /&gt;
int a[M + 5];&lt;br /&gt;
int b[M + 5];&lt;br /&gt;
&lt;br /&gt;
bool is_sort(int p)&lt;br /&gt;
{&lt;br /&gt;
    for(int i = 1; i &amp;lt; n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        if(a[(i + p - 2) % n + 1] &amp;gt; a[(i + p - 1) % n + 1]) return 0;&lt;br /&gt;
    }&lt;br /&gt;
    return 1;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;n, &amp;amp;k);&lt;br /&gt;
    for(int i = 1; i &amp;lt;= n; ++i) scanf(&amp;quot;%d&amp;quot;, &amp;amp;a[i]);&lt;br /&gt;
    if(n == 1) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
    else if(k == 1)&lt;br /&gt;
    {&lt;br /&gt;
        if(is_sort(1)) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
        else           printf(&amp;quot;-2\n&amp;quot;);&lt;br /&gt;
    }&lt;br /&gt;
    else if(k == 2)&lt;br /&gt;
    {&lt;br /&gt;
        if(is_sort(1)) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
        else&lt;br /&gt;
        {&lt;br /&gt;
            for(int i = 1; i &amp;lt;= n; ++i)&lt;br /&gt;
            {&lt;br /&gt;
                if(is_sort(i))&lt;br /&gt;
                {&lt;br /&gt;
                    printf(&amp;quot;1\n&amp;quot;);&lt;br /&gt;
                    printf(&amp;quot;2\n&amp;quot;);&lt;br /&gt;
                    printf(&amp;quot;%d %d %d\n&amp;quot;, 0, i - 1, n);&lt;br /&gt;
                    printf(&amp;quot;2 1\n&amp;quot;);&lt;br /&gt;
                    for(int j = 1; j &amp;lt;= n; ++j) b[j] = a[j];&lt;br /&gt;
                    for(int j = 1; j &amp;lt;= n - i + 1; ++j) a[j] = b[j - 1 + i];&lt;br /&gt;
                    for(int j = n - i + 2; j &amp;lt;= n; ++j) a[j] = b[j - n + i - 1];&lt;br /&gt;
                    return;&lt;br /&gt;
                }&lt;br /&gt;
            }&lt;br /&gt;
            printf(&amp;quot;-2\n&amp;quot;);&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    else if(k &amp;gt;= 3)&lt;br /&gt;
    {&lt;br /&gt;
        printf(&amp;quot;%d\n&amp;quot;, n - 1);&lt;br /&gt;
        for(int i = 1; i &amp;lt; n; ++i)&lt;br /&gt;
        {&lt;br /&gt;
            int p = i; for(int j = i; j &amp;lt;= n; ++j) if(a[p] &amp;gt; a[j]) p = j;&lt;br /&gt;
            if(i == p)&lt;br /&gt;
            {&lt;br /&gt;
                printf(&amp;quot;2\n&amp;quot;);&lt;br /&gt;
                printf(&amp;quot;%d %d %d\n&amp;quot;, 0, 1, n);&lt;br /&gt;
                printf(&amp;quot;1 2\n&amp;quot;);&lt;br /&gt;
            }&lt;br /&gt;
            else if(i == 1)&lt;br /&gt;
            {&lt;br /&gt;
                printf(&amp;quot;2\n&amp;quot;);&lt;br /&gt;
                printf(&amp;quot;%d %d %d\n&amp;quot;, 0, p - 1, n);&lt;br /&gt;
                printf(&amp;quot;2 1\n&amp;quot;);&lt;br /&gt;
                for(int j = 1; j &amp;lt;= n; ++j) b[j] = a[j];&lt;br /&gt;
                for(int j = 1; j &amp;lt;= n - p + 1; ++j) a[j] = b[j + p - 1];&lt;br /&gt;
                for(int j = n - p + 2; j &amp;lt;= n; ++j) a[j] = b[j - n + p - 1];&lt;br /&gt;
            }&lt;br /&gt;
            else&lt;br /&gt;
            {&lt;br /&gt;
                printf(&amp;quot;3\n&amp;quot;);&lt;br /&gt;
                printf(&amp;quot;%d %d %d %d\n&amp;quot;, 0, i - 1, p - 1, n);&lt;br /&gt;
                printf(&amp;quot;1 3 2\n&amp;quot;);&lt;br /&gt;
                for(int j = 1; j &amp;lt;= n; ++j) b[j] = a[j];&lt;br /&gt;
                for(int j = 1; j &amp;lt;= i - 1; ++j) a[j] = b[j];&lt;br /&gt;
                for(int j = i; j &amp;lt;= i + n - p; ++j) a[j] = b[j - i + p];&lt;br /&gt;
                for(int j = i + n - p + 1; j &amp;lt;= n; ++j) a[j] = b[j - n + p - 1];&lt;br /&gt;
            }&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    int T; scanf(&amp;quot;%d&amp;quot;, &amp;amp;T);&lt;br /&gt;
    for(int ca = 1; ca &amp;lt;= T; ++ca)&lt;br /&gt;
    {&lt;br /&gt;
        work();&lt;br /&gt;
    }&lt;br /&gt;
    return 0;&lt;br /&gt;
}&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem G.  Limit ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
给出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n, a_i, b_i, t&amp;lt;/math&amp;gt;，求 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\lim\limits_{x \rightarrow 0}{\frac{\sum_{i=1}^n{a_i ln(1+b_ix)}}{x^t}}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq n \leq 10^5, -100 \leq a, b \leq 100, 0 \leq t \leq 5&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
神他喵抓大头，直接无脑泰勒展开（赛时还想多项式卷积&lt;br /&gt;
&lt;br /&gt;
'''结论：三个人都不会高数'''&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
typedef long long ll;&lt;br /&gt;
&lt;br /&gt;
int n, t;&lt;br /&gt;
ll c[10];&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;n, &amp;amp;t);&lt;br /&gt;
    for(int i = 1, a, b; i &amp;lt;= n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;a, &amp;amp;b);&lt;br /&gt;
        ll cur = a;&lt;br /&gt;
        for(int j = 1; j &amp;lt;= t; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            cur *= b;&lt;br /&gt;
            c[j] += ((j&amp;amp;1) ? cur : -cur);&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    if(!t) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
    else&lt;br /&gt;
    {&lt;br /&gt;
        for(int i = 1; i &amp;lt; t; ++i)&lt;br /&gt;
        {&lt;br /&gt;
            if(c[i])&lt;br /&gt;
            {&lt;br /&gt;
                printf(&amp;quot;infinity\n&amp;quot;);&lt;br /&gt;
                return;&lt;br /&gt;
            }&lt;br /&gt;
        }&lt;br /&gt;
        if(c[t] == 0) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
        else&lt;br /&gt;
        {&lt;br /&gt;
            ll d = (ll)abs(__gcd(1ll * t, c[t]));&lt;br /&gt;
            ll up = c[t] / d, dn = t / d;&lt;br /&gt;
            if(dn == 1) printf(&amp;quot;%lld\n&amp;quot;, up);&lt;br /&gt;
            else       printf(&amp;quot;%lld/%d\n&amp;quot;, up, dn);&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem H.  Set ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
定义集合 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;S=\{1,2, \cdots, 256\}&amp;lt;/math&amp;gt;，给出两个整数 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k&amp;lt;/math&amp;gt; 和 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;r&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
要求构造集合 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;S&amp;lt;/math&amp;gt; 的 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k&amp;lt;/math&amp;gt; 个子集 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;I_i&amp;lt;/math&amp;gt;，要求对任意的 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq i_1 &amp;lt; i_2 &amp;lt; \cdots &amp;lt; i_r \leq n&amp;lt;/math&amp;gt; 满足 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;|\bigcup_{j=1}^{r}{I_{i_j}}| \geq 128&amp;lt;/math&amp;gt;，且 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;max\{|I_i|\} \leq \lceil \frac{512}{r} \rceil&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;3 \leq r \leq k \leq 26&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
直接 rand 所有子集就行了...&lt;br /&gt;
&lt;br /&gt;
证明以后再补（咕咕咕&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
int Rand(int l, int r)&lt;br /&gt;
{&lt;br /&gt;
    return rand() % (r - l + 1) + l;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    int k, r; scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;k, &amp;amp;r);&lt;br /&gt;
    for(int i = 1; i &amp;lt;= k; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        set&amp;lt;int&amp;gt; st;&lt;br /&gt;
        while((int)st.size() &amp;lt; (512 + r - 1) / r) st.insert(Rand(1, 256));&lt;br /&gt;
        for(int j = 1; j &amp;lt;= 256; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            printf(&amp;quot;%d&amp;quot;, st.count(j));&lt;br /&gt;
        }&lt;br /&gt;
        printf(&amp;quot;\n&amp;quot;);&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    srand(time(NULL));&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem J. Leaking Roof ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
给一个 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n \times n&amp;lt;/math&amp;gt; 的矩阵 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;h_{ij}&amp;lt;/math&amp;gt; 表示 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;(i,j)&amp;lt;/math&amp;gt; 的高度.&lt;br /&gt;
&lt;br /&gt;
现在每个单元都下了 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;m&amp;lt;/math&amp;gt; 单位的雨水，&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;(i,j)&amp;lt;/math&amp;gt; 的雨水会平均地流向四周高度比它低的单元.&lt;br /&gt;
&lt;br /&gt;
若高度为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;0&amp;lt;/math&amp;gt; 的点有雨水，则这个点会漏水.&lt;br /&gt;
&lt;br /&gt;
求足够长时间后，每个点的漏水量.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq n \leq 500, 0 \leq m,h_{ij} \leq 10^4&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
按照高度依次处理雨水的流动，模拟就行了.&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)5e2;&lt;br /&gt;
&lt;br /&gt;
int n, m;&lt;br /&gt;
int h[M + 5][M + 5];&lt;br /&gt;
int id[M * M + 5];&lt;br /&gt;
double a[M + 5][M + 5];&lt;br /&gt;
int dx[] = {0, 0, 1, -1};&lt;br /&gt;
int dy[] = {1, -1, 0, 0};&lt;br /&gt;
&lt;br /&gt;
bool cmp(int a, int b)&lt;br /&gt;
{&lt;br /&gt;
    return h[a / n][a % n] &amp;gt; h[b / n][b % n];&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;n, &amp;amp;m);&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        for(int j = 0; j &amp;lt; n; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            id[i * n + j] = i * n + j;&lt;br /&gt;
            scanf(&amp;quot;%d&amp;quot;, &amp;amp;h[i][j]);&lt;br /&gt;
            a[i][j] = 1.0 * m;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    sort(id, id + n * n, cmp);&lt;br /&gt;
    for(int i = 0; i &amp;lt; n * n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        int x = id[i] / n, y = id[i] % n, c = 0;&lt;br /&gt;
        for(int j = 0; j &amp;lt; 4; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            int xx = x + dx[j], yy = y + dy[j];&lt;br /&gt;
            if(xx &amp;gt;= 0 &amp;amp;&amp;amp; xx &amp;lt; n &amp;amp;&amp;amp; yy &amp;gt;= 0 &amp;amp;&amp;amp; yy &amp;lt; n &amp;amp;&amp;amp; h[xx][yy] &amp;lt; h[x][y]) ++c;&lt;br /&gt;
        }&lt;br /&gt;
        if(c)&lt;br /&gt;
        {&lt;br /&gt;
            for(int j = 0; j &amp;lt; 4; ++j)&lt;br /&gt;
            {&lt;br /&gt;
                int xx = x + dx[j], yy = y + dy[j];&lt;br /&gt;
                if(xx &amp;gt;= 0 &amp;amp;&amp;amp; xx &amp;lt; n &amp;amp;&amp;amp; yy &amp;gt;= 0 &amp;amp;&amp;amp; yy &amp;lt; n &amp;amp;&amp;amp; h[xx][yy] &amp;lt; h[x][y]) a[xx][yy] += a[x][y] / c;&lt;br /&gt;
            }&lt;br /&gt;
            a[x][y] = 0;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) for(int j = 0; j &amp;lt; n; ++j) printf(&amp;quot;%.9f%c&amp;quot;, h[i][j] ? 0 : a[i][j], j == n - 1 ? '\n' : ' ');&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem K.  Meal ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
有 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 个人，&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 道菜，第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;i&amp;lt;/math&amp;gt; 个人对第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;j&amp;lt;/math&amp;gt; 道菜的好感度为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a_{ij}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
初始，集合 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;S = \{1,2,\cdots ,n\}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 个人按照序号轮流点菜，对于第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;i&amp;lt;/math&amp;gt; 个人，他点到第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;j&amp;lt;/math&amp;gt; 道菜的概率为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\frac{a_{ij}}{\sum_{k \in S}{a_{ik}}}&amp;lt;/math&amp;gt;，然后把 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;j&amp;lt;/math&amp;gt; 从 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;S&amp;lt;/math&amp;gt; 中删除.&lt;br /&gt;
&lt;br /&gt;
求第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;i&amp;lt;/math&amp;gt; 个人点到第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;j&amp;lt;/math&amp;gt; 道菜的概率.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq n \leq 20, 1 \leq a_{ij} \leq 100&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
状压DP模板题~&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
typedef long long ll;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)20;&lt;br /&gt;
const ll mod = (ll)998244353;&lt;br /&gt;
&lt;br /&gt;
int n, a[M][M];&lt;br /&gt;
int f[1&amp;lt;&amp;lt;M];&lt;br /&gt;
int s[1&amp;lt;&amp;lt;M];&lt;br /&gt;
int p[M][M];&lt;br /&gt;
&lt;br /&gt;
ll quick(ll a, ll b, ll p = mod)&lt;br /&gt;
{&lt;br /&gt;
    ll s = 1;&lt;br /&gt;
    while(b)&lt;br /&gt;
    {&lt;br /&gt;
        if(b &amp;amp; 1) s = s * a % p;&lt;br /&gt;
        a = a * a % p;&lt;br /&gt;
        b &amp;gt;&amp;gt;= 1;&lt;br /&gt;
    }&lt;br /&gt;
    return s % p;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
ll inv(ll n, ll p = mod)&lt;br /&gt;
{&lt;br /&gt;
    return quick(n, p - 2, p);&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d&amp;quot;, &amp;amp;n);&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) for(int j = 0; j &amp;lt; n; ++j) scanf(&amp;quot;%d&amp;quot;, &amp;amp;a[i][j]);&lt;br /&gt;
    for(int i = 0; i &amp;lt; (1&amp;lt;&amp;lt;n); ++i)&lt;br /&gt;
    {&lt;br /&gt;
        int c = __builtin_popcount(i);&lt;br /&gt;
        for(int j = 0; j &amp;lt; n; ++j) if(!(i&amp;gt;&amp;gt;j&amp;amp;1)) s[i] += a[c][j];&lt;br /&gt;
        s[i] = inv(s[i]);&lt;br /&gt;
    }&lt;br /&gt;
    f[0] = 1;&lt;br /&gt;
    for(int i = 1; i &amp;lt; (1&amp;lt;&amp;lt;n); ++i)&lt;br /&gt;
    {&lt;br /&gt;
        int c = __builtin_popcount(i) - 1;&lt;br /&gt;
        for(int j = 0; j &amp;lt; n; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            if(!(i&amp;gt;&amp;gt;j&amp;amp;1)) continue;&lt;br /&gt;
            (p[c][j] += 1ll * f[i^(1&amp;lt;&amp;lt;j)] * a[c][j] % mod * s[i^(1&amp;lt;&amp;lt;j)] % mod) %= mod;&lt;br /&gt;
            (f[i] += 1ll * f[i^(1&amp;lt;&amp;lt;j)] * a[c][j] % mod * s[i^(1&amp;lt;&amp;lt;j)] % mod) %= mod;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) for(int j = 0; j &amp;lt; n; ++j) printf(&amp;quot;%d%c&amp;quot;, p[i][j], j == n - 1 ? '\n' : ' ');&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem L. Euler Function ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 个数 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 和 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;m&amp;lt;/math&amp;gt; 次操作.&lt;br /&gt;
&lt;br /&gt;
操作分为两种&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;0 \; l \; r \; w&amp;lt;/math&amp;gt; 表示 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[i] *= w \quad i \in [l, r]&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \; l \; r&amp;lt;/math&amp;gt; 表示查询 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\sum_{i=l}^{r}{\varphi(a[i])}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq n,m \leq 10^5, 1 \leq a_i,w \leq 100, 1 \leq l \leq r \leq n&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
势能线段树（之前见过，但这是第一次知道还有这个名字&lt;br /&gt;
&lt;br /&gt;
改了改线段树的码风&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
typedef long long ll;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)1e5;&lt;br /&gt;
const int N = (int)1e2;&lt;br /&gt;
const ll mod = (ll)998244353;&lt;br /&gt;
&lt;br /&gt;
bool is_prime[N + 5];&lt;br /&gt;
int prime[N + 5], cnt;&lt;br /&gt;
int pw[N + 5][M + 5];&lt;br /&gt;
&lt;br /&gt;
void init()&lt;br /&gt;
{&lt;br /&gt;
    memset(is_prime, 1, sizeof(is_prime));&lt;br /&gt;
    cnt = is_prime[0] = is_prime[1] = 0;&lt;br /&gt;
    for(int i = 2; i &amp;lt;= N; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        if(is_prime[i]) prime[++cnt] = i;&lt;br /&gt;
        for(int j = 1; j &amp;lt;= cnt &amp;amp;&amp;amp; i * prime[j] &amp;lt;= N; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            is_prime[i * prime[j]] = 0;&lt;br /&gt;
            if(i % prime[j] == 0) break;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    for(int i = 1; i &amp;lt;= cnt; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        pw[i][0] = 1; for(int j = 1; j &amp;lt;= M; ++j) pw[i][j] = 1ll * pw[i][j - 1] * prime[i] % mod;&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int n, m;&lt;br /&gt;
struct tnode&lt;br /&gt;
{&lt;br /&gt;
    int s[M * 4 + 5], lz[M * 4 + 5][26]; bool is[M * 4 + 5][26];&lt;br /&gt;
&lt;br /&gt;
    inline int lc(int k) {return k&amp;lt;&amp;lt;1;}&lt;br /&gt;
    inline int rc(int k) {return k&amp;lt;&amp;lt;1|1;}&lt;br /&gt;
&lt;br /&gt;
    inline void push_up(int k)&lt;br /&gt;
    {&lt;br /&gt;
        int l = lc(k), r = rc(k);&lt;br /&gt;
        s[k] = (s[l] + s[r]) % mod;&lt;br /&gt;
        for(int i = 1; i &amp;lt;= cnt; ++i) is[k][i] = (is[l][i]&amp;amp;is[r][i]);&lt;br /&gt;
    }&lt;br /&gt;
&lt;br /&gt;
    inline void push_down(int k)&lt;br /&gt;
    {&lt;br /&gt;
        int l = lc(k), r = rc(k);&lt;br /&gt;
        for(int i = 1; i &amp;lt;= cnt; ++i)&lt;br /&gt;
        {&lt;br /&gt;
            if(!lz[k][i]) continue;&lt;br /&gt;
            s[l] = 1ll * s[l] * pw[i][lz[k][i]] % mod, lz[l][i] += lz[k][i];&lt;br /&gt;
            s[r] = 1ll * s[r] * pw[i][lz[k][i]] % mod, lz[r][i] += lz[k][i];&lt;br /&gt;
            lz[k][i] = 0;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
&lt;br /&gt;
    void build(int k, int l, int r)&lt;br /&gt;
    {&lt;br /&gt;
        if(l == r)&lt;br /&gt;
        {&lt;br /&gt;
            int x; scanf(&amp;quot;%d&amp;quot;, &amp;amp;x);&lt;br /&gt;
            s[k] = x;&lt;br /&gt;
            for(int i = 1; i &amp;lt;= cnt &amp;amp;&amp;amp; prime[i] * prime[i] &amp;lt;= x; ++i)&lt;br /&gt;
            {&lt;br /&gt;
                if(x % prime[i] == 0)&lt;br /&gt;
                {&lt;br /&gt;
                    s[k] = s[k] / prime[i] * (prime[i] - 1);&lt;br /&gt;
                    is[k][i] = 1;&lt;br /&gt;
                    while(x % prime[i] == 0) x /= prime[i];&lt;br /&gt;
                }&lt;br /&gt;
            }&lt;br /&gt;
            if(x &amp;gt; 1) s[k] = s[k] / x * (x - 1), is[k][lower_bound(prime + 1, prime + cnt + 1, x) - prime] = 1;&lt;br /&gt;
            return;&lt;br /&gt;
        }&lt;br /&gt;
        int mid = (l + r) &amp;gt;&amp;gt; 1;&lt;br /&gt;
        build(lc(k), l, mid);&lt;br /&gt;
        build(rc(k), mid + 1, r);&lt;br /&gt;
        push_up(k);&lt;br /&gt;
    }&lt;br /&gt;
&lt;br /&gt;
    void update(int k, int l, int r, int a, int b, int p, int c)&lt;br /&gt;
    {&lt;br /&gt;
        if(l &amp;gt;= a &amp;amp;&amp;amp; r &amp;lt;= b &amp;amp;&amp;amp; is[k][p])&lt;br /&gt;
        {&lt;br /&gt;
            s[k] = 1ll * s[k] * pw[p][c] % mod;&lt;br /&gt;
            lz[k][p] += c;&lt;br /&gt;
            return;&lt;br /&gt;
        }&lt;br /&gt;
        if(l == r)&lt;br /&gt;
        {&lt;br /&gt;
            s[k] = 1ll * s[k] * (pw[p][c] - pw[p][c - 1]) % mod;&lt;br /&gt;
            is[k][p] = 1;&lt;br /&gt;
            return;&lt;br /&gt;
        }&lt;br /&gt;
        push_down(k);&lt;br /&gt;
        int mid = (l + r) &amp;gt;&amp;gt; 1;&lt;br /&gt;
        if(a &amp;lt;= mid) update(lc(k), l, mid, a, b, p, c);&lt;br /&gt;
        if(mid &amp;lt; b)  update(rc(k), mid + 1, r, a, b, p, c);&lt;br /&gt;
        push_up(k);&lt;br /&gt;
    }&lt;br /&gt;
&lt;br /&gt;
    int query(int k, int l, int r, int a, int b)&lt;br /&gt;
    {&lt;br /&gt;
        if(l &amp;gt;= a &amp;amp;&amp;amp; r &amp;lt;= b) return s[k];&lt;br /&gt;
        push_down(k);&lt;br /&gt;
        int mid = (l + r) &amp;gt;&amp;gt; 1, sum = 0;&lt;br /&gt;
        if(a &amp;lt;= mid) (sum += query(lc(k), l, mid, a, b)) %= mod;&lt;br /&gt;
        if(mid &amp;lt; b)  (sum += query(rc(k), mid + 1, r, a, b)) %= mod;&lt;br /&gt;
        return sum;&lt;br /&gt;
    }&lt;br /&gt;
} tr;&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;n, &amp;amp;m);&lt;br /&gt;
    tr.build(1, 1, n);&lt;br /&gt;
    for(int i = 1, op, l, r, w; i &amp;lt;= m; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        scanf(&amp;quot;%d&amp;quot;, &amp;amp;op);&lt;br /&gt;
        if(op == 0)&lt;br /&gt;
        {&lt;br /&gt;
            scanf(&amp;quot;%d %d %d&amp;quot;, &amp;amp;l, &amp;amp;r, &amp;amp;w);&lt;br /&gt;
            for(int j = 1; j &amp;lt;= cnt &amp;amp;&amp;amp; prime[j] * prime[j] &amp;lt;= w; ++j)&lt;br /&gt;
            {&lt;br /&gt;
                if(w % prime[j]) continue;&lt;br /&gt;
                int c = 0;&lt;br /&gt;
                while(w % prime[j] == 0) ++c, w /= prime[j];&lt;br /&gt;
                tr.update(1, 1, n, l, r, j, c);&lt;br /&gt;
            }&lt;br /&gt;
            if(w &amp;gt; 1) tr.update(1, 1, n, l, r, lower_bound(prime + 1, prime + cnt + 1, w) - prime, 1);&lt;br /&gt;
        }&lt;br /&gt;
        else&lt;br /&gt;
        {&lt;br /&gt;
            scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;l, &amp;amp;r);&lt;br /&gt;
            printf(&amp;quot;%d\n&amp;quot;, (tr.query(1, 1, n, l, r) % mod + mod) % mod);&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
//    freopen(&amp;quot;input.txt&amp;quot;, &amp;quot;r&amp;quot;, stdin);&lt;br /&gt;
    init();&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem M.  Addition ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
定义 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 位 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;2&amp;lt;/math&amp;gt; 进制数表示为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\sum_{i=0}^n{val_i \times 2^i \times sgn[i]}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
给出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n,sgn[]&amp;lt;/math&amp;gt; 和 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;val_{a_i}, val_{b_i}&amp;lt;/math&amp;gt;，令 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;c = a + b&amp;lt;/math&amp;gt;，求出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;c&amp;lt;/math&amp;gt; 的上述表示.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;32 \leq n \leq 60, sgn_i \in \{-1, 1\}, val_{a_i} \in \{0,1\}, val_{b_i} \in \{0,1\}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
连续的低位会构成连续的值域，因此只需要从高到低扫一遍，逐一确认每一位即可.&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
typedef long long ll;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)1e2;&lt;br /&gt;
&lt;br /&gt;
int n;&lt;br /&gt;
int sgn[M + 5];&lt;br /&gt;
ll mi[M + 5], mx[M + 5];&lt;br /&gt;
int ans[M + 5];&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d&amp;quot;, &amp;amp;n);&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) scanf(&amp;quot;%d&amp;quot;, &amp;amp;sgn[i]);&lt;br /&gt;
    if(sgn[0] == 1) mi[0] = 0, mx[0] = 1;&lt;br /&gt;
    else            mi[0] = -1, mx[0] = 0;&lt;br /&gt;
    for(int i = 1; i &amp;lt; n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        if(sgn[i] == 1) mi[i] = mi[i - 1], mx[i] = mx[i - 1] + (1ll&amp;lt;&amp;lt;i);&lt;br /&gt;
        else            mi[i] = mi[i - 1] - (1ll&amp;lt;&amp;lt;i), mx[i] = mx[i - 1];&lt;br /&gt;
    }&lt;br /&gt;
    ll a = 0; for(int i = 0, x; i &amp;lt; n; ++i) scanf(&amp;quot;%d&amp;quot;, &amp;amp;x), a += (1ll&amp;lt;&amp;lt;i) * x * sgn[i];&lt;br /&gt;
    ll b = 0; for(int i = 0, x; i &amp;lt; n; ++i) scanf(&amp;quot;%d&amp;quot;, &amp;amp;x), b += (1ll&amp;lt;&amp;lt;i) * x * sgn[i];&lt;br /&gt;
    ll c = a + b;&lt;br /&gt;
    for(int i = n - 1; i &amp;gt;= 0; --i)&lt;br /&gt;
    {&lt;br /&gt;
        if(i)&lt;br /&gt;
        {&lt;br /&gt;
            if(mi[i - 1] &amp;lt;= c &amp;amp;&amp;amp; c &amp;lt;= mx[i - 1]) ans[i] = 0;&lt;br /&gt;
            else    c -= sgn[i] * (1ll&amp;lt;&amp;lt;i), ans[i] = 1;&lt;br /&gt;
        }&lt;br /&gt;
        else if(c) ans[i] = 1;&lt;br /&gt;
    }&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) printf(&amp;quot;%d%c&amp;quot;, ans[i], i == n - 1 ? '\n' : ' ');&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
//    freopen(&amp;quot;input.txt&amp;quot;, &amp;quot;r&amp;quot;, stdin);&lt;br /&gt;
//    freopen(&amp;quot;output.txt&amp;quot;, &amp;quot;w&amp;quot;, stdout);&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2021-2022_ICPC%E7%BD%91%E7%BB%9C%E8%B5%9Btwo&amp;diff=240</id>
		<title>BreakFast:2021-2022 ICPC网络赛two</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2021-2022_ICPC%E7%BD%91%E7%BB%9C%E8%B5%9Btwo&amp;diff=240"/>
		<updated>2021-09-26T13:57:44Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add toc and discribe&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay == &lt;br /&gt;
&lt;br /&gt;
一开始读G题，极限不会&lt;br /&gt;
&lt;br /&gt;
待有人过M题时，转头去读 M，想了一段时间，发现可以形成连续的区间，从高到低位扫一遍逐一确定，但因为忘记符号位，喜提WA，改后AC&lt;br /&gt;
&lt;br /&gt;
然后继续想极限，lz抽空去看了J题，之后开始写J,一发AC&lt;br /&gt;
&lt;br /&gt;
然后再继续想极限，推了一堆奇怪的东西，与hr的尝试相悖（期间还妄想拿本高数书现学，洛必达起来还极其麻烦，走投无路之下手推了 ln(1+x) 的泰勒展开，又因为一些逻辑有问题，WA++。改后AC&lt;br /&gt;
&lt;br /&gt;
接下来陷入L题一万年，hr迅速口胡出一个错误想法，带着lz和wx走上歧路，写了半天，修了修细节，诶，样例过不去！！！lz指出状态之间有交叉，是没法维护的&lt;br /&gt;
&lt;br /&gt;
xj读完A题后跟hr讲了讲，hr觉得挺对，因为时间复杂度分析失误，迟迟没有让lz去写&lt;br /&gt;
&lt;br /&gt;
后来跟lz讲了一下，lz：“你们在说怪话！！”&lt;br /&gt;
&lt;br /&gt;
于是lz迅速实现完A题，又get一个WA，比赛结束...&lt;br /&gt;
&lt;br /&gt;
赛后光速补完A和L，喜提最快补题奖两枚。&lt;br /&gt;
&lt;br /&gt;
== Soltion == &lt;br /&gt;
&lt;br /&gt;
== 戳[https://pintia.cn/market/item/1442013218528759808 我]进入比赛 ==&lt;br /&gt;
&lt;br /&gt;
一下代码并非赛时AC代码, AC代码较为美观&lt;br /&gt;
&lt;br /&gt;
=== Problem A. Sort ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;T&amp;lt;/math&amp;gt; 组，每组给出一个长度为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 的序列 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 和 整数 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
定义一次操作为将序列 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 分割成 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;v_i&amp;lt;/math&amp;gt; 段，再对段做置换 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;p_i&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
若在有限次数操作中，无法使得序列 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 变成非降序，则输出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;-2&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
若在有限次数操作中，可以使得序列 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 变成非降序，且 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\sum{v_i} \leq 3n&amp;lt;/math&amp;gt;，则输出方案，否则输出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;-1&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq T \leq 10^3, 1 \leq k,n \leq 10^3,1 \leq a[i] \leq 10^9, \sum{n} \leq 3\times 10^4&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
不难发现，当 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k \geq 3&amp;lt;/math&amp;gt; 时，总可以构造出合法方案，就是一傻逼模拟题（被细节搞炸&lt;br /&gt;
&lt;br /&gt;
当 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k=2&amp;lt;/math&amp;gt; 时，注意这个样例&lt;br /&gt;
&lt;br /&gt;
&amp;lt;blockquote&amp;gt;2&amp;lt;br /&amp;gt;&lt;br /&gt;
3 2&amp;lt;br /&amp;gt;&lt;br /&gt;
1 2 1&amp;lt;br /&amp;gt;&lt;br /&gt;
2 1 2&lt;br /&gt;
&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)1e3;&lt;br /&gt;
&lt;br /&gt;
int n, k;&lt;br /&gt;
int a[M + 5];&lt;br /&gt;
int b[M + 5];&lt;br /&gt;
&lt;br /&gt;
bool is_sort(int p)&lt;br /&gt;
{&lt;br /&gt;
    for(int i = 1; i &amp;lt; n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        if(a[(i + p - 2) % n + 1] &amp;gt; a[(i + p - 1) % n + 1]) return 0;&lt;br /&gt;
    }&lt;br /&gt;
    return 1;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;n, &amp;amp;k);&lt;br /&gt;
    for(int i = 1; i &amp;lt;= n; ++i) scanf(&amp;quot;%d&amp;quot;, &amp;amp;a[i]);&lt;br /&gt;
    if(n == 1) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
    else if(k == 1)&lt;br /&gt;
    {&lt;br /&gt;
        if(is_sort(1)) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
        else           printf(&amp;quot;-2\n&amp;quot;);&lt;br /&gt;
    }&lt;br /&gt;
    else if(k == 2)&lt;br /&gt;
    {&lt;br /&gt;
        if(is_sort(1)) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
        else&lt;br /&gt;
        {&lt;br /&gt;
            for(int i = 1; i &amp;lt;= n; ++i)&lt;br /&gt;
            {&lt;br /&gt;
                if(is_sort(i))&lt;br /&gt;
                {&lt;br /&gt;
                    printf(&amp;quot;1\n&amp;quot;);&lt;br /&gt;
                    printf(&amp;quot;2\n&amp;quot;);&lt;br /&gt;
                    printf(&amp;quot;%d %d %d\n&amp;quot;, 0, i - 1, n);&lt;br /&gt;
                    printf(&amp;quot;2 1\n&amp;quot;);&lt;br /&gt;
                    for(int j = 1; j &amp;lt;= n; ++j) b[j] = a[j];&lt;br /&gt;
                    for(int j = 1; j &amp;lt;= n - i + 1; ++j) a[j] = b[j - 1 + i];&lt;br /&gt;
                    for(int j = n - i + 2; j &amp;lt;= n; ++j) a[j] = b[j - n + i - 1];&lt;br /&gt;
                    return;&lt;br /&gt;
                }&lt;br /&gt;
            }&lt;br /&gt;
            printf(&amp;quot;-2\n&amp;quot;);&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    else if(k &amp;gt;= 3)&lt;br /&gt;
    {&lt;br /&gt;
        printf(&amp;quot;%d\n&amp;quot;, n - 1);&lt;br /&gt;
        for(int i = 1; i &amp;lt; n; ++i)&lt;br /&gt;
        {&lt;br /&gt;
            int p = i; for(int j = i; j &amp;lt;= n; ++j) if(a[p] &amp;gt; a[j]) p = j;&lt;br /&gt;
            if(i == p)&lt;br /&gt;
            {&lt;br /&gt;
                printf(&amp;quot;2\n&amp;quot;);&lt;br /&gt;
                printf(&amp;quot;%d %d %d\n&amp;quot;, 0, 1, n);&lt;br /&gt;
                printf(&amp;quot;1 2\n&amp;quot;);&lt;br /&gt;
            }&lt;br /&gt;
            else if(i == 1)&lt;br /&gt;
            {&lt;br /&gt;
                printf(&amp;quot;2\n&amp;quot;);&lt;br /&gt;
                printf(&amp;quot;%d %d %d\n&amp;quot;, 0, p - 1, n);&lt;br /&gt;
                printf(&amp;quot;2 1\n&amp;quot;);&lt;br /&gt;
                for(int j = 1; j &amp;lt;= n; ++j) b[j] = a[j];&lt;br /&gt;
                for(int j = 1; j &amp;lt;= n - p + 1; ++j) a[j] = b[j + p - 1];&lt;br /&gt;
                for(int j = n - p + 2; j &amp;lt;= n; ++j) a[j] = b[j - n + p - 1];&lt;br /&gt;
            }&lt;br /&gt;
            else&lt;br /&gt;
            {&lt;br /&gt;
                printf(&amp;quot;3\n&amp;quot;);&lt;br /&gt;
                printf(&amp;quot;%d %d %d %d\n&amp;quot;, 0, i - 1, p - 1, n);&lt;br /&gt;
                printf(&amp;quot;1 3 2\n&amp;quot;);&lt;br /&gt;
                for(int j = 1; j &amp;lt;= n; ++j) b[j] = a[j];&lt;br /&gt;
                for(int j = 1; j &amp;lt;= i - 1; ++j) a[j] = b[j];&lt;br /&gt;
                for(int j = i; j &amp;lt;= i + n - p; ++j) a[j] = b[j - i + p];&lt;br /&gt;
                for(int j = i + n - p + 1; j &amp;lt;= n; ++j) a[j] = b[j - n + p - 1];&lt;br /&gt;
            }&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    int T; scanf(&amp;quot;%d&amp;quot;, &amp;amp;T);&lt;br /&gt;
    for(int ca = 1; ca &amp;lt;= T; ++ca)&lt;br /&gt;
    {&lt;br /&gt;
        work();&lt;br /&gt;
    }&lt;br /&gt;
    return 0;&lt;br /&gt;
}&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem G.  Limit ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
给出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n, a_i, b_i, t&amp;lt;/math&amp;gt;，求 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\lim\limits_{x \rightarrow 0}{\frac{\sum_{i=1}^n{a_i ln(1+b_ix)}}{x^t}}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq n \leq 10^5, -100 \leq a, b \leq 100, 0 \leq t \leq 5&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
神他喵抓大头，直接无脑泰勒展开（赛时还想多项式卷积&lt;br /&gt;
&lt;br /&gt;
'''结论：三个人都不会高数'''&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
typedef long long ll;&lt;br /&gt;
&lt;br /&gt;
int n, t;&lt;br /&gt;
ll c[10];&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;n, &amp;amp;t);&lt;br /&gt;
    for(int i = 1, a, b; i &amp;lt;= n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;a, &amp;amp;b);&lt;br /&gt;
        ll cur = a;&lt;br /&gt;
        for(int j = 1; j &amp;lt;= t; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            cur *= b;&lt;br /&gt;
            c[j] += ((j&amp;amp;1) ? cur : -cur);&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    if(!t) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
    else&lt;br /&gt;
    {&lt;br /&gt;
        for(int i = 1; i &amp;lt; t; ++i)&lt;br /&gt;
        {&lt;br /&gt;
            if(c[i])&lt;br /&gt;
            {&lt;br /&gt;
                printf(&amp;quot;infinity\n&amp;quot;);&lt;br /&gt;
                return;&lt;br /&gt;
            }&lt;br /&gt;
        }&lt;br /&gt;
        if(c[t] == 0) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
        else&lt;br /&gt;
        {&lt;br /&gt;
            ll d = (ll)abs(__gcd(1ll * t, c[t]));&lt;br /&gt;
            ll up = c[t] / d, dn = t / d;&lt;br /&gt;
            if(dn == 1) printf(&amp;quot;%lld\n&amp;quot;, up);&lt;br /&gt;
            else       printf(&amp;quot;%lld/%d\n&amp;quot;, up, dn);&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem H.  Set ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
定义集合 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;S=\{1,2, \cdots, 256\}&amp;lt;/math&amp;gt;，给出两个整数 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k&amp;lt;/math&amp;gt; 和 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;r&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
要求构造集合 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;S&amp;lt;/math&amp;gt; 的 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k&amp;lt;/math&amp;gt; 个子集 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;I_i&amp;lt;/math&amp;gt;，要求对任意的 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq i_1 &amp;lt; i_2 &amp;lt; \cdots &amp;lt; i_r \leq n&amp;lt;/math&amp;gt; 满足 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;|\bigcup_{j=1}^{r}{I_{i_j}}| \geq 128&amp;lt;/math&amp;gt;，且 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;max\{|I_i|\} \leq \lceil \frac{512}{r} \rceil&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;3 \leq r \leq k \leq 26&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
直接 rand 所有子集就行了...&lt;br /&gt;
&lt;br /&gt;
证明以后再补（咕咕咕&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
int Rand(int l, int r)&lt;br /&gt;
{&lt;br /&gt;
    return rand() % (r - l + 1) + l;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    int k, r; scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;k, &amp;amp;r);&lt;br /&gt;
    for(int i = 1; i &amp;lt;= k; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        set&amp;lt;int&amp;gt; st;&lt;br /&gt;
        while((int)st.size() &amp;lt; (512 + r - 1) / r) st.insert(Rand(1, 256));&lt;br /&gt;
        for(int j = 1; j &amp;lt;= 256; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            printf(&amp;quot;%d&amp;quot;, st.count(j));&lt;br /&gt;
        }&lt;br /&gt;
        printf(&amp;quot;\n&amp;quot;);&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    srand(time(NULL));&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem J. Leaking Roof ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
给一个 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n \times n&amp;lt;/math&amp;gt; 的矩阵 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;h_{ij}&amp;lt;/math&amp;gt; 表示 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;(i,j)&amp;lt;/math&amp;gt; 的高度.&lt;br /&gt;
&lt;br /&gt;
现在每个单元都下了 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;m&amp;lt;/math&amp;gt; 单位的雨水，&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;(i,j)&amp;lt;/math&amp;gt; 的雨水会平均地流向四周高度比它低的单元.&lt;br /&gt;
&lt;br /&gt;
若高度为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;0&amp;lt;/math&amp;gt; 的点有雨水，则这个点会漏水.&lt;br /&gt;
&lt;br /&gt;
求足够长时间后，每个点的漏水量.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq n \leq 500, 0 \leq m,h_{ij} \leq 10^4&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
按照高度依次处理雨水的流动，模拟就行了.&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)5e2;&lt;br /&gt;
&lt;br /&gt;
int n, m;&lt;br /&gt;
int h[M + 5][M + 5];&lt;br /&gt;
int id[M * M + 5];&lt;br /&gt;
double a[M + 5][M + 5];&lt;br /&gt;
int dx[] = {0, 0, 1, -1};&lt;br /&gt;
int dy[] = {1, -1, 0, 0};&lt;br /&gt;
&lt;br /&gt;
bool cmp(int a, int b)&lt;br /&gt;
{&lt;br /&gt;
    return h[a / n][a % n] &amp;gt; h[b / n][b % n];&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;n, &amp;amp;m);&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        for(int j = 0; j &amp;lt; n; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            id[i * n + j] = i * n + j;&lt;br /&gt;
            scanf(&amp;quot;%d&amp;quot;, &amp;amp;h[i][j]);&lt;br /&gt;
            a[i][j] = 1.0 * m;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    sort(id, id + n * n, cmp);&lt;br /&gt;
    for(int i = 0; i &amp;lt; n * n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        int x = id[i] / n, y = id[i] % n, c = 0;&lt;br /&gt;
        for(int j = 0; j &amp;lt; 4; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            int xx = x + dx[j], yy = y + dy[j];&lt;br /&gt;
            if(xx &amp;gt;= 0 &amp;amp;&amp;amp; xx &amp;lt; n &amp;amp;&amp;amp; yy &amp;gt;= 0 &amp;amp;&amp;amp; yy &amp;lt; n &amp;amp;&amp;amp; h[xx][yy] &amp;lt; h[x][y]) ++c;&lt;br /&gt;
        }&lt;br /&gt;
        if(c)&lt;br /&gt;
        {&lt;br /&gt;
            for(int j = 0; j &amp;lt; 4; ++j)&lt;br /&gt;
            {&lt;br /&gt;
                int xx = x + dx[j], yy = y + dy[j];&lt;br /&gt;
                if(xx &amp;gt;= 0 &amp;amp;&amp;amp; xx &amp;lt; n &amp;amp;&amp;amp; yy &amp;gt;= 0 &amp;amp;&amp;amp; yy &amp;lt; n &amp;amp;&amp;amp; h[xx][yy] &amp;lt; h[x][y]) a[xx][yy] += a[x][y] / c;&lt;br /&gt;
            }&lt;br /&gt;
            a[x][y] = 0;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) for(int j = 0; j &amp;lt; n; ++j) printf(&amp;quot;%.9f%c&amp;quot;, h[i][j] ? 0 : a[i][j], j == n - 1 ? '\n' : ' ');&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem K.  Meal ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
有 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 个人，&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 道菜，第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;i&amp;lt;/math&amp;gt; 个人对第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;j&amp;lt;/math&amp;gt; 道菜的好感度为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a_{ij}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
初始，集合 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;S = \{1,2,\cdots ,n\}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 个人按照序号轮流点菜，对于第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;i&amp;lt;/math&amp;gt; 个人，他点到第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;j&amp;lt;/math&amp;gt; 道菜的概率为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\frac{a_{ij}}{\sum_{k \in S}{a_{ik}}}&amp;lt;/math&amp;gt;，然后把 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;j&amp;lt;/math&amp;gt; 从 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;S&amp;lt;/math&amp;gt; 中删除.&lt;br /&gt;
&lt;br /&gt;
求第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;i&amp;lt;/math&amp;gt; 个人点到第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;j&amp;lt;/math&amp;gt; 道菜的概率.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq n \leq 20, 1 \leq a_{ij} \leq 100&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
状压DP模板题~&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
typedef long long ll;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)20;&lt;br /&gt;
const ll mod = (ll)998244353;&lt;br /&gt;
&lt;br /&gt;
int n, a[M][M];&lt;br /&gt;
int f[1&amp;lt;&amp;lt;M];&lt;br /&gt;
int s[1&amp;lt;&amp;lt;M];&lt;br /&gt;
int p[M][M];&lt;br /&gt;
&lt;br /&gt;
ll quick(ll a, ll b, ll p = mod)&lt;br /&gt;
{&lt;br /&gt;
    ll s = 1;&lt;br /&gt;
    while(b)&lt;br /&gt;
    {&lt;br /&gt;
        if(b &amp;amp; 1) s = s * a % p;&lt;br /&gt;
        a = a * a % p;&lt;br /&gt;
        b &amp;gt;&amp;gt;= 1;&lt;br /&gt;
    }&lt;br /&gt;
    return s % p;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
ll inv(ll n, ll p = mod)&lt;br /&gt;
{&lt;br /&gt;
    return quick(n, p - 2, p);&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d&amp;quot;, &amp;amp;n);&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) for(int j = 0; j &amp;lt; n; ++j) scanf(&amp;quot;%d&amp;quot;, &amp;amp;a[i][j]);&lt;br /&gt;
    for(int i = 0; i &amp;lt; (1&amp;lt;&amp;lt;n); ++i)&lt;br /&gt;
    {&lt;br /&gt;
        int c = __builtin_popcount(i);&lt;br /&gt;
        for(int j = 0; j &amp;lt; n; ++j) if(!(i&amp;gt;&amp;gt;j&amp;amp;1)) s[i] += a[c][j];&lt;br /&gt;
        s[i] = inv(s[i]);&lt;br /&gt;
    }&lt;br /&gt;
    f[0] = 1;&lt;br /&gt;
    for(int i = 1; i &amp;lt; (1&amp;lt;&amp;lt;n); ++i)&lt;br /&gt;
    {&lt;br /&gt;
        int c = __builtin_popcount(i) - 1;&lt;br /&gt;
        for(int j = 0; j &amp;lt; n; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            if(!(i&amp;gt;&amp;gt;j&amp;amp;1)) continue;&lt;br /&gt;
            (p[c][j] += 1ll * f[i^(1&amp;lt;&amp;lt;j)] * a[c][j] % mod * s[i^(1&amp;lt;&amp;lt;j)] % mod) %= mod;&lt;br /&gt;
            (f[i] += 1ll * f[i^(1&amp;lt;&amp;lt;j)] * a[c][j] % mod * s[i^(1&amp;lt;&amp;lt;j)] % mod) %= mod;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) for(int j = 0; j &amp;lt; n; ++j) printf(&amp;quot;%d%c&amp;quot;, p[i][j], j == n - 1 ? '\n' : ' ');&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem L. Euler Function ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 个数 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 和 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;m&amp;lt;/math&amp;gt; 次操作.&lt;br /&gt;
&lt;br /&gt;
操作分为两种&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;0 \; l \; r \; w&amp;lt;/math&amp;gt; 表示 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[i] *= w \quad i \in [l, r]&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \; l \; r&amp;lt;/math&amp;gt; 表示查询 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\sum_{i=l}^{r}{\varphi(a[i])}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq n,m \leq 10^5, 1 \leq a_i,w \leq 100, 1 \leq l \leq r \leq n&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
势能线段树（之前见过，但这是第一次知道还有这个名字&lt;br /&gt;
&lt;br /&gt;
改了改线段树的码风&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
typedef long long ll;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)1e5;&lt;br /&gt;
const int N = (int)1e2;&lt;br /&gt;
const ll mod = (ll)998244353;&lt;br /&gt;
&lt;br /&gt;
bool is_prime[N + 5];&lt;br /&gt;
int prime[N + 5], cnt;&lt;br /&gt;
int pw[N + 5][M + 5];&lt;br /&gt;
&lt;br /&gt;
void init()&lt;br /&gt;
{&lt;br /&gt;
    memset(is_prime, 1, sizeof(is_prime));&lt;br /&gt;
    cnt = is_prime[0] = is_prime[1] = 0;&lt;br /&gt;
    for(int i = 2; i &amp;lt;= N; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        if(is_prime[i]) prime[++cnt] = i;&lt;br /&gt;
        for(int j = 1; j &amp;lt;= cnt &amp;amp;&amp;amp; i * prime[j] &amp;lt;= N; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            is_prime[i * prime[j]] = 0;&lt;br /&gt;
            if(i % prime[j] == 0) break;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    for(int i = 1; i &amp;lt;= cnt; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        pw[i][0] = 1; for(int j = 1; j &amp;lt;= M; ++j) pw[i][j] = 1ll * pw[i][j - 1] * prime[i] % mod;&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int n, m;&lt;br /&gt;
struct tnode&lt;br /&gt;
{&lt;br /&gt;
    int s[M * 4 + 5], lz[M * 4 + 5][26]; bool is[M * 4 + 5][26];&lt;br /&gt;
&lt;br /&gt;
    inline int lc(int k) {return k&amp;lt;&amp;lt;1;}&lt;br /&gt;
    inline int rc(int k) {return k&amp;lt;&amp;lt;1|1;}&lt;br /&gt;
&lt;br /&gt;
    inline void push_up(int k)&lt;br /&gt;
    {&lt;br /&gt;
        int l = lc(k), r = rc(k);&lt;br /&gt;
        s[k] = (s[l] + s[r]) % mod;&lt;br /&gt;
        for(int i = 1; i &amp;lt;= cnt; ++i) is[k][i] = (is[l][i]&amp;amp;is[r][i]);&lt;br /&gt;
    }&lt;br /&gt;
&lt;br /&gt;
    inline void push_down(int k)&lt;br /&gt;
    {&lt;br /&gt;
        int l = lc(k), r = rc(k);&lt;br /&gt;
        for(int i = 1; i &amp;lt;= cnt; ++i)&lt;br /&gt;
        {&lt;br /&gt;
            if(!lz[k][i]) continue;&lt;br /&gt;
            s[l] = 1ll * s[l] * pw[i][lz[k][i]] % mod, lz[l][i] += lz[k][i];&lt;br /&gt;
            s[r] = 1ll * s[r] * pw[i][lz[k][i]] % mod, lz[r][i] += lz[k][i];&lt;br /&gt;
            lz[k][i] = 0;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
&lt;br /&gt;
    void build(int k, int l, int r)&lt;br /&gt;
    {&lt;br /&gt;
        if(l == r)&lt;br /&gt;
        {&lt;br /&gt;
            int x; scanf(&amp;quot;%d&amp;quot;, &amp;amp;x);&lt;br /&gt;
            s[k] = x;&lt;br /&gt;
            for(int i = 1; i &amp;lt;= cnt &amp;amp;&amp;amp; prime[i] * prime[i] &amp;lt;= x; ++i)&lt;br /&gt;
            {&lt;br /&gt;
                if(x % prime[i] == 0)&lt;br /&gt;
                {&lt;br /&gt;
                    s[k] = s[k] / prime[i] * (prime[i] - 1);&lt;br /&gt;
                    is[k][i] = 1;&lt;br /&gt;
                    while(x % prime[i] == 0) x /= prime[i];&lt;br /&gt;
                }&lt;br /&gt;
            }&lt;br /&gt;
            if(x &amp;gt; 1) s[k] = s[k] / x * (x - 1), is[k][lower_bound(prime + 1, prime + cnt + 1, x) - prime] = 1;&lt;br /&gt;
            return;&lt;br /&gt;
        }&lt;br /&gt;
        int mid = (l + r) &amp;gt;&amp;gt; 1;&lt;br /&gt;
        build(lc(k), l, mid);&lt;br /&gt;
        build(rc(k), mid + 1, r);&lt;br /&gt;
        push_up(k);&lt;br /&gt;
    }&lt;br /&gt;
&lt;br /&gt;
    void update(int k, int l, int r, int a, int b, int p, int c)&lt;br /&gt;
    {&lt;br /&gt;
        if(l &amp;gt;= a &amp;amp;&amp;amp; r &amp;lt;= b &amp;amp;&amp;amp; is[k][p])&lt;br /&gt;
        {&lt;br /&gt;
            s[k] = 1ll * s[k] * pw[p][c] % mod;&lt;br /&gt;
            lz[k][p] += c;&lt;br /&gt;
            return;&lt;br /&gt;
        }&lt;br /&gt;
        if(l == r)&lt;br /&gt;
        {&lt;br /&gt;
            s[k] = 1ll * s[k] * (pw[p][c] - pw[p][c - 1]) % mod;&lt;br /&gt;
            is[k][p] = 1;&lt;br /&gt;
            return;&lt;br /&gt;
        }&lt;br /&gt;
        push_down(k);&lt;br /&gt;
        int mid = (l + r) &amp;gt;&amp;gt; 1;&lt;br /&gt;
        if(a &amp;lt;= mid) update(lc(k), l, mid, a, b, p, c);&lt;br /&gt;
        if(mid &amp;lt; b)  update(rc(k), mid + 1, r, a, b, p, c);&lt;br /&gt;
        push_up(k);&lt;br /&gt;
    }&lt;br /&gt;
&lt;br /&gt;
    int query(int k, int l, int r, int a, int b)&lt;br /&gt;
    {&lt;br /&gt;
        if(l &amp;gt;= a &amp;amp;&amp;amp; r &amp;lt;= b) return s[k];&lt;br /&gt;
        push_down(k);&lt;br /&gt;
        int mid = (l + r) &amp;gt;&amp;gt; 1, sum = 0;&lt;br /&gt;
        if(a &amp;lt;= mid) (sum += query(lc(k), l, mid, a, b)) %= mod;&lt;br /&gt;
        if(mid &amp;lt; b)  (sum += query(rc(k), mid + 1, r, a, b)) %= mod;&lt;br /&gt;
        return sum;&lt;br /&gt;
    }&lt;br /&gt;
} tr;&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;n, &amp;amp;m);&lt;br /&gt;
    tr.build(1, 1, n);&lt;br /&gt;
    for(int i = 1, op, l, r, w; i &amp;lt;= m; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        scanf(&amp;quot;%d&amp;quot;, &amp;amp;op);&lt;br /&gt;
        if(op == 0)&lt;br /&gt;
        {&lt;br /&gt;
            scanf(&amp;quot;%d %d %d&amp;quot;, &amp;amp;l, &amp;amp;r, &amp;amp;w);&lt;br /&gt;
            for(int j = 1; j &amp;lt;= cnt &amp;amp;&amp;amp; prime[j] * prime[j] &amp;lt;= w; ++j)&lt;br /&gt;
            {&lt;br /&gt;
                if(w % prime[j]) continue;&lt;br /&gt;
                int c = 0;&lt;br /&gt;
                while(w % prime[j] == 0) ++c, w /= prime[j];&lt;br /&gt;
                tr.update(1, 1, n, l, r, j, c);&lt;br /&gt;
            }&lt;br /&gt;
            if(w &amp;gt; 1) tr.update(1, 1, n, l, r, lower_bound(prime + 1, prime + cnt + 1, w) - prime, 1);&lt;br /&gt;
        }&lt;br /&gt;
        else&lt;br /&gt;
        {&lt;br /&gt;
            scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;l, &amp;amp;r);&lt;br /&gt;
            printf(&amp;quot;%d\n&amp;quot;, (tr.query(1, 1, n, l, r) % mod + mod) % mod);&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
//    freopen(&amp;quot;input.txt&amp;quot;, &amp;quot;r&amp;quot;, stdin);&lt;br /&gt;
    init();&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem M.  Addition ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
定义 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 位 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;2&amp;lt;/math&amp;gt; 进制数表示为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\sum_{i=0}^n{val_i \times 2^i \times sgn[i]}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
给出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n,sgn[]&amp;lt;/math&amp;gt; 和 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;val_{a_i}, val_{b_i}&amp;lt;/math&amp;gt;，令 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;c = a + b&amp;lt;/math&amp;gt;，求出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;c&amp;lt;/math&amp;gt; 的上述表示.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;32 \leq n \leq 60, sgn_i \in \{-1, 1\}, val_{a_i} \in \{0,1\}, val_{b_i} \in \{0,1\}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
连续的低位会构成连续的值域，因此只需要从高到低扫一遍，逐一确认每一位即可.&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
typedef long long ll;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)1e2;&lt;br /&gt;
&lt;br /&gt;
int n;&lt;br /&gt;
int sgn[M + 5];&lt;br /&gt;
ll mi[M + 5], mx[M + 5];&lt;br /&gt;
int ans[M + 5];&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d&amp;quot;, &amp;amp;n);&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) scanf(&amp;quot;%d&amp;quot;, &amp;amp;sgn[i]);&lt;br /&gt;
    if(sgn[0] == 1) mi[0] = 0, mx[0] = 1;&lt;br /&gt;
    else            mi[0] = -1, mx[0] = 0;&lt;br /&gt;
    for(int i = 1; i &amp;lt; n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        if(sgn[i] == 1) mi[i] = mi[i - 1], mx[i] = mx[i - 1] + (1ll&amp;lt;&amp;lt;i);&lt;br /&gt;
        else            mi[i] = mi[i - 1] - (1ll&amp;lt;&amp;lt;i), mx[i] = mx[i - 1];&lt;br /&gt;
    }&lt;br /&gt;
    ll a = 0; for(int i = 0, x; i &amp;lt; n; ++i) scanf(&amp;quot;%d&amp;quot;, &amp;amp;x), a += (1ll&amp;lt;&amp;lt;i) * x * sgn[i];&lt;br /&gt;
    ll b = 0; for(int i = 0, x; i &amp;lt; n; ++i) scanf(&amp;quot;%d&amp;quot;, &amp;amp;x), b += (1ll&amp;lt;&amp;lt;i) * x * sgn[i];&lt;br /&gt;
    ll c = a + b;&lt;br /&gt;
    for(int i = n - 1; i &amp;gt;= 0; --i)&lt;br /&gt;
    {&lt;br /&gt;
        if(i)&lt;br /&gt;
        {&lt;br /&gt;
            if(mi[i - 1] &amp;lt;= c &amp;amp;&amp;amp; c &amp;lt;= mx[i - 1]) ans[i] = 0;&lt;br /&gt;
            else    c -= sgn[i] * (1ll&amp;lt;&amp;lt;i), ans[i] = 1;&lt;br /&gt;
        }&lt;br /&gt;
        else if(c) ans[i] = 1;&lt;br /&gt;
    }&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) printf(&amp;quot;%d%c&amp;quot;, ans[i], i == n - 1 ? '\n' : ' ');&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
//    freopen(&amp;quot;input.txt&amp;quot;, &amp;quot;r&amp;quot;, stdin);&lt;br /&gt;
//    freopen(&amp;quot;output.txt&amp;quot;, &amp;quot;w&amp;quot;, stdout);&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2021-2022_ICPC%E7%BD%91%E7%BB%9C%E8%B5%9Btwo&amp;diff=239</id>
		<title>BreakFast:2021-2022 ICPC网络赛two</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2021-2022_ICPC%E7%BD%91%E7%BB%9C%E8%B5%9Btwo&amp;diff=239"/>
		<updated>2021-09-26T13:54:15Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add Soltion&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Replay == &lt;br /&gt;
&lt;br /&gt;
一开始读G题，极限不会&lt;br /&gt;
&lt;br /&gt;
待有人过M题时，转头去读 M，想了一段时间，发现可以形成连续的区间，从高到低位扫一遍逐一确定，但因为忘记符号位，喜提WA，改后AC&lt;br /&gt;
&lt;br /&gt;
然后继续想极限，lz抽空去看了J题，之后开始写J,一发AC&lt;br /&gt;
&lt;br /&gt;
然后再继续想极限，推了一堆奇怪的东西，与hr的尝试相悖（期间还妄想拿本高数书现学，洛必达起来还极其麻烦，走投无路之下手推了 ln(1+x) 的泰勒展开，又因为一些逻辑有问题，WA++。改后AC&lt;br /&gt;
&lt;br /&gt;
接下来陷入L题一万年，hr迅速口胡出一个错误想法，带着lz和wx走上歧路，写了半天，修了修细节，诶，样例过不去！！！lz指出状态之间有交叉，是没法维护的&lt;br /&gt;
&lt;br /&gt;
xj读完A题后跟hr讲了讲，hr觉得挺对，因为时间复杂度分析失误，迟迟没有让lz去写&lt;br /&gt;
&lt;br /&gt;
后来跟lz讲了一下，lz：“你们在说怪话！！”&lt;br /&gt;
&lt;br /&gt;
于是lz迅速实现完A题，又get一个WA，比赛结束...&lt;br /&gt;
&lt;br /&gt;
赛后光速补完A和L，喜提最快补题奖两枚。&lt;br /&gt;
&lt;br /&gt;
== Soltion == &lt;br /&gt;
&lt;br /&gt;
== 戳[https://pintia.cn/market/item/1442013218528759808 我]进入比赛 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Problem A. Sort ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;T&amp;lt;/math&amp;gt; 组，每组给出一个长度为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 的序列 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 和 整数 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
定义一次操作为将序列 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 分割成 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;v_i&amp;lt;/math&amp;gt; 段，再对段做置换 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;p_i&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
若在有限次数操作中，无法使得序列 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 变成非降序，则输出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;-2&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
若在有限次数操作中，可以使得序列 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 变成非降序，且 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\sum{v_i} \leq 3n&amp;lt;/math&amp;gt;，则输出方案，否则输出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;-1&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq T \leq 10^3, 1 \leq k,n \leq 10^3,1 \leq a[i] \leq 10^9, \sum{n} \leq 3\times 10^4&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
不难发现，当 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k \geq 3&amp;lt;/math&amp;gt; 时，总可以构造出合法方案，就是一傻逼模拟题（被细节搞炸&lt;br /&gt;
&lt;br /&gt;
当 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k=2&amp;lt;/math&amp;gt; 时，注意这个样例&lt;br /&gt;
&lt;br /&gt;
&amp;lt;blockquote&amp;gt;2&amp;lt;br /&amp;gt;&lt;br /&gt;
3 2&amp;lt;br /&amp;gt;&lt;br /&gt;
1 2 1&amp;lt;br /&amp;gt;&lt;br /&gt;
2 1 2&lt;br /&gt;
&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)1e3;&lt;br /&gt;
&lt;br /&gt;
int n, k;&lt;br /&gt;
int a[M + 5];&lt;br /&gt;
int b[M + 5];&lt;br /&gt;
&lt;br /&gt;
bool is_sort(int p)&lt;br /&gt;
{&lt;br /&gt;
    for(int i = 1; i &amp;lt; n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        if(a[(i + p - 2) % n + 1] &amp;gt; a[(i + p - 1) % n + 1]) return 0;&lt;br /&gt;
    }&lt;br /&gt;
    return 1;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;n, &amp;amp;k);&lt;br /&gt;
    for(int i = 1; i &amp;lt;= n; ++i) scanf(&amp;quot;%d&amp;quot;, &amp;amp;a[i]);&lt;br /&gt;
    if(n == 1) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
    else if(k == 1)&lt;br /&gt;
    {&lt;br /&gt;
        if(is_sort(1)) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
        else           printf(&amp;quot;-2\n&amp;quot;);&lt;br /&gt;
    }&lt;br /&gt;
    else if(k == 2)&lt;br /&gt;
    {&lt;br /&gt;
        if(is_sort(1)) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
        else&lt;br /&gt;
        {&lt;br /&gt;
            for(int i = 1; i &amp;lt;= n; ++i)&lt;br /&gt;
            {&lt;br /&gt;
                if(is_sort(i))&lt;br /&gt;
                {&lt;br /&gt;
                    printf(&amp;quot;1\n&amp;quot;);&lt;br /&gt;
                    printf(&amp;quot;2\n&amp;quot;);&lt;br /&gt;
                    printf(&amp;quot;%d %d %d\n&amp;quot;, 0, i - 1, n);&lt;br /&gt;
                    printf(&amp;quot;2 1\n&amp;quot;);&lt;br /&gt;
                    for(int j = 1; j &amp;lt;= n; ++j) b[j] = a[j];&lt;br /&gt;
                    for(int j = 1; j &amp;lt;= n - i + 1; ++j) a[j] = b[j - 1 + i];&lt;br /&gt;
                    for(int j = n - i + 2; j &amp;lt;= n; ++j) a[j] = b[j - n + i - 1];&lt;br /&gt;
                    return;&lt;br /&gt;
                }&lt;br /&gt;
            }&lt;br /&gt;
            printf(&amp;quot;-2\n&amp;quot;);&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    else if(k &amp;gt;= 3)&lt;br /&gt;
    {&lt;br /&gt;
        printf(&amp;quot;%d\n&amp;quot;, n - 1);&lt;br /&gt;
        for(int i = 1; i &amp;lt; n; ++i)&lt;br /&gt;
        {&lt;br /&gt;
            int p = i; for(int j = i; j &amp;lt;= n; ++j) if(a[p] &amp;gt; a[j]) p = j;&lt;br /&gt;
            if(i == p)&lt;br /&gt;
            {&lt;br /&gt;
                printf(&amp;quot;2\n&amp;quot;);&lt;br /&gt;
                printf(&amp;quot;%d %d %d\n&amp;quot;, 0, 1, n);&lt;br /&gt;
                printf(&amp;quot;1 2\n&amp;quot;);&lt;br /&gt;
            }&lt;br /&gt;
            else if(i == 1)&lt;br /&gt;
            {&lt;br /&gt;
                printf(&amp;quot;2\n&amp;quot;);&lt;br /&gt;
                printf(&amp;quot;%d %d %d\n&amp;quot;, 0, p - 1, n);&lt;br /&gt;
                printf(&amp;quot;2 1\n&amp;quot;);&lt;br /&gt;
                for(int j = 1; j &amp;lt;= n; ++j) b[j] = a[j];&lt;br /&gt;
                for(int j = 1; j &amp;lt;= n - p + 1; ++j) a[j] = b[j + p - 1];&lt;br /&gt;
                for(int j = n - p + 2; j &amp;lt;= n; ++j) a[j] = b[j - n + p - 1];&lt;br /&gt;
            }&lt;br /&gt;
            else&lt;br /&gt;
            {&lt;br /&gt;
                printf(&amp;quot;3\n&amp;quot;);&lt;br /&gt;
                printf(&amp;quot;%d %d %d %d\n&amp;quot;, 0, i - 1, p - 1, n);&lt;br /&gt;
                printf(&amp;quot;1 3 2\n&amp;quot;);&lt;br /&gt;
                for(int j = 1; j &amp;lt;= n; ++j) b[j] = a[j];&lt;br /&gt;
                for(int j = 1; j &amp;lt;= i - 1; ++j) a[j] = b[j];&lt;br /&gt;
                for(int j = i; j &amp;lt;= i + n - p; ++j) a[j] = b[j - i + p];&lt;br /&gt;
                for(int j = i + n - p + 1; j &amp;lt;= n; ++j) a[j] = b[j - n + p - 1];&lt;br /&gt;
            }&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    int T; scanf(&amp;quot;%d&amp;quot;, &amp;amp;T);&lt;br /&gt;
    for(int ca = 1; ca &amp;lt;= T; ++ca)&lt;br /&gt;
    {&lt;br /&gt;
        work();&lt;br /&gt;
    }&lt;br /&gt;
    return 0;&lt;br /&gt;
}&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem G.  Limit ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
给出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n, a_i, b_i, t&amp;lt;/math&amp;gt;，求 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\lim\limits_{x \rightarrow 0}{\frac{\sum_{i=1}^n{a_i ln(1+b_ix)}}{x^t}}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq n \leq 10^5, -100 \leq a, b \leq 100, 0 \leq t \leq 5&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
神他喵抓大头，直接无脑泰勒展开（赛时还想多项式卷积&lt;br /&gt;
&lt;br /&gt;
'''结论：三个人都不会高数'''&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
typedef long long ll;&lt;br /&gt;
&lt;br /&gt;
int n, t;&lt;br /&gt;
ll c[10];&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;n, &amp;amp;t);&lt;br /&gt;
    for(int i = 1, a, b; i &amp;lt;= n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;a, &amp;amp;b);&lt;br /&gt;
        ll cur = a;&lt;br /&gt;
        for(int j = 1; j &amp;lt;= t; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            cur *= b;&lt;br /&gt;
            c[j] += ((j&amp;amp;1) ? cur : -cur);&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    if(!t) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
    else&lt;br /&gt;
    {&lt;br /&gt;
        for(int i = 1; i &amp;lt; t; ++i)&lt;br /&gt;
        {&lt;br /&gt;
            if(c[i])&lt;br /&gt;
            {&lt;br /&gt;
                printf(&amp;quot;infinity\n&amp;quot;);&lt;br /&gt;
                return;&lt;br /&gt;
            }&lt;br /&gt;
        }&lt;br /&gt;
        if(c[t] == 0) printf(&amp;quot;0\n&amp;quot;);&lt;br /&gt;
        else&lt;br /&gt;
        {&lt;br /&gt;
            ll d = (ll)abs(__gcd(1ll * t, c[t]));&lt;br /&gt;
            ll up = c[t] / d, dn = t / d;&lt;br /&gt;
            if(dn == 1) printf(&amp;quot;%lld\n&amp;quot;, up);&lt;br /&gt;
            else       printf(&amp;quot;%lld/%d\n&amp;quot;, up, dn);&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem H.  Set ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
定义集合 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;S=\{1,2, \cdots, 256\}&amp;lt;/math&amp;gt;，给出两个整数 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k&amp;lt;/math&amp;gt; 和 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;r&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
要求构造集合 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;S&amp;lt;/math&amp;gt; 的 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;k&amp;lt;/math&amp;gt; 个子集 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;I_i&amp;lt;/math&amp;gt;，要求对任意的 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq i_1 &amp;lt; i_2 &amp;lt; \cdots &amp;lt; i_r \leq n&amp;lt;/math&amp;gt; 满足 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;|\bigcup_{j=1}^{r}{I_{i_j}}| \geq 128&amp;lt;/math&amp;gt;，且 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;max\{|I_i|\} \leq \lceil \frac{512}{r} \rceil&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;3 \leq r \leq k \leq 26&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
直接 rand 所有子集就行了...&lt;br /&gt;
&lt;br /&gt;
证明以后再补（咕咕咕&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
int Rand(int l, int r)&lt;br /&gt;
{&lt;br /&gt;
    return rand() % (r - l + 1) + l;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    int k, r; scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;k, &amp;amp;r);&lt;br /&gt;
    for(int i = 1; i &amp;lt;= k; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        set&amp;lt;int&amp;gt; st;&lt;br /&gt;
        while((int)st.size() &amp;lt; (512 + r - 1) / r) st.insert(Rand(1, 256));&lt;br /&gt;
        for(int j = 1; j &amp;lt;= 256; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            printf(&amp;quot;%d&amp;quot;, st.count(j));&lt;br /&gt;
        }&lt;br /&gt;
        printf(&amp;quot;\n&amp;quot;);&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    srand(time(NULL));&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem J. Leaking Roof ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
给一个 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n \times n&amp;lt;/math&amp;gt; 的矩阵 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;h_{ij}&amp;lt;/math&amp;gt; 表示 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;(i,j)&amp;lt;/math&amp;gt; 的高度.&lt;br /&gt;
&lt;br /&gt;
现在每个单元都下了 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;m&amp;lt;/math&amp;gt; 单位的雨水，&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;(i,j)&amp;lt;/math&amp;gt; 的雨水会平均地流向四周高度比它低的单元.&lt;br /&gt;
&lt;br /&gt;
若高度为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;0&amp;lt;/math&amp;gt; 的点有雨水，则这个点会漏水.&lt;br /&gt;
&lt;br /&gt;
求足够长时间后，每个点的漏水量.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq n \leq 500, 0 \leq m,h_{ij} \leq 10^4&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
按照高度依次处理雨水的流动，模拟就行了.&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)5e2;&lt;br /&gt;
&lt;br /&gt;
int n, m;&lt;br /&gt;
int h[M + 5][M + 5];&lt;br /&gt;
int id[M * M + 5];&lt;br /&gt;
double a[M + 5][M + 5];&lt;br /&gt;
int dx[] = {0, 0, 1, -1};&lt;br /&gt;
int dy[] = {1, -1, 0, 0};&lt;br /&gt;
&lt;br /&gt;
bool cmp(int a, int b)&lt;br /&gt;
{&lt;br /&gt;
    return h[a / n][a % n] &amp;gt; h[b / n][b % n];&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;n, &amp;amp;m);&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        for(int j = 0; j &amp;lt; n; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            id[i * n + j] = i * n + j;&lt;br /&gt;
            scanf(&amp;quot;%d&amp;quot;, &amp;amp;h[i][j]);&lt;br /&gt;
            a[i][j] = 1.0 * m;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    sort(id, id + n * n, cmp);&lt;br /&gt;
    for(int i = 0; i &amp;lt; n * n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        int x = id[i] / n, y = id[i] % n, c = 0;&lt;br /&gt;
        for(int j = 0; j &amp;lt; 4; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            int xx = x + dx[j], yy = y + dy[j];&lt;br /&gt;
            if(xx &amp;gt;= 0 &amp;amp;&amp;amp; xx &amp;lt; n &amp;amp;&amp;amp; yy &amp;gt;= 0 &amp;amp;&amp;amp; yy &amp;lt; n &amp;amp;&amp;amp; h[xx][yy] &amp;lt; h[x][y]) ++c;&lt;br /&gt;
        }&lt;br /&gt;
        if(c)&lt;br /&gt;
        {&lt;br /&gt;
            for(int j = 0; j &amp;lt; 4; ++j)&lt;br /&gt;
            {&lt;br /&gt;
                int xx = x + dx[j], yy = y + dy[j];&lt;br /&gt;
                if(xx &amp;gt;= 0 &amp;amp;&amp;amp; xx &amp;lt; n &amp;amp;&amp;amp; yy &amp;gt;= 0 &amp;amp;&amp;amp; yy &amp;lt; n &amp;amp;&amp;amp; h[xx][yy] &amp;lt; h[x][y]) a[xx][yy] += a[x][y] / c;&lt;br /&gt;
            }&lt;br /&gt;
            a[x][y] = 0;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) for(int j = 0; j &amp;lt; n; ++j) printf(&amp;quot;%.9f%c&amp;quot;, h[i][j] ? 0 : a[i][j], j == n - 1 ? '\n' : ' ');&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem K.  Meal ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
有 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 个人，&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 道菜，第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;i&amp;lt;/math&amp;gt; 个人对第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;j&amp;lt;/math&amp;gt; 道菜的好感度为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a_{ij}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
初始，集合 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;S = \{1,2,\cdots ,n\}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 个人按照序号轮流点菜，对于第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;i&amp;lt;/math&amp;gt; 个人，他点到第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;j&amp;lt;/math&amp;gt; 道菜的概率为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\frac{a_{ij}}{\sum_{k \in S}{a_{ik}}}&amp;lt;/math&amp;gt;，然后把 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;j&amp;lt;/math&amp;gt; 从 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;S&amp;lt;/math&amp;gt; 中删除.&lt;br /&gt;
&lt;br /&gt;
求第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;i&amp;lt;/math&amp;gt; 个人点到第 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;j&amp;lt;/math&amp;gt; 道菜的概率.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq n \leq 20, 1 \leq a_{ij} \leq 100&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
状压DP模板题~&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
typedef long long ll;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)20;&lt;br /&gt;
const ll mod = (ll)998244353;&lt;br /&gt;
&lt;br /&gt;
int n, a[M][M];&lt;br /&gt;
int f[1&amp;lt;&amp;lt;M];&lt;br /&gt;
int s[1&amp;lt;&amp;lt;M];&lt;br /&gt;
int p[M][M];&lt;br /&gt;
&lt;br /&gt;
ll quick(ll a, ll b, ll p = mod)&lt;br /&gt;
{&lt;br /&gt;
    ll s = 1;&lt;br /&gt;
    while(b)&lt;br /&gt;
    {&lt;br /&gt;
        if(b &amp;amp; 1) s = s * a % p;&lt;br /&gt;
        a = a * a % p;&lt;br /&gt;
        b &amp;gt;&amp;gt;= 1;&lt;br /&gt;
    }&lt;br /&gt;
    return s % p;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
ll inv(ll n, ll p = mod)&lt;br /&gt;
{&lt;br /&gt;
    return quick(n, p - 2, p);&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d&amp;quot;, &amp;amp;n);&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) for(int j = 0; j &amp;lt; n; ++j) scanf(&amp;quot;%d&amp;quot;, &amp;amp;a[i][j]);&lt;br /&gt;
    for(int i = 0; i &amp;lt; (1&amp;lt;&amp;lt;n); ++i)&lt;br /&gt;
    {&lt;br /&gt;
        int c = __builtin_popcount(i);&lt;br /&gt;
        for(int j = 0; j &amp;lt; n; ++j) if(!(i&amp;gt;&amp;gt;j&amp;amp;1)) s[i] += a[c][j];&lt;br /&gt;
        s[i] = inv(s[i]);&lt;br /&gt;
    }&lt;br /&gt;
    f[0] = 1;&lt;br /&gt;
    for(int i = 1; i &amp;lt; (1&amp;lt;&amp;lt;n); ++i)&lt;br /&gt;
    {&lt;br /&gt;
        int c = __builtin_popcount(i) - 1;&lt;br /&gt;
        for(int j = 0; j &amp;lt; n; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            if(!(i&amp;gt;&amp;gt;j&amp;amp;1)) continue;&lt;br /&gt;
            (p[c][j] += 1ll * f[i^(1&amp;lt;&amp;lt;j)] * a[c][j] % mod * s[i^(1&amp;lt;&amp;lt;j)] % mod) %= mod;&lt;br /&gt;
            (f[i] += 1ll * f[i^(1&amp;lt;&amp;lt;j)] * a[c][j] % mod * s[i^(1&amp;lt;&amp;lt;j)] % mod) %= mod;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) for(int j = 0; j &amp;lt; n; ++j) printf(&amp;quot;%d%c&amp;quot;, p[i][j], j == n - 1 ? '\n' : ' ');&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem L. Euler Function ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 个数 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[]&amp;lt;/math&amp;gt; 和 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;m&amp;lt;/math&amp;gt; 次操作.&lt;br /&gt;
&lt;br /&gt;
操作分为两种&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;0 \; l \; r \; w&amp;lt;/math&amp;gt; 表示 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;a[i] *= w \quad i \in [l, r]&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \; l \; r&amp;lt;/math&amp;gt; 表示查询 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\sum_{i=l}^{r}{\varphi(a[i])}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;1 \leq n,m \leq 10^5, 1 \leq a_i,w \leq 100, 1 \leq l \leq r \leq n&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
势能线段树（之前见过，但这是第一次知道还有这个名字&lt;br /&gt;
&lt;br /&gt;
改了改线段树的码风&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
typedef long long ll;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)1e5;&lt;br /&gt;
const int N = (int)1e2;&lt;br /&gt;
const ll mod = (ll)998244353;&lt;br /&gt;
&lt;br /&gt;
bool is_prime[N + 5];&lt;br /&gt;
int prime[N + 5], cnt;&lt;br /&gt;
int pw[N + 5][M + 5];&lt;br /&gt;
&lt;br /&gt;
void init()&lt;br /&gt;
{&lt;br /&gt;
    memset(is_prime, 1, sizeof(is_prime));&lt;br /&gt;
    cnt = is_prime[0] = is_prime[1] = 0;&lt;br /&gt;
    for(int i = 2; i &amp;lt;= N; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        if(is_prime[i]) prime[++cnt] = i;&lt;br /&gt;
        for(int j = 1; j &amp;lt;= cnt &amp;amp;&amp;amp; i * prime[j] &amp;lt;= N; ++j)&lt;br /&gt;
        {&lt;br /&gt;
            is_prime[i * prime[j]] = 0;&lt;br /&gt;
            if(i % prime[j] == 0) break;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
    for(int i = 1; i &amp;lt;= cnt; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        pw[i][0] = 1; for(int j = 1; j &amp;lt;= M; ++j) pw[i][j] = 1ll * pw[i][j - 1] * prime[i] % mod;&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int n, m;&lt;br /&gt;
struct tnode&lt;br /&gt;
{&lt;br /&gt;
    int s[M * 4 + 5], lz[M * 4 + 5][26]; bool is[M * 4 + 5][26];&lt;br /&gt;
&lt;br /&gt;
    inline int lc(int k) {return k&amp;lt;&amp;lt;1;}&lt;br /&gt;
    inline int rc(int k) {return k&amp;lt;&amp;lt;1|1;}&lt;br /&gt;
&lt;br /&gt;
    inline void push_up(int k)&lt;br /&gt;
    {&lt;br /&gt;
        int l = lc(k), r = rc(k);&lt;br /&gt;
        s[k] = (s[l] + s[r]) % mod;&lt;br /&gt;
        for(int i = 1; i &amp;lt;= cnt; ++i) is[k][i] = (is[l][i]&amp;amp;is[r][i]);&lt;br /&gt;
    }&lt;br /&gt;
&lt;br /&gt;
    inline void push_down(int k)&lt;br /&gt;
    {&lt;br /&gt;
        int l = lc(k), r = rc(k);&lt;br /&gt;
        for(int i = 1; i &amp;lt;= cnt; ++i)&lt;br /&gt;
        {&lt;br /&gt;
            if(!lz[k][i]) continue;&lt;br /&gt;
            s[l] = 1ll * s[l] * pw[i][lz[k][i]] % mod, lz[l][i] += lz[k][i];&lt;br /&gt;
            s[r] = 1ll * s[r] * pw[i][lz[k][i]] % mod, lz[r][i] += lz[k][i];&lt;br /&gt;
            lz[k][i] = 0;&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
&lt;br /&gt;
    void build(int k, int l, int r)&lt;br /&gt;
    {&lt;br /&gt;
        if(l == r)&lt;br /&gt;
        {&lt;br /&gt;
            int x; scanf(&amp;quot;%d&amp;quot;, &amp;amp;x);&lt;br /&gt;
            s[k] = x;&lt;br /&gt;
            for(int i = 1; i &amp;lt;= cnt &amp;amp;&amp;amp; prime[i] * prime[i] &amp;lt;= x; ++i)&lt;br /&gt;
            {&lt;br /&gt;
                if(x % prime[i] == 0)&lt;br /&gt;
                {&lt;br /&gt;
                    s[k] = s[k] / prime[i] * (prime[i] - 1);&lt;br /&gt;
                    is[k][i] = 1;&lt;br /&gt;
                    while(x % prime[i] == 0) x /= prime[i];&lt;br /&gt;
                }&lt;br /&gt;
            }&lt;br /&gt;
            if(x &amp;gt; 1) s[k] = s[k] / x * (x - 1), is[k][lower_bound(prime + 1, prime + cnt + 1, x) - prime] = 1;&lt;br /&gt;
            return;&lt;br /&gt;
        }&lt;br /&gt;
        int mid = (l + r) &amp;gt;&amp;gt; 1;&lt;br /&gt;
        build(lc(k), l, mid);&lt;br /&gt;
        build(rc(k), mid + 1, r);&lt;br /&gt;
        push_up(k);&lt;br /&gt;
    }&lt;br /&gt;
&lt;br /&gt;
    void update(int k, int l, int r, int a, int b, int p, int c)&lt;br /&gt;
    {&lt;br /&gt;
        if(l &amp;gt;= a &amp;amp;&amp;amp; r &amp;lt;= b &amp;amp;&amp;amp; is[k][p])&lt;br /&gt;
        {&lt;br /&gt;
            s[k] = 1ll * s[k] * pw[p][c] % mod;&lt;br /&gt;
            lz[k][p] += c;&lt;br /&gt;
            return;&lt;br /&gt;
        }&lt;br /&gt;
        if(l == r)&lt;br /&gt;
        {&lt;br /&gt;
            s[k] = 1ll * s[k] * (pw[p][c] - pw[p][c - 1]) % mod;&lt;br /&gt;
            is[k][p] = 1;&lt;br /&gt;
            return;&lt;br /&gt;
        }&lt;br /&gt;
        push_down(k);&lt;br /&gt;
        int mid = (l + r) &amp;gt;&amp;gt; 1;&lt;br /&gt;
        if(a &amp;lt;= mid) update(lc(k), l, mid, a, b, p, c);&lt;br /&gt;
        if(mid &amp;lt; b)  update(rc(k), mid + 1, r, a, b, p, c);&lt;br /&gt;
        push_up(k);&lt;br /&gt;
    }&lt;br /&gt;
&lt;br /&gt;
    int query(int k, int l, int r, int a, int b)&lt;br /&gt;
    {&lt;br /&gt;
        if(l &amp;gt;= a &amp;amp;&amp;amp; r &amp;lt;= b) return s[k];&lt;br /&gt;
        push_down(k);&lt;br /&gt;
        int mid = (l + r) &amp;gt;&amp;gt; 1, sum = 0;&lt;br /&gt;
        if(a &amp;lt;= mid) (sum += query(lc(k), l, mid, a, b)) %= mod;&lt;br /&gt;
        if(mid &amp;lt; b)  (sum += query(rc(k), mid + 1, r, a, b)) %= mod;&lt;br /&gt;
        return sum;&lt;br /&gt;
    }&lt;br /&gt;
} tr;&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;n, &amp;amp;m);&lt;br /&gt;
    tr.build(1, 1, n);&lt;br /&gt;
    for(int i = 1, op, l, r, w; i &amp;lt;= m; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        scanf(&amp;quot;%d&amp;quot;, &amp;amp;op);&lt;br /&gt;
        if(op == 0)&lt;br /&gt;
        {&lt;br /&gt;
            scanf(&amp;quot;%d %d %d&amp;quot;, &amp;amp;l, &amp;amp;r, &amp;amp;w);&lt;br /&gt;
            for(int j = 1; j &amp;lt;= cnt &amp;amp;&amp;amp; prime[j] * prime[j] &amp;lt;= w; ++j)&lt;br /&gt;
            {&lt;br /&gt;
                if(w % prime[j]) continue;&lt;br /&gt;
                int c = 0;&lt;br /&gt;
                while(w % prime[j] == 0) ++c, w /= prime[j];&lt;br /&gt;
                tr.update(1, 1, n, l, r, j, c);&lt;br /&gt;
            }&lt;br /&gt;
            if(w &amp;gt; 1) tr.update(1, 1, n, l, r, lower_bound(prime + 1, prime + cnt + 1, w) - prime, 1);&lt;br /&gt;
        }&lt;br /&gt;
        else&lt;br /&gt;
        {&lt;br /&gt;
            scanf(&amp;quot;%d %d&amp;quot;, &amp;amp;l, &amp;amp;r);&lt;br /&gt;
            printf(&amp;quot;%d\n&amp;quot;, (tr.query(1, 1, n, l, r) % mod + mod) % mod);&lt;br /&gt;
        }&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
//    freopen(&amp;quot;input.txt&amp;quot;, &amp;quot;r&amp;quot;, stdin);&lt;br /&gt;
    init();&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
=== Problem M.  Addition ===&lt;br /&gt;
&lt;br /&gt;
==== 题目大意 ====&lt;br /&gt;
&lt;br /&gt;
定义 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n&amp;lt;/math&amp;gt; 位 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;2&amp;lt;/math&amp;gt; 进制数表示为 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;\sum_{i=0}^n{val_i \times 2^i \times sgn[i]}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
给出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;n,sgn[]&amp;lt;/math&amp;gt; 和 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;val_{a_i}, val_{b_i}&amp;lt;/math&amp;gt;，令 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;c = a + b&amp;lt;/math&amp;gt;，求出 &amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;c&amp;lt;/math&amp;gt; 的上述表示.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;inline&amp;quot;&amp;gt;32 \leq n \leq 60, sgn_i \in \{-1, 1\}, val_{a_i} \in \{0,1\}, val_{b_i} \in \{0,1\}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 分析 ===&lt;br /&gt;
&lt;br /&gt;
连续的低位会构成连续的值域，因此只需要从高到低扫一遍，逐一确认每一位即可.&lt;br /&gt;
&lt;br /&gt;
=== 代码实现 ===&lt;br /&gt;
&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;cpp&amp;quot;&amp;gt;#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
typedef long long ll;&lt;br /&gt;
&lt;br /&gt;
const int M = (int)1e2;&lt;br /&gt;
&lt;br /&gt;
int n;&lt;br /&gt;
int sgn[M + 5];&lt;br /&gt;
ll mi[M + 5], mx[M + 5];&lt;br /&gt;
int ans[M + 5];&lt;br /&gt;
&lt;br /&gt;
void work()&lt;br /&gt;
{&lt;br /&gt;
    scanf(&amp;quot;%d&amp;quot;, &amp;amp;n);&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) scanf(&amp;quot;%d&amp;quot;, &amp;amp;sgn[i]);&lt;br /&gt;
    if(sgn[0] == 1) mi[0] = 0, mx[0] = 1;&lt;br /&gt;
    else            mi[0] = -1, mx[0] = 0;&lt;br /&gt;
    for(int i = 1; i &amp;lt; n; ++i)&lt;br /&gt;
    {&lt;br /&gt;
        if(sgn[i] == 1) mi[i] = mi[i - 1], mx[i] = mx[i - 1] + (1ll&amp;lt;&amp;lt;i);&lt;br /&gt;
        else            mi[i] = mi[i - 1] - (1ll&amp;lt;&amp;lt;i), mx[i] = mx[i - 1];&lt;br /&gt;
    }&lt;br /&gt;
    ll a = 0; for(int i = 0, x; i &amp;lt; n; ++i) scanf(&amp;quot;%d&amp;quot;, &amp;amp;x), a += (1ll&amp;lt;&amp;lt;i) * x * sgn[i];&lt;br /&gt;
    ll b = 0; for(int i = 0, x; i &amp;lt; n; ++i) scanf(&amp;quot;%d&amp;quot;, &amp;amp;x), b += (1ll&amp;lt;&amp;lt;i) * x * sgn[i];&lt;br /&gt;
    ll c = a + b;&lt;br /&gt;
    for(int i = n - 1; i &amp;gt;= 0; --i)&lt;br /&gt;
    {&lt;br /&gt;
        if(i)&lt;br /&gt;
        {&lt;br /&gt;
            if(mi[i - 1] &amp;lt;= c &amp;amp;&amp;amp; c &amp;lt;= mx[i - 1]) ans[i] = 0;&lt;br /&gt;
            else    c -= sgn[i] * (1ll&amp;lt;&amp;lt;i), ans[i] = 1;&lt;br /&gt;
        }&lt;br /&gt;
        else if(c) ans[i] = 1;&lt;br /&gt;
    }&lt;br /&gt;
    for(int i = 0; i &amp;lt; n; ++i) printf(&amp;quot;%d%c&amp;quot;, ans[i], i == n - 1 ? '\n' : ' ');&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
//    freopen(&amp;quot;input.txt&amp;quot;, &amp;quot;r&amp;quot;, stdin);&lt;br /&gt;
//    freopen(&amp;quot;output.txt&amp;quot;, &amp;quot;w&amp;quot;, stdout);&lt;br /&gt;
    work();&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/syntaxhighlight&amp;gt;&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=238</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=238"/>
		<updated>2021-09-25T10:36:49Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Trainings */ update 2021-2022 ICPC网络赛two&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/25/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2021-2022_ICPC%E7%BD%91%E7%BB%9C%E8%B5%9Btwo&amp;diff=237</id>
		<title>BreakFast:2021-2022 ICPC网络赛two</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2021-2022_ICPC%E7%BD%91%E7%BB%9C%E8%B5%9Btwo&amp;diff=237"/>
		<updated>2021-09-25T10:25:36Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add 2021-2022 ICPC网络赛two&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Replay == &lt;br /&gt;
&lt;br /&gt;
一开始读G题，极限不会&lt;br /&gt;
&lt;br /&gt;
待有人过M题时，转头去读 M，想了一段时间，发现可以形成连续的区间，从高到低位扫一遍逐一确定，但因为忘记符号位，喜提WA，改后AC&lt;br /&gt;
&lt;br /&gt;
然后继续想极限，lz抽空去看了J题，之后开始写J,一发AC&lt;br /&gt;
&lt;br /&gt;
然后再继续想极限，推了一堆奇怪的东西，与hr的尝试相悖（期间还妄想拿本高数书现学，洛必达起来还极其麻烦，走投无路之下手推了 ln(1+x) 的泰勒展开，又因为一些逻辑有问题，WA++。改后AC&lt;br /&gt;
&lt;br /&gt;
接下来陷入L题一万年，hr迅速口胡出一个错误想法，带着lz和wx走上歧路，写了半天，修了修细节，诶，样例过不去！！！lz指出状态之间有交叉，是没法维护的&lt;br /&gt;
&lt;br /&gt;
xj读完A题后跟hr讲了讲，hr觉得挺对，因为时间复杂度分析失误，迟迟没有让lz去写&lt;br /&gt;
&lt;br /&gt;
后来跟lz讲了一下，lz：“你们在说怪话！！”&lt;br /&gt;
&lt;br /&gt;
于是lz迅速实现完A题，又get一个WA，比赛结束...&lt;br /&gt;
&lt;br /&gt;
赛后光速补完A和L，喜提最快补题奖两枚。&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=236</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=236"/>
		<updated>2021-09-25T10:06:49Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Trainings */ add 2021-2022 ICPC网络赛two&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛two|2021-2022 ICPC网络赛two]] || Sep/19/2021 || 3/13 || . || . || . || . || . || . || O || . || . || O || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2021-2022_ICPC%E7%BD%91%E7%BB%9C%E8%B5%9Bone&amp;diff=235</id>
		<title>BreakFast:2021-2022 ICPC网络赛one</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2021-2022_ICPC%E7%BD%91%E7%BB%9C%E8%B5%9Bone&amp;diff=235"/>
		<updated>2021-09-19T09:54:38Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add 2021-2022 ICPC网络赛one replay&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;开局看了B题，一看这不傻逼题，lz开始写，写了一半我和hr表示I题很好写，去做了I题&lt;br /&gt;
&lt;br /&gt;
I题直接过了，然后lz在写B题，我们在读F题&lt;br /&gt;
&lt;br /&gt;
F题我和hr想半天，lz一语道破，因为输出格式有一点点小bug，WA了一发&lt;br /&gt;
&lt;br /&gt;
然后就是漫长的B题，发现样例解释不通，hr表示你做了那么多题你还不知道clockwise是逆时针，然后样例实在不通，我去查了查字典，hr极力阻止，发现那是顺时针，WA了一发开始了漫长的猜题过程&lt;br /&gt;
&lt;br /&gt;
我和hr读完A题，hr提出错误思路，成功把lz带进沟里，WA了一发之后，写了对拍拍了好久，还猜了猜题，还是WA，后来终于拍出来了，然后lz立马实现了最初的想法，AC，tql！！！！&lt;br /&gt;
&lt;br /&gt;
然后又来猜B，判断了一系列格式不正确的可能性，没猜得出来，就离谱，强烈谴责出题的sb！！！！！&lt;br /&gt;
&lt;br /&gt;
H题读完盲猜和坐标没关系，但是由于出题人足够傻逼，不是很敢确定题意，鼓足勇气写了，还猜了个输出格式要sort，结果过了，第三次谴责出题人！！！&lt;br /&gt;
&lt;br /&gt;
K题hr读题一下子就读错了，我们都十分信任hr直接上手写了，然后一下子就WA了，我读了一眼发现输入数据读的不对，居然还能过样例，改完又贡献了一发PE，再一次谴责出题人，然后就过了&lt;br /&gt;
&lt;br /&gt;
我去读了D题，hr一开始说什么并查集，lz实现途中突然发现不太行，然后就用set维护线段过掉了，tql！！！&lt;br /&gt;
&lt;br /&gt;
比赛还剩15分钟，lz快速实现了G题，但是因为lz忘记了掩码是什么东西，结果就差一分钟就过了一道题，最快补题奖又有一块了&lt;br /&gt;
&lt;br /&gt;
总结：傻逼出题人*inf，hr别再演了，写之前一定要明确题意。&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=234</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=234"/>
		<updated>2021-09-19T09:22:42Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2021-2022 ICPC网络赛one|2021-2022 ICPC网络赛one]] || Sep/19/2021 || 6/11 ||  &lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:2019-2020_Winter_Petrozavodsk_Camp,_Day_8:_Almost_Algorithmic_Contest&amp;diff=233</id>
		<title>BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:2019-2020_Winter_Petrozavodsk_Camp,_Day_8:_Almost_Algorithmic_Contest&amp;diff=233"/>
		<updated>2021-09-18T14:14:13Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add 2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Replay ==&lt;br /&gt;
&lt;br /&gt;
一开始读 L 题，但没人过，所以没怎么想。&lt;br /&gt;
&lt;br /&gt;
wx多次口胡错误题意！！强烈谴责！！！&lt;br /&gt;
&lt;br /&gt;
然后去学习平面嵌入，但看不懂...&lt;br /&gt;
&lt;br /&gt;
接着开下一题 G，hr推了一个绝妙的柿子，毫无疑问，wa2&lt;br /&gt;
&lt;br /&gt;
然后lz一发猜过，tql！！&lt;br /&gt;
&lt;br /&gt;
然后继续去学平面图&lt;br /&gt;
&lt;br /&gt;
机缘巧合之下，lz翻到了平面图的欧拉公式，然后口胡了一下（我也没听懂，然后就过了&lt;br /&gt;
&lt;br /&gt;
然后开怼H和I，H不会，打表找I的规律，若有若无&lt;br /&gt;
&lt;br /&gt;
最后1h奇思妙想提出了H的错解，想dp到赛终。（居然是贪心&lt;br /&gt;
&lt;br /&gt;
结论：wx，hr缺乏数学常识，&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=232</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=232"/>
		<updated>2021-09-18T14:00:55Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Trainings */ add 2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
| wait to complete ...&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest|2019-2020 Winter Petrozavodsk Camp, Day 8: Almost Algorithmic Contest]] || Sep/18/2021 || 2/12 || . || . || . || . || . || O || O || . || . || . || . || . || .&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=231</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=231"/>
		<updated>2021-09-15T10:01:58Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Trainings */ fix last&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || Ø || . || . || O || . || O || O || Ø || . || . || O || . || Ø&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=230</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=230"/>
		<updated>2021-09-15T10:01:11Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Trainings */ sove The 2020 ICPC Asia Shenyang Regional Programming Contest A,M&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 7/13 || O || . || . || O || . || O || O || Ø || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:The_2020_ICPC_Asia_Shenyang_Regional_Programming_Contest&amp;diff=229</id>
		<title>BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:The_2020_ICPC_Asia_Shenyang_Regional_Programming_Contest&amp;diff=229"/>
		<updated>2021-09-14T14:07:11Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add replay&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
开局G题，前K大和，过了&lt;br /&gt;
&lt;br /&gt;
F hr和wx乱推一通，lzw上场1A&lt;br /&gt;
&lt;br /&gt;
D题构造，暴力打了一坨表，途中看了看K，吃了个饭， 看了看I&lt;br /&gt;
&lt;br /&gt;
发现K不想读，I不会做&lt;br /&gt;
&lt;br /&gt;
之后wx推了了奇偶前缀之类的东西，考虑一下写了个dfs，过了&lt;br /&gt;
&lt;br /&gt;
之后耐心读K，饶了一万年，在hr的描述下，写完了，写代码出大问题，修复后过了&lt;br /&gt;
&lt;br /&gt;
M读题假了后，成功WA 1&lt;br /&gt;
&lt;br /&gt;
最后开了H，hr乱说做法，hang到最后，WA 23, 成功最快补题奖&lt;br /&gt;
&lt;br /&gt;
== Problem A ==&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:The_2020_ICPC_Asia_Shenyang_Regional_Programming_Contest&amp;diff=228</id>
		<title>BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:The_2020_ICPC_Asia_Shenyang_Regional_Programming_Contest&amp;diff=228"/>
		<updated>2021-09-14T12:14:23Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add replay template&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__TOC__&lt;br /&gt;
&lt;br /&gt;
== Replay ==&lt;br /&gt;
&lt;br /&gt;
== Problem A ==&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=227</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=227"/>
		<updated>2021-09-14T12:13:32Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: add shengyang contest&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Shenyang Regional Programming Contest|The 2020 ICPC Asia Shenyang Regional Programming Contest]] || Sep/14/2021 || 5/13 || . || . || . || O || . || O || O || Ø || . || . || O || . || !&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=226</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=226"/>
		<updated>2021-08-25T13:03:26Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: change complate into complete&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complete...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=225</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=225"/>
		<updated>2021-08-22T14:50:00Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: ADD DAY2&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complate...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day2 || [[BreakFast:Namomo Camp Day2|Namomo Camp Day2]] || 9/12 || . || O || O || O || Ø || O || . || O || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=224</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=224"/>
		<updated>2021-08-21T10:09:41Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: /* Weekend Trainings (Summer 2021) */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complate...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || 5/12 || . || O || . || . || . || O || O || O || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
	<entry>
		<id>https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=223</id>
		<title>BreakFast:Front Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.soullan.com/index.php?title=BreakFast:Front_Page&amp;diff=223"/>
		<updated>2021-08-20T15:00:35Z</updated>

		<summary type="html">&lt;p&gt;BreakFast: temp add namomo camp&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Members ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! ID !! Grade&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Zongwei Lan|cfid=liupo|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Haoran Li|cfid=The_Flash_|age=2018}}&lt;br /&gt;
|-&lt;br /&gt;
{{TeamMember|member=Xin Wang|cfid=weiqin|age=2018}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[http://www.weaselcrow.com/pro/cf/team/?h=liupo;weiqin;The_Flash_ Dashboard]&lt;br /&gt;
&lt;br /&gt;
== onsite ==&lt;br /&gt;
&lt;br /&gt;
== Trainings ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Name !! Date !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| [[BreakFast:The 2020 ICPC Asia Macau Regional Contest|The 2020 ICPC Asia Macau Regional Contest]] &amp;lt;sup&amp;gt;[2:1]&amp;lt;/sup&amp;gt; || Jun/05/2021 || 4/12 || O || . || . || O || . || Ø || . || . || . || . || . || O&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Weekend Trainings (Summer 2021) ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Data !! Name !! Solved !! A !! B !! C !! D !! E !! F !! G !! H !! I !! J !! K !! L !! M&lt;br /&gt;
|-&lt;br /&gt;
| Week 1 || [[BreakFast:The 15th Chinese Northeast Collegiate Programming Contest|The 15th Chinese Northeast Collegiate Programming Contest]]|| 8/13 || O || . || O || Ø || O || . || . || . || O || O || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 2 || [[BreakFast:2020-2021 ICPC Southeastern European Regional Programming Contest|2020-2021 ICPC Southeastern European Regional Programming Contest]]|| 4/13 || . || O || . || . || O || . || . || . || . || . || . || Ø || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 3 || [[BreakFast:2020-2021 ICPC Southwestern European Regional Contest|2020-2021 ICPC Southwestern European Regional Contest]]|| 7/13 || O || . ||O || O || O || . || . || Ø || Ø || . || O || . || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 4 ||  [[BreakFast:2021年“美团杯”程序设计挑战赛|2021年“美团杯”程序设计挑战赛]]|| 2/13 || . || . || . || . || . || . || . || . || . || . || O || . || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 5 ||  [[BreakFast:2021牛客暑期多校训练营1|2021牛客暑期多校训练营1]] || 6/11 || O || O || . || O || . || O || Ø || O || . || . || . &lt;br /&gt;
|-&lt;br /&gt;
| Week 6 ||  [[BreakFast:2021牛客暑期多校训练营2|2021牛客暑期多校训练营2]] || 5/12 || . || . || O || O || . || O || . || . || O || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营1|2021“MINIEYE杯”中国大学生算法设计超级联赛1]] || 10/11 || O || . || Ø || Ø || O || O || Ø || O || O || Ø || Ø&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021HDU暑期多校训练营2|2021“MINIEYE杯”中国大学生算法设计超级联赛2]] || 7/12 || O || Ø || . || Ø || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 6 || [[BreakFast:2021牛客暑期多校训练营3|2021牛客暑期多校训练营3]] || 4/10 || . || Ø || . || . || O || Ø || . || . || . || O &lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021牛客暑期多校训练营4|2021牛客暑期多校训练营4]] || 4/10 || . || . || O || . || . || O || . || . || O || O&lt;br /&gt;
|-&lt;br /&gt;
| Week 7 || [[BreakFast:2021HDU暑期多校训练营3|2021“MINIEYE杯”中国大学生算法设计超级联赛3]] || 3/12 || . || . || . || O || . || . || O || . || . || . || O || .&lt;br /&gt;
|-&lt;br /&gt;
| so many contests wait to complate...&lt;br /&gt;
|-&lt;br /&gt;
| Namomo Camp Day1 || [[BreakFast:Namomo Camp Day1|Namomo Camp Day1]] || ?/? ||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Comment:&lt;br /&gt;
* O for passing during the contest&lt;br /&gt;
* Ø for passing after the contest&lt;br /&gt;
* ! for attempted but failed&lt;br /&gt;
* · for having not attempted yet&lt;br /&gt;
* [X:Y] for non-standard contest (X people use Y computer)&lt;br /&gt;
&lt;br /&gt;
== Personal ==&lt;br /&gt;
&lt;br /&gt;
* lzw: [[BreakFast:lzw|Personal]]&lt;br /&gt;
* lhr: [[BreakFast:lhr|Personal]]&lt;br /&gt;
* wx: [[BreakFast:wx|Personal]]&lt;/div&gt;</summary>
		<author><name>BreakFast</name></author>
	</entry>
</feed>