﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-coreBugZJ-随笔分类-数学</title><link>http://www.cppblog.com/coreBugZJ/category/16341.html</link><description>考研2013________静修________QQ 466577437</description><language>zh-cn</language><lastBuildDate>Tue, 05 Jun 2012 20:51:53 GMT</lastBuildDate><pubDate>Tue, 05 Jun 2012 20:51:53 GMT</pubDate><ttl>60</ttl><item><title>POJ 1067 取石子游戏</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177481.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Mon, 04 Jun 2012 08:05:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177481.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177481.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177481.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177481.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177481.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 博弈论的问题，需要证明一些结论。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177481.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177481.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-04 16:05 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177481.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 2068 Nim</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177480.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Mon, 04 Jun 2012 08:03:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177480.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177480.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177480.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177480.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177480.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 博弈DP ，记忆化搜索。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177480.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177480.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-04 16:03 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177480.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 2975 Nim</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177479.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Mon, 04 Jun 2012 08:01:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177479.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177479.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177479.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177479.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177479.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 经典 Nim 博弈。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177479.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177479.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-04 16:01 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/04/177479.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 3696 The Luckiest number</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177110.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 01 Jun 2012 13:32:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177110.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177110.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177110.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177110.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177110.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 给一个数N(1<=N<=2000000000);问是否存在N的倍数M，且M的各个位全部由8组成，如果存在多个取最小的 M 并输出M由几个8组成。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177110.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177110.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-01 21:32 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177110.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 3604 Professor Ben</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177109.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 01 Jun 2012 13:30:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177109.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177109.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177109.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177109.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177109.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 求整数的所有的因子的因子数的立方和。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177109.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177109.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-01 21:30 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177109.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1117 剩余定理</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177108.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 01 Jun 2012 13:27:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177108.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177108.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177108.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177108.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177108.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 求正整数中满足：X mod a[0] = b[0], X mod a[1] = b[1], X mod a[2] = b[2], …, X mod a[i] = b[i], … 的最小解。a[i]是一些两两互质的正整数。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177108.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177108.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-01 21:27 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177108.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1056 线性同余方程</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177107.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 01 Jun 2012 13:26:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177107.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/177107.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177107.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/177107.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/177107.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 形如ax≡b(mod m) 的方程，称为线性同余方程。编写程序求解线性同余方程（基于欧几里德算法）。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177107.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/177107.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-06-01 21:26 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/06/01/177107.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 3090. Visible Lattice Points</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/02/29/166813.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Wed, 29 Feb 2012 13:16:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/02/29/166813.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/166813.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/02/29/166813.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/166813.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/166813.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Farey 数列，欧拉函数 。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/02/29/166813.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/166813.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-02-29 21:16 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/02/29/166813.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>EOJ 1852. Ordered Fractions</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/02/29/166810.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Wed, 29 Feb 2012 11:33:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/02/29/166810.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/166810.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/02/29/166810.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/166810.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/166810.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 初级 Farey 数列的问题。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/02/29/166810.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/166810.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-02-29 19:33 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/02/29/166810.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>填补空缺——压缩感知 （转）</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/01/27/164578.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 27 Jan 2012 07:48:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/01/27/164578.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/164578.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/01/27/164578.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/164578.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/164578.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 压缩感知从字面上看起来，好像是数据压缩的意思，而实则出于完全不同的考虑。经典的数据压缩技术，无论是音频压缩（例如 mp3），图像压缩（例如 jpeg），视频压缩（mpeg），还是一般的编码压缩（zip），都是从数据本身的特性出发，寻找并剔除数据中隐含的冗余度，从而达到压缩的目的。这样的压缩有两个特点：第一、它是发生在数据已经被完整采集到之后；第二、它本身需要复杂的算法来完成。相较而言，解码过程反而一般来说在计算上比较简单，以音频压缩为例，压制一个 mp3 文件的计算量远大于播放（即解压缩）一个 mp3 文件的计算量。<br>稍加思量就会发现，这种压缩和解压缩的不对称性正好同人们的需求是相反的。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/01/27/164578.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/164578.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-01-27 15:48 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/01/27/164578.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>死理性派是怎样判断漂亮女孩是不是单身的？ （转）</title><link>http://www.cppblog.com/coreBugZJ/archive/2012/01/07/163797.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sat, 07 Jan 2012 10:42:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2012/01/07/163797.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/163797.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2012/01/07/163797.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/163797.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/163797.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 不解风情的死理性派们在情感生活中不免会遇到这样悲催的一幕：偶然间遇到一位心仪的漂亮女孩，从此日思夜想，废寝忘食，开始了漫长的暗恋之旅，等到一日，在无尽的纠结中，终于鼓起勇气向女孩表白，结果女孩一句“我已经有男朋友了”如晴天霹雳，实在难以接受……<br><br>为了避免此种尴尬的发生，如何准确判断一位女生是否单身就成了一项的必修的课程。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2012/01/07/163797.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/163797.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2012-01-07 18:42 <a href="http://www.cppblog.com/coreBugZJ/archive/2012/01/07/163797.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>数字图像处理上机之四：灰度图 快速傅里叶变换 （ FFT IFFT 一维 二维 ）</title><link>http://www.cppblog.com/coreBugZJ/archive/2011/11/25/160988.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Fri, 25 Nov 2011 15:03:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2011/11/25/160988.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/160988.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2011/11/25/160988.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/160988.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/160988.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 1. 一维快速傅里叶变换的原理。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2011/11/25/160988.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/160988.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2011-11-25 23:03 <a href="http://www.cppblog.com/coreBugZJ/archive/2011/11/25/160988.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>FIB Query,  1007,  2011 Multi-University Training Contest 10</title><link>http://www.cppblog.com/coreBugZJ/archive/2011/08/11/153071.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Thu, 11 Aug 2011 09:21:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2011/08/11/153071.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/153071.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2011/08/11/153071.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/153071.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/153071.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 2011 Multi-University Training Contest 10 ,   1007 ......&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2011/08/11/153071.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/153071.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2011-08-11 17:21 <a href="http://www.cppblog.com/coreBugZJ/archive/2011/08/11/153071.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>一个数学家的自白__哈代自传</title><link>http://www.cppblog.com/coreBugZJ/archive/2011/05/28/147515.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sat, 28 May 2011 13:18:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2011/05/28/147515.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/147515.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2011/05/28/147515.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/147515.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/147515.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一个数学家的自白__哈代自传.pdf     &nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2011/05/28/147515.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/147515.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2011-05-28 21:18 <a href="http://www.cppblog.com/coreBugZJ/archive/2011/05/28/147515.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Burnside &amp; Polya</title><link>http://www.cppblog.com/coreBugZJ/archive/2011/04/17/144415.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Sun, 17 Apr 2011 13:44:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2011/04/17/144415.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/144415.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2011/04/17/144415.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/144415.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/144415.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Burnside & Polya 。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2011/04/17/144415.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/144415.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2011-04-17 21:44 <a href="http://www.cppblog.com/coreBugZJ/archive/2011/04/17/144415.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>全整数无浮点运算的 快速傅里叶变换FFT 加速 大整数乘法，整系数多项式乘法</title><link>http://www.cppblog.com/coreBugZJ/archive/2011/04/05/143474.html</link><dc:creator>coreBugZJ</dc:creator><author>coreBugZJ</author><pubDate>Tue, 05 Apr 2011 13:11:00 GMT</pubDate><guid>http://www.cppblog.com/coreBugZJ/archive/2011/04/05/143474.html</guid><wfw:comment>http://www.cppblog.com/coreBugZJ/comments/143474.html</wfw:comment><comments>http://www.cppblog.com/coreBugZJ/archive/2011/04/05/143474.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/coreBugZJ/comments/commentRss/143474.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/coreBugZJ/services/trackbacks/143474.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 我的模板，第一次实现。。。&nbsp;&nbsp;<a href='http://www.cppblog.com/coreBugZJ/archive/2011/04/05/143474.html'>阅读全文</a><img src ="http://www.cppblog.com/coreBugZJ/aggbug/143474.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/coreBugZJ/" target="_blank">coreBugZJ</a> 2011-04-05 21:11 <a href="http://www.cppblog.com/coreBugZJ/archive/2011/04/05/143474.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>