<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[swust0137的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/swust0137</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; swust0137]]></copyright><item><title><![CDATA[SWUSTOJ 0480 Locker Doors]]></title><link>https://blog.youkuaiyun.com/swust0137/article/details/89812013</link><guid>https://blog.youkuaiyun.com/swust0137/article/details/89812013</guid><author>swust0137</author><pubDate>Sat, 04 May 2019 11:51:51 +0800</pubDate><description><![CDATA[问题描述：
There are n lockers in a hallway numbered sequentially from 1 to n. Initially, all the locker doors are closed. You make n passes by the lockers, each time starting with locker #1. On the ith pa...]]></description><category></category></item></channel></rss>