﻿<?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++博客-sopherwenxin学习笔记-最新评论</title><link>http://www.cppblog.com/sopherwenxin/CommentsRSS.aspx</link><description>刀锋上的舞者: 我是风中的落叶，看我如何飞翔</description><language>zh-cn</language><pubDate>Mon, 27 Feb 2006 03:40:00 GMT</pubDate><lastBuildDate>Mon, 27 Feb 2006 03:40:00 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 不用中间变量，实现变量值的互换（未完待续）</title><link>http://www.cppblog.com/sopherwenxin/archive/2007/12/04/3334.html#37802</link><dc:creator>c</dc:creator><author>c</author><pubDate>Tue, 04 Dec 2007 09:21:00 GMT</pubDate><guid>http://www.cppblog.com/sopherwenxin/archive/2007/12/04/3334.html#37802</guid><description><![CDATA[方法3有问题,不能保证结果.<img src ="http://www.cppblog.com/sopherwenxin/aggbug/37802.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sopherwenxin/" target="_blank">c</a> 2007-12-04 17:21 <a href="http://www.cppblog.com/sopherwenxin/archive/2007/12/04/3334.html#37802#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 第三届全国高校程序设计大赛赛题问题5：导线交叉  </title><link>http://www.cppblog.com/sopherwenxin/archive/2007/05/18/2729.html#24324</link><dc:creator>guoke</dc:creator><author>guoke</author><pubDate>Fri, 18 May 2007 04:59:00 GMT</pubDate><guid>http://www.cppblog.com/sopherwenxin/archive/2007/05/18/2729.html#24324</guid><description><![CDATA[#include&lt;stdio.h&gt;<br>#include&lt;malloc.h&gt;<br>void main()<br>{<br>	int n,m,i,j,k,count=0;<br>	int *a;<br>	scanf(&quot;%d&quot;,&amp;m);<br>	for(i=0;i&lt;m;i++)<br>	{<br>		scanf(&quot;%d&quot;,&amp;n);<br>		a=(int *)malloc(n*sizeof(int));<br>		for(i=0;i&lt;n;i++)<br>		{<br>			scanf(&quot;%d&quot;,&amp;a[i]);<br>		}<br>		for(j=0;j&lt;n;j++)<br>		{<br>			for(k=j+1;k&lt;n;k++)<br>			{<br>				if(a[j]&lt;a[k]) count++;<br>			}<br>		}<br>		printf(&quot;%d\n%d\n&quot;,i,count);<br>	}<br><br>}<img src ="http://www.cppblog.com/sopherwenxin/aggbug/24324.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sopherwenxin/" target="_blank">guoke</a> 2007-05-18 12:59 <a href="http://www.cppblog.com/sopherwenxin/archive/2007/05/18/2729.html#24324#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 第三届全国高校程序设计大赛赛题问题5：导线交叉  </title><link>http://www.cppblog.com/sopherwenxin/archive/2006/03/26/2729.html#4617</link><dc:creator>Tauruser</dc:creator><author>Tauruser</author><pubDate>Sun, 26 Mar 2006 03:50:00 GMT</pubDate><guid>http://www.cppblog.com/sopherwenxin/archive/2006/03/26/2729.html#4617</guid><description><![CDATA[可以根据相似三角形的性质很简单了推出，交点的高和水平位置，再根据这个来判断交点是否重合，这样应该比解方程简单点。<img src ="http://www.cppblog.com/sopherwenxin/aggbug/4617.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sopherwenxin/" target="_blank">Tauruser</a> 2006-03-26 11:50 <a href="http://www.cppblog.com/sopherwenxin/archive/2006/03/26/2729.html#4617#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 第三届全国高校程序设计大赛赛题问题5：导线交叉  </title><link>http://www.cppblog.com/sopherwenxin/archive/2006/01/16/2729.html#2771</link><dc:creator>sopherwenxin学习笔记</dc:creator><author>sopherwenxin学习笔记</author><pubDate>Mon, 16 Jan 2006 02:12:00 GMT</pubDate><guid>http://www.cppblog.com/sopherwenxin/archive/2006/01/16/2729.html#2771</guid><description><![CDATA[用方程计算比较麻烦，要自己定义坐标系，计算方程的解。可以保证的一点是肯定可以实现。可能这种方法就是最简单的了。<img src ="http://www.cppblog.com/sopherwenxin/aggbug/2771.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sopherwenxin/" target="_blank">sopherwenxin学习笔记</a> 2006-01-16 10:12 <a href="http://www.cppblog.com/sopherwenxin/archive/2006/01/16/2729.html#2771#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 第三届全国高校程序设计大赛赛题问题5：导线交叉  </title><link>http://www.cppblog.com/sopherwenxin/archive/2006/01/15/2729.html#2749</link><dc:creator>hnhls99</dc:creator><author>hnhls99</author><pubDate>Sun, 15 Jan 2006 13:22:00 GMT</pubDate><guid>http://www.cppblog.com/sopherwenxin/archive/2006/01/15/2729.html#2749</guid><description><![CDATA[To 学习笔记：<br>有没有比较简单的方法去计算重复的点呢？<img src ="http://www.cppblog.com/sopherwenxin/aggbug/2749.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sopherwenxin/" target="_blank">hnhls99</a> 2006-01-15 21:22 <a href="http://www.cppblog.com/sopherwenxin/archive/2006/01/15/2729.html#2749#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 第三届全国高校程序设计大赛赛题问题5：导线交叉  </title><link>http://www.cppblog.com/sopherwenxin/archive/2006/01/15/2729.html#2736</link><dc:creator>可冰</dc:creator><author>可冰</author><pubDate>Sun, 15 Jan 2006 02:58:00 GMT</pubDate><guid>http://www.cppblog.com/sopherwenxin/archive/2006/01/15/2729.html#2736</guid><description><![CDATA[看题好像没有计算重复点吧,如果计算的话上面的图中的交点数可能就不够22个了.<br>如果要计算的话,我想可以用方程来表示线,计算出每个交点的坐标来.<img src ="http://www.cppblog.com/sopherwenxin/aggbug/2736.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sopherwenxin/" target="_blank">可冰</a> 2006-01-15 10:58 <a href="http://www.cppblog.com/sopherwenxin/archive/2006/01/15/2729.html#2736#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 第三届全国高校程序设计大赛赛题问题5：导线交叉  </title><link>http://www.cppblog.com/sopherwenxin/archive/2006/01/15/2729.html#2735</link><dc:creator>sopherwenxin学习笔记</dc:creator><author>sopherwenxin学习笔记</author><pubDate>Sun, 15 Jan 2006 02:37:00 GMT</pubDate><guid>http://www.cppblog.com/sopherwenxin/archive/2006/01/15/2729.html#2735</guid><description><![CDATA[To hnhls99 :<br>上面结论不难得出，还要考虑的一个问题就是是交叉点重复得个数。也就是说最后得出的交叉点总数必须减掉重复的点。<img src ="http://www.cppblog.com/sopherwenxin/aggbug/2735.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sopherwenxin/" target="_blank">sopherwenxin学习笔记</a> 2006-01-15 10:37 <a href="http://www.cppblog.com/sopherwenxin/archive/2006/01/15/2729.html#2735#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 第三届全国高校程序设计大赛赛题问题5：导线交叉  </title><link>http://www.cppblog.com/sopherwenxin/archive/2006/01/14/2729.html#2731</link><dc:creator>hnhls99</dc:creator><author>hnhls99</author><pubDate>Sat, 14 Jan 2006 12:49:00 GMT</pubDate><guid>http://www.cppblog.com/sopherwenxin/archive/2006/01/14/2729.html#2731</guid><description><![CDATA[这个并不复杂，其实很简单的。就是判断一下上一排端子右侧的端子相连的下一排的端子是否小于他相连的端子，小于就相交。<img src ="http://www.cppblog.com/sopherwenxin/aggbug/2731.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sopherwenxin/" target="_blank">hnhls99</a> 2006-01-14 20:49 <a href="http://www.cppblog.com/sopherwenxin/archive/2006/01/14/2729.html#2731#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>