<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Gregory99174的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Gregory99174</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Gregory99174]]></copyright><item><title><![CDATA[【POJ2094】【差分序列】Angry Teacher]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831796</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831796</guid><author>Gregory99174</author><pubDate>Thu, 02 Apr 2015 08:11:00 +0800</pubDate><description><![CDATA[Description
Mr. O'Cruel is teaching Math to ninth grade students. Students of course are very lazy, so they do not like to do their homework. On the other side, Mr. O'Cruel doesn't like lazy stu...]]></description><category></category></item><item><title><![CDATA[【BZOJ2793】【数学】[Poi2012]Vouchers]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831797</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831797</guid><author>Gregory99174</author><pubDate>Wed, 01 Apr 2015 22:44:00 +0800</pubDate><description><![CDATA[Description

考虑正整数集合，现在有n组人依次来取数，假设第i组来了x人，他们每个取的数一定是x的倍数，并且是还剩下的最小的x个。
正整数中有m个数被标成了幸运数，问有哪些人取到了幸运数。



Input

第一行一个正整数m (m&lt;=1,000,000)，下面m行每行一个正整数x (x&lt;=1,000,000)，表示x是一个幸运数。
接下来一...]]></description><category></category></item><item><title><![CDATA[【BZOJ1042】【DP + 容斥】[HAOI2008]硬币购物]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831798</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831798</guid><author>Gregory99174</author><pubDate>Wed, 01 Apr 2015 21:51:00 +0800</pubDate><description><![CDATA[Description

硬币购物一共有4种硬币。面值分别为c1,c2,c3,c4。某人去商店买东西，去了tot次。每次带di枚ci硬币，买si的价值的东西。请问每次有多少种付款方法。

Input

第一行 c1,c2,c3,c4,tot 下面tot行 d1,d2,d3,d4,s

Output

每次的方法数

Sample Input
1 2 5 10 2...]]></description><category></category></item><item><title><![CDATA[【CF492E】【数学】Vanya and Field]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831795</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831795</guid><author>Gregory99174</author><pubDate>Wed, 01 Apr 2015 21:37:00 +0800</pubDate><description><![CDATA[Vanya decided to walk in the field of size n × n cells. The field contains m apple trees, the i-th apple tree is at the cell with coordinates (xi, yi). Vanya moves towards vector (dx, dy). That...]]></description><category></category></item><item><title><![CDATA[【CF493E】【数学】Vasya and Polynomial]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831624</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831624</guid><author>Gregory99174</author><pubDate>Wed, 01 Apr 2015 21:00:00 +0800</pubDate><description><![CDATA[Vasya is studying in the last class of school and soon he will take exams. He decided to study polynomials. Polynomial is a function P(x) = a0 + a1x1 + ... + anxn. Numbers ai are called coeffic...]]></description><category></category></item><item><title><![CDATA[【BZOJ3529】【莫比乌斯反演 + 树状数组】[Sdoi2014]数表]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831622</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831622</guid><author>Gregory99174</author><pubDate>Wed, 01 Apr 2015 10:35:00 +0800</pubDate><description><![CDATA[Description

 有一张N×m的数表，其第i行第j列（1 &lt; =i &lt; =礼，1 &lt; =j &lt; =m）的数值为
能同时整除i和j的所有自然数之和。给定a，计算数表中不大于a的数之和。

















Input

 输入包含多组数据。
 输入的第一行一个整数Q表示测试点内...]]></description><category></category></item><item><title><![CDATA[【BZOJ3270】【高斯消元】博物馆]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831618</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831618</guid><author>Gregory99174</author><pubDate>Tue, 31 Mar 2015 22:36:00 +0800</pubDate><description><![CDATA[Description

　　有一天Petya和他的朋友Vasya在进行他们众多旅行中的一次旅行，他们决定去参观一座城堡博物馆。这座博物馆有着特别的样式。它包含由m条走廊连接的n间房间，并且满足可以从任何一间房间到任何一间别的房间。
两个人在博物馆里逛了一会儿后两人决定分头行动，去看各自感兴趣的艺术品。他们约定在下午六点到一间房间会合。然而他们忘记了一件重要的事：他们并没有选好在哪...]]></description><category></category></item><item><title><![CDATA[【CODECHEF】【phollard rho + miller_rabin】The First Cube]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831619</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831619</guid><author>Gregory99174</author><pubDate>Tue, 31 Mar 2015 21:26:00 +0800</pubDate><description><![CDATA[All submissions for this problem are available.
Read problems statements in Mandarin Chinese  and Russian.
This problem's statement is really a short one.
You are given an integer S. Conside...]]></description><category></category></item><item><title><![CDATA[【BZOJ3884】【降幂大法】上帝与集合的正确用法]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831593</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831593</guid><author>Gregory99174</author><pubDate>Tue, 31 Mar 2015 20:32:00 +0800</pubDate><description><![CDATA[Description

根据一些书上的记载，上帝的一次失败的创世经历是这样的：
第一天， 上帝创造了一个世界的基本元素，称做“元”。
第二天， 上帝创造了一个新的元素，称作“α”。“α”被定义为“元”构成的集合。容易发现，一共有两种不同的“α”。
第三天， 上帝又创造了一个新的元素，称作“β”。“β”被定义为“α”构成的集合。容易发现，一共有四种不同的“β”。
第四天， 上...]]></description><category></category></item><item><title><![CDATA[【CF521C】【排列组合】Pluses everywhere]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831592</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831592</guid><author>Gregory99174</author><pubDate>Tue, 31 Mar 2015 20:06:00 +0800</pubDate><description><![CDATA[Vasya is sitting on an extremely boring math class. To have fun, he took a piece of paper and wrote out nnumbers on a single line. After that, Vasya began to write out different ways ...]]></description><category></category></item><item><title><![CDATA[【BZOJ1875】【矩阵乘法】[SDOI2009]HH去散步]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831616</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831616</guid><author>Gregory99174</author><pubDate>Tue, 31 Mar 2015 17:16:00 +0800</pubDate><description><![CDATA[Description
HH有个一成不变的习惯，喜欢饭后百步走。所谓百步走，就是散步，就是在一定的时间 内，走过一定的距离。 但是同时HH又是个喜欢变化的人，所以他不会立刻沿着刚刚走来的路走回。 又因为HH是个喜欢变化的人，所以他每天走过的路径都不完全一样，他想知道他究竟有多 少种散步的方法。 现在给你学校的地图（假设每条路的长度都是一样的都是1），问长度为t，从给定地 点A走到给定地...]]></description><category></category></item><item><title><![CDATA[【POJ1707】【伯努利数】Sum of powers]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831615</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831615</guid><author>Gregory99174</author><pubDate>Tue, 31 Mar 2015 09:07:00 +0800</pubDate><description><![CDATA[Description
A young schoolboy would like to calculate the sum 
for some fixed natural k and different natural n. He observed that calculating ik
 for all i (1&lt;=i&lt;=n) and summing up resul...]]></description><category></category></item><item><title><![CDATA[【BZOJ3456】【CDQ分治+FNT】城市规划]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831613</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831613</guid><author>Gregory99174</author><pubDate>Mon, 30 Mar 2015 20:09:00 +0800</pubDate><description><![CDATA[试题来源
　　2013中国国家集训队第二次作业


问题描述
　　刚刚解决完电力网络的问题, 阿狸又被领导的任务给难住了.
　　刚才说过, 阿狸的国家有n个城市, 现在国家需要在某些城市对之间建立一些贸易路线, 使得整个国家的任意两个城市都直接或间接的连通.
　　为了省钱, 每两个城市之间最多只能有一条直接的贸易路径. 对于两个建立路线的方案, 如果存在一个城市对, 在...]]></description><category></category></item><item><title><![CDATA[【HDU1402】【FNT版】A * B Problem Plus]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831614</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831614</guid><author>Gregory99174</author><pubDate>Mon, 30 Mar 2015 17:51:00 +0800</pubDate><description><![CDATA[Problem Description
Calculate A * B.


Input
Each line will contain two integers A and B. Process to end of file.Note: the length of each integer will not exceed 50000.

Output
For eac...]]></description><category></category></item><item><title><![CDATA[【BZOJ3527】【FFT】力]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831612</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831612</guid><author>Gregory99174</author><pubDate>Mon, 30 Mar 2015 11:46:00 +0800</pubDate><description><![CDATA[【问题描述】给出n个数qi，给出Fj的定义如下：令Ei=Fi/qi。试求Ei。【输入格式】输入文件force.in包含一个整数n，接下来n行每行输入一个数，第i行表示qi。【输出格式】输出文件force.out有n行，第i行输出Ei。与标准答案误差不超过1e-2即可。【样例输入】54006373.88518415375036.4357591717456.4691448514941.004...]]></description><category></category></item><item><title><![CDATA[【清橙A1094】【牛顿迭代法】牛顿迭代法求方程的根]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831611</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831611</guid><author>Gregory99174</author><pubDate>Mon, 30 Mar 2015 08:36:00 +0800</pubDate><description><![CDATA[问题描述
　　给定三次函数f(x)=ax3+bx2+cx+d的4个系数a，b，c，d，以及一个数z，请用牛顿迭代法求出函数f(x)=0在z附近的根，并给出迭代所需要次数。
　　牛顿迭代法的原理如下（参考下图）：
　　设xk是方程f(x)=0的精确解x*附近的一个猜测解，过点Pk(xk,f(xk))作f(x)的切线。该切线与x轴的交点比xk更接近方程的精确解程x*。
　　迭代公...]]></description><category></category></item><item><title><![CDATA[【清橙A1084】【FFT】快速傅里叶变换]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831609</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831609</guid><author>Gregory99174</author><pubDate>Mon, 30 Mar 2015 07:48:00 +0800</pubDate><description><![CDATA[问题描述
　　离散傅立叶变换在信号处理中扮演者重要的角色。利用傅立叶变换，可以实现信号在时域和频域之间的转换。
　　对于一个给定的长度为n=2m (m为整数) 的复数序列X0, X1, …, Xn-1，离散傅立叶变换将得到另一个长度为n的复数序列Y0, Y1, …, Yn-1。其中
　　Yi=X0+X1wi+ X2w2i+ X3w3i+…+ Xn-1w(n-1)i
　　其中w...]]></description><category></category></item><item><title><![CDATA[【HDU1402】【FFT】A * B Problem Plus]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831610</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831610</guid><author>Gregory99174</author><pubDate>Sun, 29 Mar 2015 20:21:00 +0800</pubDate><description><![CDATA[Problem Description
Calculate A * B.
Input
Each line will contain two integers A and B. Process to end of file.Note: the length of each integer will not exceed 50000.
Output
For each case, o...]]></description><category></category></item><item><title><![CDATA[【POJ1811】【miller_rabin + pollard rho + 快速乘】Prime Test]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831608</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831608</guid><author>Gregory99174</author><pubDate>Fri, 27 Mar 2015 19:04:00 +0800</pubDate><description><![CDATA[Description
Given a big integer number, you are required to find out whether it's a prime number.
Input
The first line contains the number of test cases T (1 &lt;= T &lt;= 20 ), then the follo...]]></description><category></category></item><item><title><![CDATA[【FJOI2014】【偏导+数学】病毒防护带]]></title><link>https://blog.youkuaiyun.com/Gregory99174/article/details/101831607</link><guid>https://blog.youkuaiyun.com/Gregory99174/article/details/101831607</guid><author>Gregory99174</author><pubDate>Fri, 27 Mar 2015 15:55:00 +0800</pubDate><description><![CDATA[转载：http://trinklee.blog.163.com/blog/static/23815806020150155296528/
问题描述:
众所周知，在国王胖哥的带领下，K国国泰民安，空前繁荣，但今天K国却遇到了空前的危机。
在K国境内同时发现了n个未知的病毒，每个病毒会从它被发现的位置开始感染K国的土地，K国可以看做是一个无限大的二维平面，而病毒的感染形状可以看做是一个...]]></description><category></category></item></channel></rss>