﻿<?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++博客-メmarsメ-随笔分类-MARK</title><link>http://www.cppblog.com/jxtgddlt/category/17843.html</link><description /><language>zh-cn</language><lastBuildDate>Tue, 11 Oct 2011 13:00:49 GMT</lastBuildDate><pubDate>Tue, 11 Oct 2011 13:00:49 GMT</pubDate><ttl>60</ttl><item><title>D3DXVec3TransformCoord [projecting the result back into w=1]</title><link>http://www.cppblog.com/jxtgddlt/archive/2011/10/10/157994.html</link><dc:creator>メmarsメ</dc:creator><author>メmarsメ</author><pubDate>Mon, 10 Oct 2011 12:57:00 GMT</pubDate><guid>http://www.cppblog.com/jxtgddlt/archive/2011/10/10/157994.html</guid><wfw:comment>http://www.cppblog.com/jxtgddlt/comments/157994.html</wfw:comment><comments>http://www.cppblog.com/jxtgddlt/archive/2011/10/10/157994.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jxtgddlt/comments/commentRss/157994.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jxtgddlt/services/trackbacks/157994.html</trackback:ping><description><![CDATA[<span style="font-size: 18px">w是其次坐标，用于表示verctor代表一个点还是一个向量。<br />w=1代表vector是个点，w=0代表vector是个向量，平移向量后，向量是没有变化的。<br />也就是w决定了一个变换中，平移部分是否有效。</span><br /><span style="font-size: 18px">w=0就是只让属于线性变换的变换有效。</span><img src ="http://www.cppblog.com/jxtgddlt/aggbug/157994.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jxtgddlt/" target="_blank">メmarsメ</a> 2011-10-10 20:57 <a href="http://www.cppblog.com/jxtgddlt/archive/2011/10/10/157994.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>巧妙的算法</title><link>http://www.cppblog.com/jxtgddlt/archive/2011/09/30/157237.html</link><dc:creator>メmarsメ</dc:creator><author>メmarsメ</author><pubDate>Fri, 30 Sep 2011 08:37:00 GMT</pubDate><guid>http://www.cppblog.com/jxtgddlt/archive/2011/09/30/157237.html</guid><wfw:comment>http://www.cppblog.com/jxtgddlt/comments/157237.html</wfw:comment><comments>http://www.cppblog.com/jxtgddlt/archive/2011/09/30/157237.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jxtgddlt/comments/commentRss/157237.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jxtgddlt/services/trackbacks/157237.html</trackback:ping><description><![CDATA[有5个人比赛，采用淘汰制。那么第一轮有1人轮空，淘汰2人。剩下3人继续，又一人轮空，最后2人决赛。这样最后有2个人轮空。<br /><br />那么37个人比赛有几个人轮空呢？ <br /><br />可以这么算：用比37大的最小的2的幂次的数也就是64，去减37，64-37=27，而27=16+8+2+1，所以27的二进制是11011，<br /><br />数一数有四个1，所以37人比赛有4人轮空。<br /><a href="http://www.nhyz.org/nhxi/nhxi/jiegousuanfa/jiegou33.files/43.htm4.gif" target="_blank"><img onmouseover="if(this.width>screen.width*0.7) this.width=screen.width*0.7;" title="" onmousewheel="return imgzoom(this);" border=0 alt=按此在新窗口浏览图片 src="http://www.nhyz.org/nhxi/nhxi/jiegousuanfa/jiegou33.files/43.htm4.gif" onload="if(this.width>screen.width*0.7) this.width=screen.width*0.7;"></a> <img src ="http://www.cppblog.com/jxtgddlt/aggbug/157237.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jxtgddlt/" target="_blank">メmarsメ</a> 2011-09-30 16:37 <a href="http://www.cppblog.com/jxtgddlt/archive/2011/09/30/157237.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>