<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
xmlns:content="http://purl.org/rss/1.0/modules/content/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:atom="http://www.w3.org/2005/Atom"
xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
> <channel><title>Comments on: SGU 122 解题手记（求助）</title> <atom:link href="http://d.ream.at/sgu-122/feed/" rel="self" type="application/rss+xml" /><link>http://d.ream.at/sgu-122/</link> <description>WindyWinter的梦::上善若水，水利万物而不争，处众人之所恶，故几于道。</description> <lastBuildDate>Wed, 08 Feb 2012 05:15:49 +0000</lastBuildDate> <sy:updatePeriod>hourly</sy:updatePeriod> <sy:updateFrequency>1</sy:updateFrequency> <generator>http://wordpress.org/?v=3.3.1</generator> <item><title>By: WindyWinter</title><link>http://d.ream.at/sgu-122/#comment-1196</link> <dc:creator>WindyWinter</dc:creator> <pubDate>Sun, 30 Nov 2008 04:48:48 +0000</pubDate> <guid isPermaLink="false">http://www.turingdream.com/sgu-122-%e8%a7%a3%e9%a2%98%e6%89%8b%e8%ae%b0%ef%bc%88%e6%b1%82%e5%8a%a9%ef%bc%89#comment-1196</guid> <description>All of my articles without a special declaration before the text are published under the GNU Free Document License v1.2, free to use and free of charge.</description> <content:encoded><![CDATA[<p>All of my articles without a special declaration before the text are published under the GNU Free Document License v1.2, free to use and free of charge.</p> ]]></content:encoded> </item> <item><title>By: www.preiserhoehung.de</title><link>http://d.ream.at/sgu-122/#comment-1176</link> <dc:creator>www.preiserhoehung.de</dc:creator> <pubDate>Thu, 27 Nov 2008 14:24:12 +0000</pubDate> <guid isPermaLink="false">http://www.turingdream.com/sgu-122-%e8%a7%a3%e9%a2%98%e6%89%8b%e8%ae%b0%ef%bc%88%e6%b1%82%e5%8a%a9%ef%bc%89#comment-1176</guid> <description>Hi I like your post &quot;22 解题手记（求助）&#160;&#124;&#160;梦.:如此短暂&quot; so well that I like to ask you whether I should translate and linking back. Please give me an answer. Your Preiserh</description> <content:encoded><![CDATA[<p>Hi I like your post "22 解题手记（求助）&nbsp;|&nbsp;梦.:如此短暂" so well that I like to ask you whether I should translate and linking back. Please give me an answer. Your Preiserh</p> ]]></content:encoded> </item> <item><title>By: WindyWinter</title><link>http://d.ream.at/sgu-122/#comment-251</link> <dc:creator>WindyWinter</dc:creator> <pubDate>Tue, 20 May 2008 10:42:05 +0000</pubDate> <guid isPermaLink="false">http://www.turingdream.com/sgu-122-%e8%a7%a3%e9%a2%98%e6%89%8b%e8%ae%b0%ef%bc%88%e6%b1%82%e5%8a%a9%ef%bc%89#comment-251</guid> <description>Thanks a lot.
Now I got an AC(348ms) for the array version and a WA on 27 for the list version.</description> <content:encoded><![CDATA[<p>Thanks a lot.<br /> Now I got an AC(348ms) for the array version and a WA on 27 for the list version.</p> ]]></content:encoded> </item> <item><title>By: wyy1123</title><link>http://d.ream.at/sgu-122/#comment-250</link> <dc:creator>wyy1123</dc:creator> <pubDate>Tue, 20 May 2008 06:01:24 +0000</pubDate> <guid isPermaLink="false">http://www.turingdream.com/sgu-122-%e8%a7%a3%e9%a2%98%e6%89%8b%e8%ae%b0%ef%bc%88%e6%b1%82%e5%8a%a9%ef%bc%89#comment-250</guid> <description>晕，准备工作的两个头文件为：stdlib.h 和 string.h
Good luck!</description> <content:encoded><![CDATA[<p>晕，准备工作的两个头文件为：stdlib.h 和 string.h<br /> Good luck!</p> ]]></content:encoded> </item> <item><title>By: wyy1123</title><link>http://d.ream.at/sgu-122/#comment-249</link> <dc:creator>wyy1123</dc:creator> <pubDate>Tue, 20 May 2008 05:59:01 +0000</pubDate> <guid isPermaLink="false">http://www.turingdream.com/sgu-122-%e8%a7%a3%e9%a2%98%e6%89%8b%e8%ae%b0%ef%bc%88%e6%b1%82%e5%8a%a9%ef%bc%89#comment-249</guid> <description>超时原因：
int j=0,pos=0;
gets(rbuf);
while (sscanf(rbuf+pos,&quot;%d&quot;,&amp;j)!=EOF) {
map[i][j]=map[j][i]=true;
while (rbuf[pos]&gt;32) pos++;
while (rbuf[pos]==32) pos++;
}
请用如下方法代替：
/*
准备工作：
#include
#include
char buffer[5001], *token;
int x;
*/
gets(buffer);
token = strtok(buffer, &quot; &quot;);
while (token != NULL) {
x = atoi(token);
g[i][x] = true;
token = strtok(NULL, &quot; &quot;);
}</description> <content:encoded><![CDATA[<p>超时原因：<br /> int j=0,pos=0;<br /> gets(rbuf);<br /> while (sscanf(rbuf+pos,"%d",&amp;j)!=EOF) {<br /> map[i][j]=map[j][i]=true;<br /> while (rbuf[pos]&gt;32) pos++;<br /> while (rbuf[pos]==32) pos++;<br /> }<br /> 请用如下方法代替：<br /> /*<br /> 准备工作：<br /> #include<br /> #include<br /> char buffer[5001], *token;<br /> int x;<br /> */<br /> gets(buffer);<br /> token = strtok(buffer, " ");<br /> while (token != NULL) {<br /> x = atoi(token);<br /> g[i][x] = true;<br /> token = strtok(NULL, " ");<br /> }</p> ]]></content:encoded> </item> </channel> </rss>
