<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[GJLfly的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/GJLfly</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; GJLfly]]></copyright><item><title><![CDATA[Counting Divisors HDU - 6069]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/89761794</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/89761794</guid><author>GJLfly</author><pubDate>Thu, 02 May 2019 15:27:27 +0800</pubDate><description><![CDATA[In mathematics, the functiond(n)d(n)denotes the number of divisors of positive integernn.
For example,d(12)=6d(12)=6because1,2,3,4,6,121,2,3,4,6,12are all1212's divisors.
In this problem, gi...]]></description><category></category></item><item><title><![CDATA[三类博弈]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/89096588</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/89096588</guid><author>GJLfly</author><pubDate>Mon, 08 Apr 2019 17:32:27 +0800</pubDate><description><![CDATA[巴什博奕：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。

保持给对手留下k（m+1），就可获胜。就是说谁面对k*（m+1）的情况谁输


int m,n;
scanf("%d%d",&amp;n,&amp;m);
if(n%(m+1)==0)
    puts("No");
else
    puts("YES");

威佐夫博奕：有两堆各若干个物...]]></description><category></category></item><item><title><![CDATA[扩展欧几里得]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/88997698</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/88997698</guid><author>GJLfly</author><pubDate>Wed, 03 Apr 2019 16:26:30 +0800</pubDate><description><![CDATA[看了这篇博客才稍微理解http://www.cnblogs.com/frog112111/archive/2012/08/19/2646012.html

感恩。

在此附上自己理解，加深记忆。



扩展欧几里得

基本算法：对于不完全为 0 的非负整数 a，b，必然存在整数对 x，y ，使得 gcd（a，b）=ax+by。（gcd即a，b的最大公约数）

证明：

1. b=0时，gcd（a...]]></description><category></category></item><item><title><![CDATA[数位dp例题（不要62）]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/88957469</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/88957469</guid><author>GJLfly</author><pubDate>Mon, 01 Apr 2019 21:33:48 +0800</pubDate><description><![CDATA[杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。
杭州交通管理局经常会扩充一些的士车牌照，新近出来一个好消息，以后上牌照，不再含有不吉利的数字了，这样一来，就可以消除个别的士司机和乘客的心理障碍，更安全地服务大众。
不吉利的数字为所有含有4或62的号码。例如：
62315 73418 88914
都属于不吉利号码。但是，61152虽然含有6和2，但不是62连号，所以不属于不吉利数字之...]]></description><category></category></item><item><title><![CDATA[历届试题 k倍区间]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/88741313</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/88741313</guid><author>GJLfly</author><pubDate>Fri, 22 Mar 2019 15:02:47 +0800</pubDate><description><![CDATA[问题描述

　　给定一个长度为N的数列，A1, A2, ... AN，如果其中一段连续的子序列Ai, Ai+1, ... Aj(i &lt;= j)之和是K的倍数，我们就称这个区间[i, j]是K倍区间。
　　你能求出数列中总共有多少个K倍区间吗？

输入格式

　　第一行包含两个整数N和K。(1 &lt;= N, K &lt;= 100000)
　　以下N行每行包含一个整数Ai。(1 &lt;=...]]></description><category></category></item><item><title><![CDATA[历届试题 地宫取宝]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/88687845</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/88687845</guid><author>GJLfly</author><pubDate>Wed, 20 Mar 2019 14:33:37 +0800</pubDate><description><![CDATA[问题描述

　　X 国王有一个地宫宝库。是 n x m 个格子的矩阵。每个格子放一件宝贝。每个宝贝贴着价值标签。
　　地宫的入口在左上角，出口在右下角。
　　小明被带到地宫的入口，国王要求他只能向右或向下行走。
　　走过某个格子时，如果那个格子中的宝贝价值比小明手中任意宝贝价值都大，小明就可以拿起它（当然，也可以不拿）。
　　当小明走到出口时，如果他手中的宝贝恰好是k件，则这些宝贝就可以送给小明。...]]></description><category></category></item><item><title><![CDATA[LightOJ - 1259    Goldbach`s Conjecture]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/82319732</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/82319732</guid><author>GJLfly</author><pubDate>Sun, 02 Sep 2018 21:44:18 +0800</pubDate><description><![CDATA[Goldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:

Every even integer, greater than 2, can be expressed as the sum of two primes [1].
...]]></description><category></category></item><item><title><![CDATA[51Nod - 1201   整数划分]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/82319664</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/82319664</guid><author>GJLfly</author><pubDate>Sun, 02 Sep 2018 21:36:57 +0800</pubDate><description><![CDATA[将N分为若干个不同整数的和，有多少种不同的划分方式，例如：n = 6，{6} {1,5} {2,4} {1,2,3}，共4种。由于数据较大，输出Mod 10^9 + 7的结果即可。

Input

输入1个数N(1 &amp;lt;= N &amp;lt;= 50000)。

Output

输出划分的数量Mod 10^9 + 7。

Sample Input


6

Sample Output


4

题解...]]></description><category></category></item><item><title><![CDATA[HDU - 1251    统计难题]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/82319128</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/82319128</guid><author>GJLfly</author><pubDate>Sun, 02 Sep 2018 20:58:12 +0800</pubDate><description><![CDATA[Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).

Input

输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行一个提问,每个提问都是一个字符串.
注意:...]]></description><category></category></item><item><title><![CDATA[Farey Sequence]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/82119539</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/82119539</guid><author>GJLfly</author><pubDate>Mon, 27 Aug 2018 21:42:22 +0800</pubDate><description><![CDATA[The Farey Sequence Fn for any integer n with n &amp;gt;= 2 is the set of irreducible rational numbers a/b with 0 &amp;lt; a &amp;lt; b &amp;lt;= n and gcd(a,b) = 1 arranged in increasing order. The first few are
F2 =...]]></description><category></category></item><item><title><![CDATA[Bi-shoe and Phi-shoe]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/82117663</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/82117663</guid><author>GJLfly</author><pubDate>Mon, 27 Aug 2018 19:14:25 +0800</pubDate><description><![CDATA[Bamboo Pole-vault is a massively popular sport in Xzhiland. And Master Phi-shoe is a very popular coach for his success. He needs some bamboos for his students, so he asked his assistant Bi-Shoe to go...]]></description><category></category></item><item><title><![CDATA[HDU - 1087   Super Jumping! Jumping! Jumping!]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/82084620</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/82084620</guid><author>GJLfly</author><pubDate>Sun, 26 Aug 2018 21:21:08 +0800</pubDate><description><![CDATA[Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now.




The game c...]]></description><category></category></item><item><title><![CDATA[CodeForces - 645D    Robot Rapping Results Report]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/82084355</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/82084355</guid><author>GJLfly</author><pubDate>Sun, 26 Aug 2018 21:12:53 +0800</pubDate><description><![CDATA[While Farmer John rebuilds his farm in an unfamiliar portion of Bovinia, Bessie is out trying some alternative jobs. In her new gig as a reporter, Bessie needs to know about programming competition re...]]></description><category></category></item><item><title><![CDATA[HDU - 1226    超级密码]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/82054201</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/82054201</guid><author>GJLfly</author><pubDate>Sun, 26 Aug 2018 20:49:40 +0800</pubDate><description><![CDATA[Ignatius花了一个星期的时间终于找到了传说中的宝藏,宝藏被放在一个房间里,房间的门用密码锁起来了,在门旁边的墙上有一些关于密码的提示信息:
密码是一个C进制的数,并且只能由给定的M个数字构成,同时密码是一个给定十进制整数N(0&amp;lt;=N&amp;lt;=5000)的正整数倍(如果存在多个满足条件的数,那么最小的那个就是密码),如果这样的密码存在,那么当你输入它以后门将打开,如果不存在这样的密码.....]]></description><category></category></item><item><title><![CDATA[POJ - 2342    Anniversary party]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/82054206</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/82054206</guid><author>GJLfly</author><pubDate>Sun, 26 Aug 2018 20:40:49 +0800</pubDate><description><![CDATA[There is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the supervisor relation forms a tr...]]></description><category></category></item><item><title><![CDATA[UVA - 712    S-Trees]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/82054264</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/82054264</guid><author>GJLfly</author><pubDate>Sun, 26 Aug 2018 20:34:01 +0800</pubDate><description><![CDATA[A Strange Tree (S-tree) over the variable set Xn = {x1,x2,...,xn} is a binary tree representing a Boolean function f : {0,1}n → {0,1}. Each path of the S-tree begins at the root node and consists of n...]]></description><category></category></item><item><title><![CDATA[HDU - 6375    度度熊学队列]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/82083759</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/82083759</guid><author>GJLfly</author><pubDate>Sun, 26 Aug 2018 20:15:06 +0800</pubDate><description><![CDATA[度度熊正在学习双端队列，他对其翻转和合并产生了很大的兴趣。
初始时有 NN 个空的双端队列（编号为 11 到 NN ），你要支持度度熊的 QQ 次操作。
①11 uu ww valval 在编号为 uu 的队列里加入一个权值为 valval 的元素。（w=0w=0 表示加在最前面，w=1w=1 表示加在最后面）。
②22 uu ww 询问编号为 uu 的队列里的某个元素并删除它。（ w=0w=0 ...]]></description><category></category></item><item><title><![CDATA[UVA - 548    Tree]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/82083637</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/82083637</guid><author>GJLfly</author><pubDate>Sun, 26 Aug 2018 19:58:50 +0800</pubDate><description><![CDATA[You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of a path is the sum o...]]></description><category></category></item><item><title><![CDATA[HDU - 1622    Trees on the level]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/82083505</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/82083505</guid><author>GJLfly</author><pubDate>Sun, 26 Aug 2018 19:46:53 +0800</pubDate><description><![CDATA[Trees are fundamental in many branches of computer science. Current state-of-the art parallel computers such as Thinking Machines' CM-5 are based on fat trees. Quad- and octal-trees are fundamental to...]]></description><category></category></item><item><title><![CDATA[The Falling Leaves]]></title><link>https://blog.youkuaiyun.com/GJLfly/article/details/81913583</link><guid>https://blog.youkuaiyun.com/GJLfly/article/details/81913583</guid><author>GJLfly</author><pubDate>Wed, 22 Aug 2018 18:50:11 +0800</pubDate><description><![CDATA[Each year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the trees. If the same thing ha...]]></description><category></category></item></channel></rss>