<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[JSMSG]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/JSMSG</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; JSMSG]]></copyright><item><title><![CDATA[1020 Tree Traversals]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/81981706</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/81981706</guid><author>JSMSG</author><pubDate>Thu, 23 Aug 2018 15:26:40 +0800</pubDate><description><![CDATA[Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the cor...]]></description><category></category></item><item><title><![CDATA[Joseph]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/81156641</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/81156641</guid><author>JSMSG</author><pubDate>Sun, 22 Jul 2018 17:46:30 +0800</pubDate><description><![CDATA[HDU1443 Joseph 

题目大意:已知n个人围成一个圈,对他们进行编号从0到n-1，从编号为0开始报数，报到m的出列，下一个继续从一开始报数，现在有k个好(编号为0~k-1)和坏人(编号为k~n-1),求使k个坏人全部死掉m最小要取多大；

思路：一开始我是用暴力的方法直接枚举模拟，然后时间超限了，参考了https://blog.youkuaiyun.com/unin88/article/detai...]]></description><category></category></item><item><title><![CDATA[Radix]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/81084096</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/81084096</guid><author>JSMSG</author><pubDate>Tue, 17 Jul 2018 16:41:59 +0800</pubDate><description><![CDATA[1010 Radix (25)（25 分）

Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is &quot;yes&quot;, if 6 is a decimal number and 110 is a binary number.

Now for ...]]></description><category></category></item><item><title><![CDATA[Counting Leaves]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/81054933</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/81054933</guid><author>JSMSG</author><pubDate>Sun, 15 Jul 2018 17:24:41 +0800</pubDate><description><![CDATA[1004 Counting Leaves (30)（30 分）A family hierarchy is usually presented by a pedigree tree. Your job isto count those family members who have no child.InputEach input file contains one test case. Each ...]]></description><category></category></item><item><title><![CDATA[Emergency]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/81053584</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/81053584</guid><author>JSMSG</author><pubDate>Sun, 15 Jul 2018 15:45:21 +0800</pubDate><description><![CDATA[1003 Emergency (25)（25 分）As an emergency rescue team leader of a city, you are given a specialmap of your country. The map shows several scattered cities connected bysome roads. Amount of rescue teams...]]></description><category></category></item><item><title><![CDATA[AtCoder Regular Contest 092-C]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79601538</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79601538</guid><author>JSMSG</author><pubDate>Sun, 18 Mar 2018 16:47:57 +0800</pubDate><description><![CDATA[昨晚的比赛，只做了一题，还是记录一下吧；链接：https://arc092.contest.atcoder.jp/tasks/arc092_a题目大意：有n个点(a[i].x,a[i].y)和n个点(b[i].x,b[i].y)求可以取多少对(a[i].x,a[i].y),(b[i].x,b[i].y)其中a[i].x&amp;lt;b[i].c,a[i].y&amp;lt;b[i].y,不可重复取点；(为了与代...]]></description><category></category></item><item><title><![CDATA[食物链 (POJ-1182)]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79328625</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79328625</guid><author>JSMSG</author><pubDate>Thu, 15 Feb 2018 16:56:43 +0800</pubDate><description><![CDATA[种类并差集：参见http://www.cnblogs.com/kuangbin/archive/2013/04/02/2996358.html；动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。有人用两种说法对这N个动物所构成的食物链关系进行描述： 第一种说法是...]]></description><category></category></item><item><title><![CDATA[Find them, Catch them(POJ-1703)]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79308606</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79308606</guid><author>JSMSG</author><pubDate>Sun, 11 Feb 2018 10:01:33 +0800</pubDate><description><![CDATA[DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to ident...]]></description><category></category></item><item><title><![CDATA[Play on Words(HDU-1116)]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79305590</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79305590</guid><author>JSMSG</author><pubDate>Sat, 10 Feb 2018 16:49:37 +0800</pubDate><description><![CDATA[Problem DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the ...]]></description><category></category></item><item><title><![CDATA[牛客练习赛12]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79303078</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79303078</guid><author>JSMSG</author><pubDate>Sat, 10 Feb 2018 09:05:04 +0800</pubDate><description><![CDATA[A-圆圆链接：https://www.nowcoder.net/acm/contest/68/A题目描述我们定义一个圆 C 为以原点 (0, 0) 为中心的单位圆(半径为 1 的圆)。给定在 C 圆周上相异的两点A, B。请问由 A 出发，沿着圆周走到 B，是顺时针走比较近，还是逆时针走比较近呢？C 的圆周上的所有点都可以用 (cos(t), sin(t)) 来表示，其中 t 的物理意义为角度。也...]]></description><category></category></item><item><title><![CDATA[Wormholes（POJ-3259)]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79277346</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79277346</guid><author>JSMSG</author><pubDate>Wed, 07 Feb 2018 10:43:37 +0800</pubDate><description><![CDATA[While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that i]]></description><category></category></item><item><title><![CDATA[漫步校园（HDU-1248）]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79271676</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79271676</guid><author>JSMSG</author><pubDate>Tue, 06 Feb 2018 16:11:15 +0800</pubDate><description><![CDATA[Problem Description

LL最近沉迷于AC不能自拔，每天寝室、机房两点一线。由于长时间坐在电脑边，缺乏运动。他决定充分利用每次从寝室到机房的时间，在校园里散散步。整个HDU校园呈方形布局，可划分为n*n个小方格，代表各个区域。例如LL居住的18号宿舍位于校园的西北角，即方格(1,1)代表的地方，而机房所在的第三实验楼处于东南端的(n,n)。因有多条路线可以选择，LL希望每次的]]></description><category></category></item><item><title><![CDATA[Sum It Up(HDU-1258)]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79238026</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79238026</guid><author>JSMSG</author><pubDate>Fri, 02 Feb 2018 13:34:45 +0800</pubDate><description><![CDATA[Problem Description

Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [4,3,2,2,1,1],]]></description><category></category></item><item><title><![CDATA[Lake Counting(POJ-2386)]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79236126</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79236126</guid><author>JSMSG</author><pubDate>Fri, 02 Feb 2018 10:28:45 +0800</pubDate><description><![CDATA[Description

Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains]]></description><category></category></item><item><title><![CDATA[Rescue(HDU-1242)]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79235224</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79235224</guid><author>JSMSG</author><pubDate>Fri, 02 Feb 2018 09:16:26 +0800</pubDate><description><![CDATA[Problem Description

Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M 

Angel's friends want to save Angel. Their task is: approach Angel.]]></description><category></category></item><item><title><![CDATA[Additive equations (ZOJ-1204)]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79226088</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79226088</guid><author>JSMSG</author><pubDate>Thu, 01 Feb 2018 11:38:41 +0800</pubDate><description><![CDATA[We all understand that an integer set is a collection of distinct integers. Now the question is: given an integer set, can you find all its addtive equations? To explain what an additive equation is, ]]></description><category></category></item><item><title><![CDATA[逃离迷宫(HDU-1728)]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79206413</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79206413</guid><author>JSMSG</author><pubDate>Tue, 30 Jan 2018 15:16:53 +0800</pubDate><description><![CDATA[Problem Description

　　给定一个m × n (m行, n列)的迷宫，迷宫中有两个位置，gloria想从迷宫的一个位置走到另外一个位置，当然迷宫中有些地方是空地，gloria可以穿越，有些地方是障碍，她必须绕行，从迷宫的一个位置，只能走到与它相邻的4个位置中,当然在行走过程中，gloria不能走到迷宫外面去。令人头痛的是，gloria是个没什么方向感的人，因此，她在行走过程]]></description><category></category></item><item><title><![CDATA[Prime Ring Problem(HDU-1016)]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79193392</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79193392</guid><author>JSMSG</author><pubDate>Mon, 29 Jan 2018 11:34:30 +0800</pubDate><description><![CDATA[Problem Description

A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime]]></description><category></category></item><item><title><![CDATA[N皇后问题(HDU-2553)]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79192603</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79192603</guid><author>JSMSG</author><pubDate>Mon, 29 Jan 2018 11:04:27 +0800</pubDate><description><![CDATA[Problem Description

在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。
你的任务是，对于给定的N，求出有多少种合法的放置方法。



 


Input

共有若干行，每行一个正整数N≤10，表示棋盘和皇后的数量；如果N=0，表示结束。

 


Output]]></description><category></category></item><item><title><![CDATA[Vampire Numbers(HDU-4235)]]></title><link>https://blog.youkuaiyun.com/JSMSG/article/details/79171838</link><guid>https://blog.youkuaiyun.com/JSMSG/article/details/79171838</guid><author>JSMSG</author><pubDate>Fri, 26 Jan 2018 14:19:17 +0800</pubDate><description><![CDATA[Problem Description

The number 1827 is an interesting number, because 1827=21*87, and all of the same digits appear on both sides of the ‘=’. The number 136948 has the same property: 136948=146*938]]></description><category></category></item></channel></rss>