﻿<?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++博客-Residence for sdfond</title><link>http://www.cppblog.com/sdfond/</link><description>世事洞明皆学问，人情练达即文章</description><language>zh-cn</language><lastBuildDate>Mon, 13 Apr 2026 09:39:16 GMT</lastBuildDate><pubDate>Mon, 13 Apr 2026 09:39:16 GMT</pubDate><ttl>60</ttl><item><title>期待下陆大牛的讲座</title><link>http://www.cppblog.com/sdfond/archive/2011/02/23/140542.html</link><dc:creator>sdfond</dc:creator><author>sdfond</author><pubDate>Wed, 23 Feb 2011 12:50:00 GMT</pubDate><guid>http://www.cppblog.com/sdfond/archive/2011/02/23/140542.html</guid><wfw:comment>http://www.cppblog.com/sdfond/comments/140542.html</wfw:comment><comments>http://www.cppblog.com/sdfond/archive/2011/02/23/140542.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/sdfond/comments/commentRss/140542.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/sdfond/services/trackbacks/140542.html</trackback:ping><description><![CDATA[　　今天收到一个seminar的通知，向来我是对seminar没有任何兴趣的，一方面是因为SOC很少有和自己research相关的seminar，另一方面是因为无论是否和自己的research field相关，我去了基本都听不懂- -!<br>　　不过今天的这个seminar是A.P. <a style="color: #0070ff;" target="_blank"  href="http://www.comp.nus.edu.sg/~yuhf/">Haifeng Yu</a>举办的，因此多关注了一下。主讲人我没听过，但是里面提到他的co-worker居然有Zhu Zeyuan，这个就不得不关注下了。在icecream的提醒下八卦了这个主讲人，才发现他是一个科研大牛叫<a style="color: #0874ff;" target="_blank"  href="http://research.microsoft.com/en-us/people/pinyanl/">陆品燕</a>。<a style="color: #0070ff;" target="_blank"  href="http://news.tsinghua.edu.cn/new/news.php?id=17306">这里</a>有一个关于他的采访。他中学期间竞赛获奖无数，保送清华，博士师从姚期智。他博士期间发了许多算法和计算理论领域rank1的paper，包括SODA、STOC、FOCS等等。最让我看重的是他生活的心态与哲学，在访谈中他谈到，他理想的生活是&#8220;一直作理论数学研究，到世界各地与最聪明的人交流，没有太多经济上的困扰&#8221;，满足于&#8220;<span style="color: red;">不断有些进展，充分享受过程</span>&#8221;。真希望以后我也能达到这个高度。<br>　　八卦的时候顺便发现他还和Zhou Yuan也合作发过paper，真是物以类聚，&#8220;牛&#8221;以群分。<br>　　这个讲座在下周，到时候一定去仰慕下这个大牛，顺便沾沾牛气，呵呵。<br><br><img src ="http://www.cppblog.com/sdfond/aggbug/140542.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sdfond/" target="_blank">sdfond</a> 2011-02-23 20:50 <a href="http://www.cppblog.com/sdfond/archive/2011/02/23/140542.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Perhaps I Will Return</title><link>http://www.cppblog.com/sdfond/archive/2011/02/20/140324.html</link><dc:creator>sdfond</dc:creator><author>sdfond</author><pubDate>Sun, 20 Feb 2011 03:20:00 GMT</pubDate><guid>http://www.cppblog.com/sdfond/archive/2011/02/20/140324.html</guid><wfw:comment>http://www.cppblog.com/sdfond/comments/140324.html</wfw:comment><comments>http://www.cppblog.com/sdfond/archive/2011/02/20/140324.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/sdfond/comments/commentRss/140324.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/sdfond/services/trackbacks/140324.html</trackback:ping><description><![CDATA[&nbsp; Ms. Chew tells me that modifier is needed when I write a paper, it explains why I use this weird title. Well it is really a long time since I logged into this blog last time because life is kind of boring here and I don't even have a feeling to write something down. Five minutes ago I suddenly had some feelings in my mind and wanted to say that but now I feel vacuous and forget everything. I'm getting old fast, I think.<br>&nbsp; Whatever this may be a good sign which implies I will return. I hope that day won't be too far away.<br><br><img src ="http://www.cppblog.com/sdfond/aggbug/140324.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sdfond/" target="_blank">sdfond</a> 2011-02-20 11:20 <a href="http://www.cppblog.com/sdfond/archive/2011/02/20/140324.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Backup For CRF++ Configuration</title><link>http://www.cppblog.com/sdfond/archive/2010/06/12/117701.html</link><dc:creator>sdfond</dc:creator><author>sdfond</author><pubDate>Sat, 12 Jun 2010 07:32:00 GMT</pubDate><guid>http://www.cppblog.com/sdfond/archive/2010/06/12/117701.html</guid><wfw:comment>http://www.cppblog.com/sdfond/comments/117701.html</wfw:comment><comments>http://www.cppblog.com/sdfond/archive/2010/06/12/117701.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/sdfond/comments/commentRss/117701.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/sdfond/services/trackbacks/117701.html</trackback:ping><description><![CDATA[1. Install G++<br>2. $ ./configure<br>&nbsp;&nbsp;&nbsp; $ make<br>&nbsp;&nbsp;&nbsp; $ sudo su<br>&nbsp;&nbsp;&nbsp; $ make install<br>3. gedit ~/.bashrc<br>&nbsp;&nbsp;&nbsp; add following lines:<br>&nbsp;&nbsp;&nbsp; export LD_LIBRARY_PATH=/usr/local/lib<br><br>Then you can use crf_learn to train data and crf_test to decode.<br>Reference: http://crfpp.sourceforge.net/<br> <img src ="http://www.cppblog.com/sdfond/aggbug/117701.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sdfond/" target="_blank">sdfond</a> 2010-06-12 15:32 <a href="http://www.cppblog.com/sdfond/archive/2010/06/12/117701.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>又翻出一道老题</title><link>http://www.cppblog.com/sdfond/archive/2010/04/26/113659.html</link><dc:creator>sdfond</dc:creator><author>sdfond</author><pubDate>Mon, 26 Apr 2010 15:34:00 GMT</pubDate><guid>http://www.cppblog.com/sdfond/archive/2010/04/26/113659.html</guid><wfw:comment>http://www.cppblog.com/sdfond/comments/113659.html</wfw:comment><comments>http://www.cppblog.com/sdfond/archive/2010/04/26/113659.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/sdfond/comments/commentRss/113659.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/sdfond/services/trackbacks/113659.html</trackback:ping><description><![CDATA[　　整理东西的时候翻看以前的笔记，看到当初讲座owen讲的一个题，这题当时不会，今天突然来了兴致给做了。<br>　　给定一个a * b的网格，从左下到右上画一条线穿过的格子数是n。给定一个n问有多少种不同的a和b满足穿过的格子数为n。对应TJU 2880。<br>　　首先n = a + b - gcd(a, b)。因为对于每个穿过的格子，直线可能会从格子的上侧穿过，也可能从格子的右侧穿过，也可能既穿过上侧也穿过右侧(也就是从右上角穿过)。因为直线总要从左边走到右边，因此恰好有a个格子会被直线穿过右侧(直线是连续的，不会在同一列同时穿过两个格子的右侧)，同理恰好有b个格子会被直线穿过上侧，这样总共就是a + b个。但是这样的话穿过右上角的格子就被重复计算了，这样的格子如果坐标为(x, y)，一定满足这个条件：x : y = a : b，这样ay = bx，显然满足等式的解个数是gcd(a, b)个。这样n的值就被计算出来了。<br>　　然后设g = gcd(a, b)，a = a' * g, b = b' * g, 那么n = (a' + b' - 1) * g, 其中gcd(a', b') = 1。通过枚举g可以求出满足条件的(a', b')的个数，求和就是结果。接下的问题就是求a' + b' = n'的序对个数。可以认定gcd(a', n') = 1，如果不是这样的话，会有a' = t * A, n' = t * N, 这样的话b' = t(N - A)，这样就和a'、b'互素矛盾。这样只需要求和n'互素的数的个数即可，利用欧拉函数就可以很高效的找到满足条件的序对个数了。<br><br><img src ="http://www.cppblog.com/sdfond/aggbug/113659.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sdfond/" target="_blank">sdfond</a> 2010-04-26 23:34 <a href="http://www.cppblog.com/sdfond/archive/2010/04/26/113659.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>卖书</title><link>http://www.cppblog.com/sdfond/archive/2010/04/26/113653.html</link><dc:creator>sdfond</dc:creator><author>sdfond</author><pubDate>Mon, 26 Apr 2010 14:38:00 GMT</pubDate><guid>http://www.cppblog.com/sdfond/archive/2010/04/26/113653.html</guid><wfw:comment>http://www.cppblog.com/sdfond/comments/113653.html</wfw:comment><comments>http://www.cppblog.com/sdfond/archive/2010/04/26/113653.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.cppblog.com/sdfond/comments/commentRss/113653.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/sdfond/services/trackbacks/113653.html</trackback:ping><description><![CDATA[　　前两天去二手书店卖旧书，那个阿姨非常和蔼的跟我说教材按照1-3折回收，我窃喜。结果拿出来书之后，她指着这些书(包括大学英语、数字逻辑电路等等)又跟我说这些书已经卖不动了，只能称斤卖，结果两大兜子书才卖了10快零5毛，二手书店不愧是二手黑店，上面还好意思说&#8220;高价回收，廉价出售&#8221;，我看反过来才对。当初我在二手书店是按照6折买的书，我问那个人说你不是说5折卖么，结果那人说这本书新，所以按6折卖！妈的真是怎么说都有理。<br>　　不过淘汰了不少垃圾书，寝室柜子里面还是留出不少空间。什么热练语法这种工大外语系骗钱的垃圾书籍卖掉之后我心里还是很爽的，眼不见心不烦；还有高中时候非常傻逼买的ASP这种唬人的技术书籍，等到上了大学才发现这些书都是纯扯淡。以后我肯定不会随便买书了，个人感觉大学50%课程不用买书，看课件就ok；30%的课程可以买二手或者借别人的，需要买书的课程就20%。像大一的时候学的一门非常屎的课叫PSP，老师也十分之恶让我们每个人买了英文原版教材，40元左右，这书貌似我就看了1页。还有大学英语，完全可以到二手黑店买，5元一本多实惠。那些真正值得买的书很少有老师推荐。<br>　　翻旧书的时候看到大一打印的sunner的课件，可以说sunner作为我的程序设计语言启蒙老师，真的教给我很多东西，所有的课件我都当做废纸卖了，唯独sunner的课件没卖，只为这份感情。<br>　　后来听说3班有人去摆摊卖旧书，买了好几百，我很诧异。后来听说他们连计算机网络这种专业书籍都卖了我就释然了，这种专业书我才不会卖。人家下了血本，卖这些钱也值了。<br><br><img src ="http://www.cppblog.com/sdfond/aggbug/113653.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sdfond/" target="_blank">sdfond</a> 2010-04-26 22:38 <a href="http://www.cppblog.com/sdfond/archive/2010/04/26/113653.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>