﻿<?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++博客-zjushuiping-最新评论</title><link>http://www.cppblog.com/zjushuiping/CommentsRSS.aspx</link><description /><language>zh-cn</language><pubDate>Tue, 01 May 2012 08:53:59 GMT</pubDate><lastBuildDate>Tue, 01 May 2012 08:53:59 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: A+B for Polynomials </title><link>http://www.cppblog.com/zjushuiping/archive/2016/02/18/170467.html#212843</link><dc:creator>田双坤</dc:creator><author>田双坤</author><pubDate>Thu, 18 Feb 2016 09:52:00 GMT</pubDate><guid>http://www.cppblog.com/zjushuiping/archive/2016/02/18/170467.html#212843</guid><description><![CDATA[#include &lt;cstdlib&gt;<br>#include &lt;iostream&gt;<br>#include &lt;cstdio&gt;<br>#include &lt;cctype&gt;<br>#include &lt;cstring&gt;<br>#include &lt;cmath&gt;<br>#include &lt;vector&gt;<br>#include &lt;list&gt;<br>#include &lt;deque&gt;<br>#include &lt;map&gt;<br>#include &lt;stack&gt;<br>#include &lt;set&gt;<br>#include &lt;queue&gt;<br>#include &lt;string&gt;<br>#include &lt;algorithm&gt;<br><br><br><br>using namespace std;<br><br>double a[1000+4];<br>double b[1000+4];<br>double c[1000+4];<br><br><br>int main(int argc, char *argv[])<br>{<br>  int k1,k2;<br>  int i,j,k;<br>  <br>  for(i=0;i&lt;=1000;i++)<br>  {<br>                      a[i]=b[i]=c[i]=0;<br>  }<br>  <br>  <br>  <br>  scanf(&quot;%d&quot;,&amp;k1);<br>  <br>  for(i=0;i&lt;k1;i++)<br>  {<br>                   int e;<br>                   double coe;<br>                   scanf(&quot;%d%lf&quot;,&amp;e,&amp;coe);<br>                   <br>                   <br>                   a[e]=coe;<br>  }<br>  <br>  scanf(&quot;%d&quot;,&amp;k2);<br>  <br>  for(i=0;i&lt;k2;i++)<br>  {<br>                   int e;<br>                   double coe;<br>                   scanf(&quot;%d%lf&quot;,&amp;e,&amp;coe);<br>                   b[e]=coe;<br>  }<br>  <br>  <br>  for(i=0;i&lt;=1000;i++)<br>  {<br>                      c[i]=a[i]+b[i];<br>  }<br>  <br>  <br>  int num=0;<br>  <br>  for(i=0;i&lt;=1000;i++)<br>  {<br>                      if(c[i]!=0.0)<br>                      {num++;}<br>  }<br>  <br>  printf(&quot;%d&quot;,num);<br>  <br>  for(i=1000;i&gt;=0;i--)<br>  {<br>                      if(c[i]!=0.0)<br>                      {<br>                                   printf(&quot; %d %.1lf&quot;,i,c[i]);<br>                      }<br>  }<br>  <br>  puts(&quot;&quot;);<br>                   <br>    <br>    <br>    <br>    <br>        return EXIT_SUCCESS;<br>}<img src ="http://www.cppblog.com/zjushuiping/aggbug/212843.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zjushuiping/" target="_blank">田双坤</a> 2016-02-18 17:52 <a href="http://www.cppblog.com/zjushuiping/archive/2016/02/18/170467.html#212843#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>