<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0">
  <channel>
    <title>蜡笔的天真涂鸦</title>
    <description></description>
    <link>http://t0uch.javaeye.com</link>
    <language>UTF-8</language>
    <copyright>Copyright 2003-2008, JavaEye.com</copyright>
    <docs>http://blogs.law.harvard.edu/tech/rss</docs>
    <generator>JavaEye - 做最棒的软件开发交流社区</generator>
      <item>
        <title>HTML 超级链接实例</title>
        <author>t0uch</author>
        <description>
          <![CDATA[
          <br/>
          作者: <a href="http://t0uch.javaeye.com">t0uch</a>&nbsp;
          链接：<a href="http://t0uch.javaeye.com/blog/185576" style="color:red;">http://t0uch.javaeye.com/blog/185576</a>&nbsp;
          发表时间: 2008年04月22日
          <br/><br/>
          声明：本文系JavaEye网站发布的原创博客文章，未经作者书面许可，严禁任何网站转载本文，否则必将追究法律责任！
          <br/><br/>
          创建超链接<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;p>
&lt;a href="/index.html">
This text&lt;/a> is a link to a page on 
this Web site.
&lt;/p>

&lt;p>
&lt;a href="http://www.microsoft.com/">
This text&lt;/a> is a link to a page on 
the World Wide Web.
&lt;/p>

&lt;/body>
&lt;/html></pre><br />图像超链接<br /><pre name="code" class="html">&lt;html>

&lt;body>
&lt;p>
You can also use an image as a link:
&lt;a href="/example/html/lastpage.html">
&lt;img border="0" src="/i/eg_buttonnext.gif" width="65" height="38">
&lt;/a>
&lt;/p>

&lt;/body>
&lt;/html></pre><br /><br />在新的浏览器窗口打开链接<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;a href="/example/html/lastpage.html" target="_blank">Last Page&lt;/a> 

&lt;p>
If you set the target attribute of a link to "_blank",
the link will open in a new window.
&lt;/p>

&lt;/body>
&lt;/html>
</pre><br /><br />链接到同一个页面的不同位置<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;p>
&lt;a href="#C4">See also Chapter 4.&lt;/a>
&lt;/p>

&lt;h2>Chapter 1&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 2&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 3&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>&lt;a name="C4">Chapter 4&lt;/a>&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 5&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 6&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 7&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 8&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 9&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 10&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 11&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 12&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 13&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 14&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 15&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 16&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;h2>Chapter 17&lt;/h2>
&lt;p>This chapter explains ba bla bla&lt;/p>

&lt;/body>
&lt;/html></pre><br /><br />跳出框架<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;p>Locked in a frame?&lt;/p> 

&lt;a href="http://www.w3school.com.cn/"
target="_top">Click here!&lt;/a> 

&lt;/body>
&lt;/html></pre><br /><br />创建电子邮件链接<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;p>
This is a mail link:
&lt;a href="mailto:someone@microsoft.com?subject=Hello%20again">
Send Mail&lt;/a>
&lt;/p>

&lt;p>
&lt;b>Note:&lt;/b> Spaces between words should be replaced by %20 to &lt;b>ensure&lt;/b> that the browser will display your text properly.
&lt;/p>

&lt;/body>
&lt;/html></pre><br /><br />创建电子邮件链接 2<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;p>
This is another mailto link:
&lt;a href="mailto:someone@microsoft.com?cc=someoneelse@microsoft.com&bcc=andsomeoneelse2@microsoft.com&subject=Summer%20Party&body=You%20are%20invited%20to%20a%20big%20summer%20party!">Send mail!&lt;/a>
&lt;/p>

&lt;p>
&lt;b>Note:&lt;/b> Spaces between words should be replaced by %20 to &lt;b>ensure&lt;/b> that the browser will display your text properly.
&lt;/p>

&lt;/body>
&lt;/html></pre>
          <br/>
          <span style="color:red;">
            <a href="http://t0uch.javaeye.com/blog/185576#comments" style="color:red;">本文的讨论也很精彩，浏览讨论>></a>
          </span>
          <br/><br/><br/>
          <span style="color:#E28822;">JavaEye推荐</span>
          <br/>
          <ul class='adverts'><li><a href='/adverts/106' target='_blank'><span style="color:blue;font-weight:bold;">JavaEye问答大赛开始了！ 从6月23日 至 7月6日，奖品丰厚 ！</span></a></li><li><a href='/adverts/92' target='_blank'><span style="color:red;font-weight:bold;">快来参加7月17日在成都举行的SOA中国技术论坛</span></a></li><li><a href='/adverts/42' target='_blank'><span style="color:red;font-weight:bold;">搜狐网站诚聘Java、PHP和C++工程师</span></a></li><li><a href='/adverts/41' target='_blank'><span style="color:red;font-weight:bold;">北京: 千橡集团暨校内网诚聘软件研发工程师</span></a></li><li><a href='/adverts/97' target='_blank'><span style="color:blue;font-weight:bold;">Oracle专区上线，有Oracle最新文章，重要下载及知识库等精彩内容，欢迎访问。</span></a></li></ul>
          <br/><br/><br/>
          ]]>
        </description>
        <pubDate>Tue, 22 Apr 2008 18:05:59 +0800</pubDate>
        <link>http://t0uch.javaeye.com/blog/185576</link>
        <guid>http://t0uch.javaeye.com/blog/185576</guid>
      </item>
      <item>
        <title>HTML 文本格式化实例</title>
        <author>t0uch</author>
        <description>
          <![CDATA[
          <br/>
          作者: <a href="http://t0uch.javaeye.com">t0uch</a>&nbsp;
          链接：<a href="http://t0uch.javaeye.com/blog/185571" style="color:red;">http://t0uch.javaeye.com/blog/185571</a>&nbsp;
          发表时间: 2008年04月22日
          <br/><br/>
          声明：本文系JavaEye网站发布的原创博客文章，未经作者书面许可，严禁任何网站转载本文，否则必将追究法律责任！
          <br/><br/>
          文本格式化<br /><br />b,strong标签粗体，br换行，big字体变大，em,i斜体，small字体变小，sub向下靠子字符串，sup向上靠子字符串<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;b>This text is bold&lt;/b>

&lt;br>

&lt;strong>This text is strong&lt;/strong>

&lt;br>

&lt;big>This text is big&lt;/big>

&lt;br>

&lt;em>This text is emphasized&lt;/em>

&lt;br>

&lt;i>This text is italic&lt;/i>

&lt;br>

&lt;small>This text is small&lt;/small>

&lt;br>

This text contains
&lt;sub>subscript&lt;/sub>

&lt;br>

This text contains
&lt;sup>superscript&lt;/sup>

&lt;/body>
&lt;/html></pre><br /><br />预格式文本<br />pre标签对空行和空格敏感<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;pre>
This is
preformatted text.
It preserves      both spaces
and line breaks.
&lt;/pre>

&lt;p>The pre tag is good for displaying computer code:&lt;/p>

&lt;pre>
for i = 1 to 10
     print i
next i
&lt;/pre>

&lt;/body>
&lt;/html></pre><br /><br />“计算机输出”标签<br /><br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;code>Computer code&lt;/code>
&lt;br>
&lt;kbd>Keyboard input&lt;/kbd>
&lt;br>
&lt;tt>Teletype text&lt;/tt>
&lt;br>
&lt;samp>Sample text&lt;/samp>
&lt;br>
&lt;var>Computer variable&lt;/var>
&lt;br>

&lt;p>
&lt;b>Note:&lt;/b> These tags are often used to display computer/programming code.
&lt;/p>

&lt;/body>
&lt;/html></pre><br /><br />地址<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;address>
Donald Duck&lt;br>
BOX 555&lt;br>
Disneyland&lt;br>
USA
&lt;/address>

&lt;/body>
&lt;/html></pre><br /><br />缩写和首字母缩写<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;abbr title="United Nations">UN&lt;/abbr>
&lt;br>
&lt;acronym title="World Wide Web">WWW&lt;/acronym>

&lt;p>The title attribute is used to show the spelled-out version when holding the mouse pointer over the acronym or abbreviation.&lt;/p>

&lt;p>This only works for the acronym element in IE 5.&lt;/p>

&lt;p>This works for both the abbr and acronym element in Netscape 6.2.&lt;/p>

&lt;/body>
&lt;/html></pre><br /><br />文字方向<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;p>
If your browser supports bi-directional override (bdo), the next line will be written from the right to the left (rtl):
&lt;/p>

&lt;bdo dir="rtl">
Here is some Hebrew text
&lt;/bdo>

&lt;/body>
&lt;/html></pre><br /><br />块引用<br /><pre name="code" class="html">&lt;html>

&lt;body>

Here comes a long quotation:
&lt;blockquote>
This is a long quotation. This is a long quotation. This is a long quotation. This is a long quotation. This is a long quotation.
&lt;/blockquote>

Here comes a short quotation:
&lt;q>
This is a short quotation
&lt;/q>

&lt;p>
With the block quote element, the browser inserts line breaks and margins, but the q element does not render as anything special.
&lt;/p>

&lt;/body>
&lt;/html></pre><br /><br />删除字效果和插入字效果<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;p>
a dozen is 
&lt;del>twenty&lt;/del> 
&lt;ins>twelve&lt;/ins> 
pieces
&lt;/p>

&lt;p>
Most browsers will overstrike deleted text and underline inserted text.
&lt;/p>

&lt;p>
Some older browsers will display deleted or inserted text as plain text.
&lt;/p>

&lt;/body>
&lt;/html></pre>
          <br/>
          <span style="color:red;">
            <a href="http://t0uch.javaeye.com/blog/185571#comments" style="color:red;">本文的讨论也很精彩，浏览讨论>></a>
          </span>
          <br/><br/><br/>
          <span style="color:#E28822;">JavaEye推荐</span>
          <br/>
          <ul class='adverts'><li><a href='/adverts/41' target='_blank'><span style="color:red;font-weight:bold;">北京: 千橡集团暨校内网诚聘软件研发工程师</span></a></li><li><a href='/adverts/106' target='_blank'><span style="color:blue;font-weight:bold;">JavaEye问答大赛开始了！ 从6月23日 至 7月6日，奖品丰厚 ！</span></a></li><li><a href='/adverts/97' target='_blank'><span style="color:blue;font-weight:bold;">Oracle专区上线，有Oracle最新文章，重要下载及知识库等精彩内容，欢迎访问。</span></a></li><li><a href='/adverts/92' target='_blank'><span style="color:red;font-weight:bold;">快来参加7月17日在成都举行的SOA中国技术论坛</span></a></li><li><a href='/adverts/42' target='_blank'><span style="color:red;font-weight:bold;">搜狐网站诚聘Java、PHP和C++工程师</span></a></li></ul>
          <br/><br/><br/>
          ]]>
        </description>
        <pubDate>Tue, 22 Apr 2008 17:52:36 +0800</pubDate>
        <link>http://t0uch.javaeye.com/blog/185571</link>
        <guid>http://t0uch.javaeye.com/blog/185571</guid>
      </item>
      <item>
        <title>HTML 初学-基础标签实例</title>
        <author>t0uch</author>
        <description>
          <![CDATA[
          <br/>
          作者: <a href="http://t0uch.javaeye.com">t0uch</a>&nbsp;
          链接：<a href="http://t0uch.javaeye.com/blog/185555" style="color:red;">http://t0uch.javaeye.com/blog/185555</a>&nbsp;
          发表时间: 2008年04月22日
          <br/><br/>
          声明：本文系JavaEye网站发布的原创博客文章，未经作者书面许可，严禁任何网站转载本文，否则必将追究法律责任！
          <br/><br/>
          本人好记忆力极差，记于此以备查询。<br /><br />HTML 基础标签实例<br />一个简单的html<br /><pre name="code" class="html">&lt;html>
&lt;body>
&lt;p>试试看&lt;/p>
&lt;/body>
&lt;/html></pre><br />简单的段落<br /><pre name="code" class="html">&lt;html>
&lt;body>
	&lt;p>This is a paragraph.&lt;/p>
	&lt;p>This is a paragraph.&lt;/p>
	&lt;p>This is a paragraph.&lt;/p>
	
	&lt;p>This is a p tag.&lt;/p>
&lt;/body>
&lt;/html></pre><br />更多的段落<br /><pre name="code" class="html">&lt;!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
	"http://www.w3.org/TR/html4/loose.dtd">
&lt;html>
&lt;body>
	&lt;p>
		This paragraph
		contains a lot of lines
		in the source code,
		but the browser 
		ignores it.
	&lt;/p>
	
	&lt;p>
		This paragraph
		contains      a lot of spaces
		in the source     code,
		but the    browser 
		ignores it.
	&lt;/p>
	
	&lt;p>
		The number of lines in a paragraph depends on the size of your browser window. If you resize the browser window, the number of lines 		in this paragraph will change.
	&lt;/p>
&lt;/body>
&lt;/html></pre><br />“诗歌”问题，由于浏览器会直接省略掉排版好的文本<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;p>
   My Bonnie lies over the ocean.
    My Bonnie lies over the sea.
   My Bonnie lies over the ocean.
  Oh, bring back my Bonnie to me.
&lt;/p>

&lt;p>Note that your browser simply ignores your formatting!&lt;/p>

&lt;/body>
&lt;/html></pre><br /><br />拆行(br标签)<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;p>
To break&lt;br>lines&lt;br>in a&lt;br>paragraph,&lt;br>use the br tag.
&lt;/p>

&lt;/body>
&lt;/html></pre><br /><br />标题(h1最大)<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;h1>This is heading 1&lt;/h1>
&lt;h2>This is heading 2&lt;/h2>
&lt;h3>This is heading 3&lt;/h3>
&lt;h4>This is heading 4&lt;/h4>
&lt;h5>This is heading 5&lt;/h5>
&lt;h6>This is heading 6&lt;/h6>

&lt;p>Use heading tags only for headings. Don't use them just to make something bold. Use other tags for that.&lt;/p>

&lt;/body>
&lt;/html></pre><br /><br />居中(&lt;h1 align="center">This is heading 1&lt;/h1>)<br /><pre name="code" class="html">&lt;!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
"http://www.w3.org/TR/html4/loose.dtd">

&lt;html>

&lt;body>

&lt;h1 align="center">This is heading 1&lt;/h1>

&lt;p>The heading above is aligned to the center of this page. The heading above is aligned to the center of this page. The heading above is aligned to the center of this page.&lt;/p>

&lt;/body>
&lt;/html></pre><br />水平线(hr标签)<br /><pre name="code" class="html">&lt;html>

&lt;body>
&lt;p>The hr tag defines a horizontal rule:&lt;/p>
&lt;hr>
&lt;p>This is a paragraph&lt;/p>
&lt;hr>
&lt;p>This is a paragraph&lt;/p>
&lt;hr>
&lt;p>This is a paragraph&lt;/p>
&lt;/body>
&lt;/html></pre><br /><br />隐藏的注释 (&lt;!-- ** -->)<br /><pre name="code" class="html">&lt;html>

&lt;body>

&lt;!--This comment will not be displayed-->
&lt;p>This is a regular paragraph&lt;/p>

&lt;/body>
&lt;/html></pre><br /><br />背景颜色(&lt;body bgcolor="yellow">)<br /><pre name="code" class="html">&lt;html>
&lt;head>
&lt;meta http-equiv="Content-Type" content="text/html; charset=gb2312" />
&lt;meta http-equiv="Content-Language" content="zh-cn" />
&lt;/head>

&lt;body bgcolor="yellow">
&lt;h2>Look: Colored Background!&lt;/h2>
&lt;/body>

&lt;/html></pre>
          <br/>
          <span style="color:red;">
            <a href="http://t0uch.javaeye.com/blog/185555#comments" style="color:red;">本文的讨论也很精彩，浏览讨论>></a>
          </span>
          <br/><br/><br/>
          <span style="color:#E28822;">JavaEye推荐</span>
          <br/>
          <ul class='adverts'><li><a href='/adverts/42' target='_blank'><span style="color:red;font-weight:bold;">搜狐网站诚聘Java、PHP和C++工程师</span></a></li><li><a href='/adverts/41' target='_blank'><span style="color:red;font-weight:bold;">北京: 千橡集团暨校内网诚聘软件研发工程师</span></a></li><li><a href='/adverts/106' target='_blank'><span style="color:blue;font-weight:bold;">JavaEye问答大赛开始了！ 从6月23日 至 7月6日，奖品丰厚 ！</span></a></li><li><a href='/adverts/92' target='_blank'><span style="color:red;font-weight:bold;">快来参加7月17日在成都举行的SOA中国技术论坛</span></a></li><li><a href='/adverts/97' target='_blank'><span style="color:blue;font-weight:bold;">Oracle专区上线，有Oracle最新文章，重要下载及知识库等精彩内容，欢迎访问。</span></a></li></ul>
          <br/><br/><br/>
          ]]>
        </description>
        <pubDate>Tue, 22 Apr 2008 17:19:09 +0800</pubDate>
        <link>http://t0uch.javaeye.com/blog/185555</link>
        <guid>http://t0uch.javaeye.com/blog/185555</guid>
      </item>
      <item>
        <title>听说Rails 2.1有个Time Zone</title>
        <author>t0uch</author>
        <description>
          <![CDATA[
          <br/>
          作者: <a href="http://t0uch.javaeye.com">t0uch</a>&nbsp;
          链接：<a href="http://t0uch.javaeye.com/blog/184194" style="color:red;">http://t0uch.javaeye.com/blog/184194</a>&nbsp;
          发表时间: 2008年04月18日
          <br/><br/>
          声明：本文系JavaEye网站发布的原创博客文章，未经作者书面许可，严禁任何网站转载本文，否则必将追究法律责任！
          <br/><br/>
          Rails 2.1快要release了，下面是对Time Zone一篇文章的翻译，觉得有点意思，便拿来翻译翻译，正好可以学习一番。翻译质量很差，希望不要嘲笑。<br /><br />(链接在此:<a href="http://mad.ly/2008/04/09/rails-21-time-zone-support-an-overview/" target="_blank">http://mad.ly/2008/04/09/rails-21-time-zone-support-an-overview/</a>)<br />图片就不自己搞rails来原创的，直接取之来用，另外我已将图片打包，免得链接失效了就不好办了<br /><br />具体的API可以查看<a href="http://api.rubyonrails.org/" target="_blank">http://api.rubyonrails.org/</a><br /><br />可惜可爱的ruby 1.9x 稳定版还是遥遥无期<br /><br />看看rails 2.1的这个新功能吧,Time Zone<br /><br />什么是Time Zone，就是时区，对，论坛里经常有设置的，UTC或者是GMT<br /><br />UTC = Coordinated Universal Time. 中文名称为协调世界时<br />GMT = Greenwich Mean Time. 中文名称为格林尼治时<br /><br />那UTC和GMT又有何区别？据说UTC=GMT +/- 0.9s<br /><br />废话多了<br /><br />在rails 2.1中，编辑<br /><pre name="code" class="ruby"># config/environment.rb
config.time_zone = 'UTC'</pre><br />这就把UTC做成了默认设置<br />同时，也可以运行<strong>time:zones:all</strong>, <strong>time:zones:us</strong>,还有<strong>time:zones:local</strong>来获取一些相关的时区信息<br /><br /><pre name="code" class="ruby">$ rake time:zones:local
 
* UTC -06:00 *
Central America
Central Time (US & Canada)
Guadalajara
Mexico City
Monterrey
Saskatchewan</pre><br />没错，可以把Central Time设置成默认的<br /><pre name="code" class="java"># config/environment.rb
config.time_zone = 'Central Time (US & Canada)'</pre><br /><br />下面用scaffold来试试看这个新功能<br /><pre name="code" class="ruby">$ script/generate scaffold Task name:string alert_at:datetime
$ rake db:migrate
$ script/server</pre><br /><img src="http://mad.ly/wp-content/uploads/2008/04/new_task1.png" /><br />create后就可以看到时区了<br /><img src="http://mad.ly/wp-content/uploads/2008/04/show_task1.png" /><br />图片是-5区，记得我们国家是+8区<br />用script/console验证一下<br /><pre name="code" class="ruby">>> t = Task.find_by_name('foo')
=> #&lt; Task … >
>> t.alert_at
=> Sun, 06 Apr 2008 10:30:00 CDT -05:00
>> t.alert_at_before_type_cast
=> "2008-04-06 15:30:00"</pre><br />可以得知，2008-04-06 15:30:00时间是UTC时间，而Sun, 06 Apr 2008 10:30:00 CDT -05:00是CDT时间，为上面设置的时区<br /><br />现在把日期改一下，改成1月份<br /><img src="http://mad.ly/wp-content/uploads/2008/04/edit_task.png" /><br />时区变成-6的了，因为已经不是夏时制了(什么是夏时制？请看<a href="http://baike.baidu.com/view/131456.htm" target="_blank">http://baike.baidu.com/view/131456.htm</a>)<br /><img src="http://mad.ly/wp-content/uploads/2008/04/show_task_updated.png" /><br />再次验证一下<br /><pre name="code" class="ruby">>> t = Task.find_by_name('foo')
=> #&lt; Task … >
>> t.alert_at
=> Sun, 06 Jan 2008 10:30:00 CST -06:00
>> t.alert_at_before_type_cast
=> "2008-01-06 16:30:00"</pre><br /><br /><strong>用户自定义时区</strong><br /><br />创建一个scaffold<br /><pre name="code" class="ruby">$ script/generate scaffold User name:string time_zone:string
$ rake db:migrate</pre><br />用时间选择框代替文本框<br /><pre name="code" class="ruby"># views/users/new.html.erb
&lt;%= f.time_zone_select :time_zone, TimeZone.us_zones %></pre><br />看看效果<br /><img src="http://mad.ly/wp-content/uploads/2008/04/new_user.png" /><br />为了demo效果，添加一个login_from_querystring before_filter到controller<br /><pre name="code" class="ruby"># controllers/application.rb
before_filter :login_from_querystring
 
def login_from_querystring
  @current_user = User.find_by_name(params[:user])
end</pre><br />再添加一个set_time_zone before_filter，用来设置当前用户的时区信息<br /><pre name="code" class="ruby"># controllers/application.rb
before_filter :set_time_zone
 
def set_time_zone
  Time.zone = @current_user.time_zone if @current_user
end</pre><br />加个view，用来显示谁登录了，登录用户的时区，用户的当前时间<br /><pre name="code" class="ruby"># views/layouts/tasks.html.erb

Current user: &lt;%= @current_user.name if @current_user %>
Current time zone: &lt;%= Time.zone.name %>
Current time: &lt;%= Time.zone.now.inspect %>
&lt;hr /></pre><br />最后，需要显示一下时间(只是按照我的理解，原文可能并非此意)<br /><pre name="code" class="ruby">&lt;%=h task.alert_at.inspect %></pre><br />用户登录后，会看到之前已经设置好的时区<br /><img src="http://mad.ly/wp-content/uploads/2008/04/index_ralf.png" /><br />用户的页面显示的都是他们所在的时区的时间<img src="http://mad.ly/wp-content/uploads/2008/04/index_florian.png" /><br />如果用户没有登录，显示的就是config.time_zone中设置的时区<br /><img src="http://mad.ly/wp-content/uploads/2008/04/index_no_user.png" /><br /><br /><strong>在当前时区用来修改设置的一些方法</strong><br /><br /><strong>Time.zone.local(), Time.zone.parse() and Time.zone.at() Time.zone.now</strong><br /><pre name="code" class="ruby">>> Time.zone = 'Hawaii'
=> "Hawaii"
>> Time.zone.now
=> Wed, 09 Apr 2008 15:48:18 HST -10:00
>> Time.zone.local(2008, 4, 9, 15, 48, 18)
=> Wed, 09 Apr 2008 15:48:18 HST -10:00
>> Time.zone.parse('2008-04-09 15:48:18')
=> Wed, 09 Apr 2008 15:48:18 HST -10:00
>> Time.zone.at(1207792098)
=> Wed, 09 Apr 2008 15:48:18 HST -10:00</pre><br /><strong>in_time_zone</strong>函数可以把任何实例转化成存在Time.zone中的任何时区<br /><pre name="code" class="ruby">>> Time.zone = 'Alaska'
=> "Alaska"
>> t = Time.utc(2000)
=> Sat Jan 01 00:00:00 UTC 2000
>> t.in_time_zone
=> Fri, 31 Dec 1999 15:00:00 AKST -09:00</pre><br />也可以这样，用名称代表时区<br /><pre name="code" class="ruby">>> t.in_time_zone('Hawaii')
=> Fri, 31 Dec 1999 14:00:00 HST -10:00
>> t.in_time_zone(-6.hours)
=> Fri, 31 Dec 1999 18:00:00 CST -06:00</pre><br /><br /><strong>升级</strong><br />看原文吧，别鄙视我<br />   1. the new time zone features assume that the database is storing times in UTC, so if you've currently storing times in the database in a zone other than UTC, you'll need to migrate existing data to UTC<br />   2. if the tzinfo_timezone plugin is installed, you'll need to remove it, given that it overrides the TimeZone class in ActiveSupport<br />   3. the TZInfo gem is no longer required, given that it's now bundled in ActiveSupport. However, if you do have a recent version of this gem installed, Rails will favor the gem over the bundled version.<br />   4. The bundled TZInfo is a slimmed-down version of the gem, so if you're interacting with the TZInfo API directly, you should have the gem installed<br />   5. If you *don't* wish to use the new time zone features — the new features shouldn't interfere with your existing code, as long as you don't declare config.time_zone in environment.rb
          <br/>
          <span style="color:red;">
            <a href="http://t0uch.javaeye.com/blog/184194#comments" style="color:red;">本文的讨论也很精彩，浏览讨论>></a>
          </span>
          <br/><br/><br/>
          <span style="color:#E28822;">JavaEye推荐</span>
          <br/>
          <ul class='adverts'><li><a href='/adverts/106' target='_blank'><span style="color:blue;font-weight:bold;">JavaEye问答大赛开始了！ 从6月23日 至 7月6日，奖品丰厚 ！</span></a></li><li><a href='/adverts/92' target='_blank'><span style="color:red;font-weight:bold;">快来参加7月17日在成都举行的SOA中国技术论坛</span></a></li><li><a href='/adverts/97' target='_blank'><span style="color:blue;font-weight:bold;">Oracle专区上线，有Oracle最新文章，重要下载及知识库等精彩内容，欢迎访问。</span></a></li><li><a href='/adverts/42' target='_blank'><span style="color:red;font-weight:bold;">搜狐网站诚聘Java、PHP和C++工程师</span></a></li><li><a href='/adverts/41' target='_blank'><span style="color:red;font-weight:bold;">北京: 千橡集团暨校内网诚聘软件研发工程师</span></a></li></ul>
          <br/><br/><br/>
          ]]>
        </description>
        <pubDate>Fri, 18 Apr 2008 18:25:26 +0800</pubDate>
        <link>http://t0uch.javaeye.com/blog/184194</link>
        <guid>http://t0uch.javaeye.com/blog/184194</guid>
      </item>
      <item>
        <title>textmate-html小贴士</title>
        <author>t0uch</author>
        <description>
          <![CDATA[
          <br/>
          作者: <a href="http://t0uch.javaeye.com">t0uch</a>&nbsp;
          链接：<a href="http://t0uch.javaeye.com/blog/175113" style="color:red;">http://t0uch.javaeye.com/blog/175113</a>&nbsp;
          发表时间: 2008年03月23日
          <br/><br/>
          声明：本文系JavaEye网站发布的原创博客文章，未经作者书面许可，严禁任何网站转载本文，否则必将追究法律责任！
          <br/><br/>
          textmate中有大量的snippets来提供快捷输入,节省很多时间<br /><br />快速闭合标签:<br /><br />1.按住ctrl+shift+&lt;,这样会得到一个快速闭合标签,输入完后直接按tab来输入标签的内容<br />如: ctrl+shift+&lt;,然后输入html,然后按tab<br /><br />2.在输入标签名后,在标签名的右边输入ctrl+shift+&lt;,也可以得到一个快速闭合的标签<br /><br />3.在输入一个完整的开始标签后,可以输入option+command+. 来得到一个闭合的标签.<br />如:在输入完&lt;html>后,输入option+command+. 来得到一个闭合标签<br /><br />4.在输入一行文字后,我希望把这行文字做成一个p标签内的内容,可以选定这段文本,然后输入control+shift+w来给这段文字打上p标签.如果是几行,而且每行都需要打上p标签,许要输入control+shift+comman+w,这个命令默认是打上li标签,可以自行调整<br /><br />5.可以输入一下内容后输入tab来获取快捷输入<br />doctype⇥ 3,得到<br /><pre name="code" class="html">&lt;!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Frameset//EN"
	"http://www.w3.org/TR/xhtml1/DTD/xhtml1-frameset.dtd"></pre><br />style⇥,script⇥,control+回车,option+空格都得到一些很有用的快捷输入<br /><br />6.输入control+shift+l,可以得到一个<pre name="code" class="html">&lt;a href="⇥">&lt;/a></pre><br /><br />7.输入control+shift+v,可以通过网络来检测当前页面的语法<br />输入control+sfhift+h可以清除一些warning和error的语句<br />control+h还可以获得一个帮助文档
          <br/>
          <span style="color:red;">
            <a href="http://t0uch.javaeye.com/blog/175113#comments" style="color:red;">本文的讨论也很精彩，浏览讨论>></a>
          </span>
          <br/><br/><br/>
          <span style="color:#E28822;">JavaEye推荐</span>
          <br/>
          <ul class='adverts'><li><a href='/adverts/97' target='_blank'><span style="color:blue;font-weight:bold;">Oracle专区上线，有Oracle最新文章，重要下载及知识库等精彩内容，欢迎访问。</span></a></li><li><a href='/adverts/106' target='_blank'><span style="color:blue;font-weight:bold;">JavaEye问答大赛开始了！ 从6月23日 至 7月6日，奖品丰厚 ！</span></a></li><li><a href='/adverts/92' target='_blank'><span style="color:red;font-weight:bold;">快来参加7月17日在成都举行的SOA中国技术论坛</span></a></li><li><a href='/adverts/42' target='_blank'><span style="color:red;font-weight:bold;">搜狐网站诚聘Java、PHP和C++工程师</span></a></li><li><a href='/adverts/41' target='_blank'><span style="color:red;font-weight:bold;">北京: 千橡集团暨校内网诚聘软件研发工程师</span></a></li></ul>
          <br/><br/><br/>
          ]]>
        </description>
        <pubDate>Sun, 23 Mar 2008 14:53:52 +0800</pubDate>
        <link>http://t0uch.javaeye.com/blog/175113</link>
        <guid>http://t0uch.javaeye.com/blog/175113</guid>
      </item>
      <item>
        <title>Rails2之Depot</title>
        <author>t0uch</author>
        <description>
          <![CDATA[
          <br/>
          作者: <a href="http://t0uch.javaeye.com">t0uch</a>&nbsp;
          链接：<a href="http://t0uch.javaeye.com/blog/154421" style="color:red;">http://t0uch.javaeye.com/blog/154421</a>&nbsp;
          发表时间: 2008年01月09日
          <br/><br/>
          声明：本文系JavaEye网站发布的原创博客文章，未经作者书面许可，严禁任何网站转载本文，否则必将追究法律责任！
          <br/><br/>
          Rails2出来了这么久，WEB开发敏捷之道--应用RAILS进行敏捷WEB开发第二版前半部的代码对于Rails2已经不适用。我也是RoR初学，就来实践实践。<br /><br />从Depot建立开始 Let's code!<br /><br />同样，建立Depot工程<br /><pre name="code" class="ruby">rails depot</pre><br />首先，打开\config\database.yml文件<br /><br />可以到如下代码<br /><br /><pre name="code" class="ruby"># SQLite version 3.x
#   gem install sqlite3-ruby (not necessary on OS X Leopard)
development:
  adapter: sqlite3
  database: db/development.sqlite3
  timeout: 5000</pre><br />在rails 2.02中，默认使用sqlite3作为默认数据库，把它配置成你喜欢的数据库<br />这里用MySQL作为例子，即和之前一样。也可以通过<pre name="code" class="ruby">rails todo -d mysql</pre>来生成对应MySQL的database.yml<br /><pre name="code" class="ruby">development:
  adapter: mysql
  encoding: utf8
  database: Depot_development
  username: root
  password:
  host: localhost</pre><br /><br />值得一提的是，在Leopard操作系统下，生成的database.yml中<br /><pre name="code" class="ruby">host: localhost</pre>被替换成<pre name="code" class="ruby">socket: /opt/local/var/run/mysql5/mysqld.sock</pre><br />其中socket后面的内容可能不一样，这取决于你的操作系统。<br />如果需要把这个socket改成host的形式，需要安装MySQL的驱动<br /><pre name="code" class="ruby">sudo gem install mysql -- --with-mysql-config=/opt/local/lib/mysql5/bin/mysql_config</pre><br />详细可以看http://www.javaeye.com/topic/153842<br /><br />在Rails1.2中，需要手动建立好数据库Depot_development<br />现在只需要执行<pre name="code" class="ruby">rake db:create</pre>来生成相应的数据库。该语句默认生成的是development数据库，如果需要手动生成test和production数据库，需要指定RAILS_ENV。如<pre name="code" class="ruby">rake db:create RAILS_ENV=production</pre>同样的道理，在部署production模式的时候，也可以通过制定RAILS_ENV来实现<br />也可以一次性把production数据库和test数据库一起建好，通过执行<pre name="code" class="ruby">rake db:create:all</pre><br /><br />接下来，就是scaffold出场了，原来的scaffold已经不再适用，需要RESTFul方式的调用。<br />以下是原来的代码:<br /><pre name="code" class="java">ruby script/generate model product</pre><br />需要在相应的位置添加如下代码<br /><pre name="code" class="java">t.column :title, :string
t.column :description, :text
t.column :image_url, :string</pre><br />再生成controller才能插入scaffold<br />现在，新的scaffold需要这样来调用<br /><pre name="code" class="ruby">ruby script/generate scaffold admin title:string description:text image_url:string</pre><br />这里的<pre name="code" class="ruby">title:string description:text image_url:string</pre>为原来的model里头的代码<br />执行<pre name="code" class="ruby">ruby script/server</pre>访问<a href="http://127.0.0.1:3000/admins" target="_blank">http://127.0.0.1:3000/admins</a><br />是不是看到了久违的scaffold呢？<br /><br />我们也可以在config/routes.rb中添加如下代码，设置访问<a href="http://127.0.0.1:3000" target="_blank">http://127.0.0.1:3000</a>的默认controller<pre name="code" class="ruby">map.root :controller => 'admins'
map.resources :admins</pre>
          <br/>
          <span style="color:red;">
            <a href="http://t0uch.javaeye.com/blog/154421#comments" style="color:red;">本文的讨论也很精彩，浏览讨论>></a>
          </span>
          <br/><br/><br/>
          <span style="color:#E28822;">JavaEye推荐</span>
          <br/>
          <ul class='adverts'><li><a href='/adverts/41' target='_blank'><span style="color:red;font-weight:bold;">北京: 千橡集团暨校内网诚聘软件研发工程师</span></a></li><li><a href='/adverts/97' target='_blank'><span style="color:blue;font-weight:bold;">Oracle专区上线，有Oracle最新文章，重要下载及知识库等精彩内容，欢迎访问。</span></a></li><li><a href='/adverts/106' target='_blank'><span style="color:blue;font-weight:bold;">JavaEye问答大赛开始了！ 从6月23日 至 7月6日，奖品丰厚 ！</span></a></li><li><a href='/adverts/42' target='_blank'><span style="color:red;font-weight:bold;">搜狐网站诚聘Java、PHP和C++工程师</span></a></li><li><a href='/adverts/92' target='_blank'><span style="color:red;font-weight:bold;">快来参加7月17日在成都举行的SOA中国技术论坛</span></a></li></ul>
          <br/><br/><br/>
          ]]>
        </description>
        <pubDate>Wed, 09 Jan 2008 17:08:20 +0800</pubDate>
        <link>http://t0uch.javaeye.com/blog/154421</link>
        <guid>http://t0uch.javaeye.com/blog/154421</guid>
      </item>
      <item>
        <title>Rails 2.0.1 Todo List(2.0的scaffold?)</title>
        <author>t0uch</author>
        <description>
          <![CDATA[
          <br/>
          作者: <a href="http://t0uch.javaeye.com">t0uch</a>&nbsp;
          链接：<a href="http://t0uch.javaeye.com/blog/148791" style="color:red;">http://t0uch.javaeye.com/blog/148791</a>&nbsp;
          发表时间: 2007年12月17日
          <br/><br/>
          声明：本文系JavaEye网站发布的原创博客文章，未经作者书面许可，严禁任何网站转载本文，否则必将追究法律责任！
          <br/><br/>
          在别处看到的，感觉挺有趣，转一下<br /><br />rails todo<br />cd todo<br />rake db:create:all(在这之前要把数据库的用户名和密码输入正确)<br />ruby script/generate scaffold Todo title:string body:text done:boolean due:datetime<br />rake db:migrate<br /><br />开始服务<br />ruby script/server<br /><br />打开浏览器输入并访问http://localhost:3000/todos<br /><br />这是生成的todos_controller.rb<br /><pre name="code" class="java">
class TodosController &lt; ApplicationController
  # GET /todos
  # GET /todos.xml
  def index
    @todos = Todo.find(:all)

    respond_to do |format|
      format.html # index.html.erb
      format.xml  { render :xml => @todos }
    end
  end

  # GET /todos/1
  # GET /todos/1.xml
  def show
    @todo = Todo.find(params[:id])

    respond_to do |format|
      format.html # show.html.erb
      format.xml  { render :xml => @todo }
    end
  end

  # GET /todos/new
  # GET /todos/new.xml
  def new
    @todo = Todo.new

    respond_to do |format|
      format.html # new.html.erb
      format.xml  { render :xml => @todo }
    end
  end

  # GET /todos/1/edit
  def edit
    @todo = Todo.find(params[:id])
  end

  # POST /todos
  # POST /todos.xml
  def create
    @todo = Todo.new(params[:todo])

    respond_to do |format|
      if @todo.save
        flash[:notice] = 'Todo was successfully created.'
        format.html { redirect_to(@todo) }
        format.xml  { render :xml => @todo, :status => :created, :location => @todo }
      else
        format.html { render :action => "new" }
        format.xml  { render :xml => @todo.errors, :status => :unprocessable_entity }
      end
    end
  end

  # PUT /todos/1
  # PUT /todos/1.xml
  def update
    @todo = Todo.find(params[:id])

    respond_to do |format|
      if @todo.update_attributes(params[:todo])
        flash[:notice] = 'Todo was successfully updated.'
        format.html { redirect_to(@todo) }
        format.xml  { head :ok }
      else
        format.html { render :action => "edit" }
        format.xml  { render :xml => @todo.errors, :status => :unprocessable_entity }
      end
    end
  end

  # DELETE /todos/1
  # DELETE /todos/1.xml
  def destroy
    @todo = Todo.find(params[:id])
    @todo.destroy

    respond_to do |format|
      format.html { redirect_to(todos_url) }
      format.xml  { head :ok }
    end
  end
end

</pre><br /><br />自动生成的001_create_todos.rb<br /><pre name="code" class="java">
class CreateTodos &lt; ActiveRecord::Migration
  def self.up
    create_table :todos do |t|
      t.string :title
      t.text :body
      t.boolean :done
      t.datetime :due

      t.timestamps
    end
  end

  def self.down
    drop_table :todos
  end
end
</pre>
          <br/>
          <span style="color:red;">
            <a href="http://t0uch.javaeye.com/blog/148791#comments" style="color:red;">本文的讨论也很精彩，浏览讨论>></a>
          </span>
          <br/><br/><br/>
          <span style="color:#E28822;">JavaEye推荐</span>
          <br/>
          <ul class='adverts'><li><a href='/adverts/97' target='_blank'><span style="color:blue;font-weight:bold;">Oracle专区上线，有Oracle最新文章，重要下载及知识库等精彩内容，欢迎访问。</span></a></li><li><a href='/adverts/106' target='_blank'><span style="color:blue;font-weight:bold;">JavaEye问答大赛开始了！ 从6月23日 至 7月6日，奖品丰厚 ！</span></a></li><li><a href='/adverts/42' target='_blank'><span style="color:red;font-weight:bold;">搜狐网站诚聘Java、PHP和C++工程师</span></a></li><li><a href='/adverts/41' target='_blank'><span style="color:red;font-weight:bold;">北京: 千橡集团暨校内网诚聘软件研发工程师</span></a></li><li><a href='/adverts/92' target='_blank'><span style="color:red;font-weight:bold;">快来参加7月17日在成都举行的SOA中国技术论坛</span></a></li></ul>
          <br/><br/><br/>
          ]]>
        </description>
        <pubDate>Mon, 17 Dec 2007 10:37:45 +0800</pubDate>
        <link>http://t0uch.javaeye.com/blog/148791</link>
        <guid>http://t0uch.javaeye.com/blog/148791</guid>
      </item>
      <item>
        <title>880版本四阶幻方，我的机器上跑用了34ms</title>
        <author>t0uch</author>
        <description>
          <![CDATA[
          <br/>
          作者: <a href="http://t0uch.javaeye.com">t0uch</a>&nbsp;
          链接：<a href="http://t0uch.javaeye.com/blog/130544" style="color:red;">http://t0uch.javaeye.com/blog/130544</a>&nbsp;
          发表时间: 2007年10月10日
          <br/><br/>
          声明：本文系JavaEye网站发布的原创博客文章，未经作者书面许可，严禁任何网站转载本文，否则必将追究法律责任！
          <br/><br/>
          <p>闲来无事，改进改进，多说无益，贴代码，看帖要回帖啊各位</p>
<div class="dp-highlighter">

<ol class="dp-j">
    <li class="alt"><span><span>#include&nbsp;&lt;&nbsp;iostream&nbsp;&gt; &nbsp;&nbsp;</span></span></li>
    <li><span>#include&nbsp;&lt;&nbsp;time.h&nbsp;&gt; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>using&nbsp;namespace&nbsp;std; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>struct&nbsp;uni &nbsp;&nbsp;</span></li>
    <li class="alt"><span>{ &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">int</span><span>&nbsp;a,&nbsp;b,&nbsp;c,&nbsp;d; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>}; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>uni&nbsp;can[</span><span class="number">1032</span><span>]; &nbsp;&nbsp;</span></li>
    <li><span class="keyword">const</span><span>&nbsp;unsigned&nbsp;</span><span class="keyword">long</span><span>&nbsp;punk&nbsp;=&nbsp;1UL&nbsp;&lt;&lt;&nbsp;</span><span class="number">2</span><span>; &nbsp;&nbsp;</span></li>
    <li class="alt"><span class="keyword">int</span><span>&nbsp;sum&nbsp;=&nbsp;</span><span class="number">0</span><span>,&nbsp;sum_all&nbsp;=&nbsp;</span><span class="number">0</span><span>; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>bool&nbsp;test_4num(&nbsp;</span><span class="keyword">int</span><span>&nbsp;a,&nbsp;</span><span class="keyword">int</span><span>&nbsp;b,&nbsp;</span><span class="keyword">int</span><span>&nbsp;c,&nbsp;</span><span class="keyword">int</span><span>&nbsp;d&nbsp;) &nbsp;&nbsp;</span></li>
    <li><span>{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">int</span><span>&nbsp;i; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">for</span><span>&nbsp;(&nbsp;i&nbsp;=&nbsp;</span><span class="number">0</span><span>;i&nbsp;&lt;=&nbsp;sum;++i&nbsp;) &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">if</span><span>&nbsp;(&nbsp;can[i].a&nbsp;==&nbsp;d&nbsp;&amp;&amp; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[i].b&nbsp;==&nbsp;c&nbsp;&amp;&amp; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[i].c&nbsp;==&nbsp;b&nbsp;&amp;&amp; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[i].d&nbsp;==&nbsp;a&nbsp;) &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">return</span><span>&nbsp;</span><span class="keyword">false</span><span>; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">return</span><span>&nbsp;</span><span class="keyword">true</span><span>; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>} &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span class="keyword">void</span><span>&nbsp;get_all_num() &nbsp;&nbsp;</span></li>
    <li><span>{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">for</span><span>&nbsp;(&nbsp;</span><span class="keyword">int</span><span>&nbsp;i&nbsp;=&nbsp;</span><span class="number">1</span><span>;i&nbsp;&lt;=&nbsp;</span><span class="number">16</span><span>;++i&nbsp;) &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">for</span><span>&nbsp;(&nbsp;</span><span class="keyword">int</span><span>&nbsp;j&nbsp;=&nbsp;</span><span class="number">1</span><span>;j&nbsp;&lt;=&nbsp;</span><span class="number">16</span><span>;++j&nbsp;) &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">for</span><span>&nbsp;(&nbsp;</span><span class="keyword">int</span><span>&nbsp;k&nbsp;=&nbsp;</span><span class="number">1</span><span>;&nbsp;k&nbsp;&lt;=&nbsp;</span><span class="number">16</span><span>;&nbsp;++k&nbsp;) &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">for</span><span>&nbsp;(&nbsp;</span><span class="keyword">int</span><span>&nbsp;l&nbsp;=&nbsp;</span><span class="number">1</span><span>;l&nbsp;&lt;=&nbsp;</span><span class="number">16</span><span>;++l&nbsp;) &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">if</span><span>&nbsp;(&nbsp;i&nbsp;!=&nbsp;j&nbsp;&amp;&amp;&nbsp;i&nbsp;!=&nbsp;k&nbsp;&amp;&amp;&nbsp;i&nbsp;!=&nbsp;l&nbsp;&amp;&amp;&nbsp;j&nbsp;!=&nbsp;k&nbsp;&amp;&amp;&nbsp;j&nbsp;!=&nbsp;l&nbsp;&amp;&amp;&nbsp;k&nbsp;!=&nbsp;l&nbsp;&amp;&amp;&nbsp;i&nbsp;+&nbsp;j&nbsp;+&nbsp;k&nbsp;+&nbsp;l&nbsp;==&nbsp;</span><span class="number">34</span><span>&nbsp;&amp;&amp;&nbsp;test_4num(&nbsp;i,&nbsp;j,&nbsp;k,&nbsp;l&nbsp;)&nbsp;) &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[sum].a&nbsp;=&nbsp;i; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[sum].b&nbsp;=&nbsp;j; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[sum].c&nbsp;=&nbsp;k; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[sum].d&nbsp;=&nbsp;l; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;++sum; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="comment">//cout&nbsp;&lt;&lt;&nbsp;sum&nbsp;&lt;&lt;&nbsp;endl; </span><span>&nbsp;&nbsp;</span></li>
    <li><span>} &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span class="keyword">void</span><span>&nbsp;p_rint(&nbsp;</span><span class="keyword">const</span><span>&nbsp;</span><span class="keyword">int</span><span>&nbsp;sq[]&nbsp;) &nbsp;&nbsp;</span></li>
    <li class="alt"><span>{ &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;i&nbsp;wIll&nbsp;gIvE&nbsp;yOu&nbsp;sOme&nbsp;coLoR&nbsp;2CC!&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sum_all&nbsp;&lt;&lt;&nbsp;endl; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">0</span><span>]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">1</span><span>]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">2</span><span>]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">3</span><span>]&nbsp;&lt;&lt;&nbsp;endl; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">4</span><span>]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">5</span><span>]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">6</span><span>]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">7</span><span>]&nbsp;&lt;&lt;&nbsp;endl; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">8</span><span>]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">9</span><span>]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">10</span><span>]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">11</span><span>]&nbsp;&lt;&lt;&nbsp;endl; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">12</span><span>]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">13</span><span>]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">14</span><span>]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[</span><span class="number">15</span><span>]&nbsp;&lt;&lt;&nbsp;endl&nbsp;&lt;&lt;&nbsp;endl; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>} &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>__inline&nbsp;bool&nbsp;fill_in_line(&nbsp;</span><span class="keyword">const</span><span>&nbsp;</span><span class="keyword">int</span><span>&nbsp;c1[],&nbsp;</span><span class="keyword">const</span><span>&nbsp;</span><span class="keyword">int</span><span>&nbsp;c2[]&nbsp;) &nbsp;&nbsp;</span></li>
    <li><span>{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">int</span><span>&nbsp;sq[</span><span class="number">16</span><span>],&nbsp;k,&nbsp;l; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;unsigned&nbsp;</span><span class="keyword">long</span><span>&nbsp;a,&nbsp;b,&nbsp;c,&nbsp;d; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">0</span><span>]&nbsp;=&nbsp;c1[</span><span class="number">0</span><span>]; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">5</span><span>]&nbsp;=&nbsp;c1[</span><span class="number">1</span><span>]; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">10</span><span>]&nbsp;=&nbsp;c1[</span><span class="number">2</span><span>]; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">15</span><span>]&nbsp;=&nbsp;c1[</span><span class="number">3</span><span>]; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;a&nbsp;=&nbsp;punk&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">0</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">5</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">10</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">15</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;); &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">3</span><span>]&nbsp;=&nbsp;c2[</span><span class="number">0</span><span>]; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">6</span><span>]&nbsp;=&nbsp;c2[</span><span class="number">1</span><span>]; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">9</span><span>]&nbsp;=&nbsp;c2[</span><span class="number">2</span><span>]; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">12</span><span>]&nbsp;=&nbsp;c2[</span><span class="number">3</span><span>]; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;b&nbsp;=&nbsp;punk&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">3</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">6</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">9</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">12</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;); &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">if</span><span>&nbsp;(&nbsp;(&nbsp;a&nbsp;&amp;&nbsp;b&nbsp;)&nbsp;==&nbsp;punk&nbsp;) &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">for</span><span>&nbsp;(&nbsp;k&nbsp;=&nbsp;</span><span class="number">1</span><span>;k&nbsp;&lt;=&nbsp;</span><span class="number">16</span><span>;++k&nbsp;) &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">4</span><span>]&nbsp;=&nbsp;k; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">7</span><span>]&nbsp;=&nbsp;</span><span class="number">34</span><span>&nbsp;-&nbsp;sq[</span><span class="number">4</span><span>]&nbsp;-&nbsp;sq[</span><span class="number">5</span><span>]&nbsp;-&nbsp;sq[</span><span class="number">6</span><span>]; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">11</span><span>]&nbsp;=&nbsp;</span><span class="number">34</span><span>&nbsp;-&nbsp;sq[</span><span class="number">3</span><span>]&nbsp;-&nbsp;sq[</span><span class="number">7</span><span>]&nbsp;-&nbsp;sq[</span><span class="number">15</span><span>]; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">8</span><span>]&nbsp;=&nbsp;</span><span class="number">34</span><span>&nbsp;-&nbsp;sq[</span><span class="number">9</span><span>]&nbsp;-&nbsp;sq[</span><span class="number">10</span><span>]&nbsp;-&nbsp;sq[</span><span class="number">11</span><span>]; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">if</span><span>&nbsp;(&nbsp;sq[</span><span class="number">7</span><span>]&nbsp;&gt;&nbsp;</span><span class="number">0</span><span>&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">7</span><span>]&nbsp;&lt;=&nbsp;</span><span class="number">16</span><span>&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">11</span><span>]&nbsp;&gt;&nbsp;</span><span class="number">0</span><span>&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">11</span><span>]&nbsp;&lt;=&nbsp;</span><span class="number">16</span><span>&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">8</span><span>]&nbsp;&gt;&nbsp;</span><span class="number">0</span><span>&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">8</span><span>]&nbsp;&lt;=&nbsp;</span><span class="number">16</span><span>&nbsp;&amp;&amp; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">4</span><span>]&nbsp;!=&nbsp;sq[</span><span class="number">7</span><span>]&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">4</span><span>]&nbsp;!=&nbsp;sq[</span><span class="number">11</span><span>]&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">4</span><span>]&nbsp;!=&nbsp;sq[</span><span class="number">8</span><span>]&nbsp;&amp;&amp; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">7</span><span>]&nbsp;!=&nbsp;sq[</span><span class="number">11</span><span>]&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">7</span><span>]&nbsp;!=&nbsp;sq[</span><span class="number">8</span><span>]&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">11</span><span>]&nbsp;!=&nbsp;sq[</span><span class="number">8</span><span>]&nbsp;) &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;c&nbsp;=&nbsp;punk&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">4</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">7</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">11</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">8</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;); &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">if</span><span>&nbsp;(&nbsp;(&nbsp;b&nbsp;&amp;&nbsp;c&nbsp;)&nbsp;==&nbsp;punk&nbsp;&amp;&amp;&nbsp;(&nbsp;a&nbsp;&amp;&nbsp;c&nbsp;)&nbsp;==&nbsp;punk&nbsp;) &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">for</span><span>&nbsp;(&nbsp;l&nbsp;=&nbsp;</span><span class="number">1</span><span>;l&nbsp;&lt;=&nbsp;</span><span class="number">16</span><span>;++l&nbsp;) &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">1</span><span>]&nbsp;=&nbsp;l; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">13</span><span>]&nbsp;=&nbsp;</span><span class="number">34</span><span>&nbsp;-&nbsp;sq[</span><span class="number">1</span><span>]&nbsp;-&nbsp;sq[</span><span class="number">5</span><span>]&nbsp;-&nbsp;sq[</span><span class="number">9</span><span>]; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">14</span><span>]&nbsp;=&nbsp;</span><span class="number">34</span><span>&nbsp;-&nbsp;sq[</span><span class="number">12</span><span>]&nbsp;-&nbsp;sq[</span><span class="number">13</span><span>]&nbsp;-&nbsp;sq[</span><span class="number">15</span><span>]; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">2</span><span>]&nbsp;=&nbsp;</span><span class="number">34</span><span>&nbsp;-&nbsp;sq[</span><span class="number">0</span><span>]&nbsp;-&nbsp;sq[</span><span class="number">1</span><span>]&nbsp;-&nbsp;sq[</span><span class="number">3</span><span>]; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">if</span><span>&nbsp;(&nbsp;sq[</span><span class="number">13</span><span>]&nbsp;&gt;&nbsp;</span><span class="number">0</span><span>&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">13</span><span>]&nbsp;&lt;=&nbsp;</span><span class="number">16</span><span>&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">14</span><span>]&nbsp;&gt;&nbsp;</span><span class="number">0</span><span>&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">14</span><span>]&nbsp;&lt;=&nbsp;</span><span class="number">16</span><span>&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">2</span><span>]&nbsp;&gt;&nbsp;</span><span class="number">0</span><span>&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">2</span><span>]&nbsp;&lt;=&nbsp;</span><span class="number">16</span><span>&nbsp;&amp;&amp; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">1</span><span>]&nbsp;!=&nbsp;sq[</span><span class="number">13</span><span>]&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">1</span><span>]&nbsp;!=&nbsp;sq[</span><span class="number">14</span><span>]&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">1</span><span>]&nbsp;!=&nbsp;sq[</span><span class="number">2</span><span>]&nbsp;&amp;&amp; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[</span><span class="number">13</span><span>]&nbsp;!=&nbsp;sq[</span><span class="number">14</span><span>]&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">13</span><span>]&nbsp;!=&nbsp;sq[</span><span class="number">2</span><span>]&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">14</span><span>]&nbsp;!=&nbsp;sq[</span><span class="number">2</span><span>]&nbsp;) &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;d&nbsp;=&nbsp;punk&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">1</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">13</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">14</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;sq[</span><span class="number">2</span><span>]&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;); &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">if</span><span>&nbsp;(&nbsp;(&nbsp;a&nbsp;&amp;&nbsp;d&nbsp;)&nbsp;==&nbsp;punk&nbsp;&amp;&amp;&nbsp;(&nbsp;b&nbsp;&amp;&nbsp;d&nbsp;)&nbsp;==&nbsp;punk&nbsp;&amp;&amp;&nbsp;(&nbsp;c&nbsp;&amp;&nbsp;d&nbsp;)&nbsp;==&nbsp;punk&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">0</span><span>]&nbsp;+&nbsp;sq[</span><span class="number">4</span><span>]&nbsp;+&nbsp;sq[</span><span class="number">8</span><span>]&nbsp;+&nbsp;sq[</span><span class="number">12</span><span>]&nbsp;==&nbsp;</span><span class="number">34</span><span>&nbsp;&amp;&amp;&nbsp;sq[</span><span class="number">2</span><span>]&nbsp;+&nbsp;sq[</span><span class="number">6</span><span>]&nbsp;+&nbsp;sq[</span><span class="number">10</span><span>]&nbsp;+&nbsp;sq[</span><span class="number">14</span><span>]&nbsp;==&nbsp;</span><span class="number">34</span><span>&nbsp;) &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sum_all++; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="comment">//p_rint(sq); </span><span>&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">return</span><span>&nbsp;</span><span class="keyword">true</span><span>; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>} &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span class="keyword">void</span><span>&nbsp;fill_in_eight() &nbsp;&nbsp;</span></li>
    <li><span>{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">int</span><span>&nbsp;cse1[</span><span class="number">4</span><span>],&nbsp;cse2[</span><span class="number">4</span><span>],&nbsp;i,&nbsp;j; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;unsigned&nbsp;</span><span class="keyword">long</span><span>&nbsp;m,&nbsp;n; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">for</span><span>&nbsp;(&nbsp;i&nbsp;=&nbsp;</span><span class="number">0</span><span>;i&nbsp;&lt;&nbsp;sum;i++&nbsp;) &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">for</span><span>&nbsp;(&nbsp;j&nbsp;=&nbsp;i&nbsp;+&nbsp;</span><span class="number">1</span><span>;j&nbsp;&lt;&nbsp;sum;j++&nbsp;) &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;m&nbsp;=&nbsp;punk&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;can[i].a&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;can[i].b&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;can[i].c&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;can[i].d&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;); &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;n&nbsp;=&nbsp;punk&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;can[j].a&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;can[j].b&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;can[j].c&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;)&nbsp;|&nbsp;(&nbsp;1UL&nbsp;&lt;&lt;&nbsp;(&nbsp;can[j].d&nbsp;*&nbsp;</span><span class="number">2</span><span>&nbsp;)&nbsp;); &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">if</span><span>&nbsp;(&nbsp;(&nbsp;m&nbsp;&amp;&nbsp;n&nbsp;)&nbsp;==&nbsp;punk&nbsp;) &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse1[</span><span class="number">0</span><span>]&nbsp;=&nbsp;can[i].a; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse1[</span><span class="number">1</span><span>]&nbsp;=&nbsp;can[i].b; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse1[</span><span class="number">2</span><span>]&nbsp;=&nbsp;can[i].c; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse1[</span><span class="number">3</span><span>]&nbsp;=&nbsp;can[i].d; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse2[</span><span class="number">0</span><span>]&nbsp;=&nbsp;can[j].a; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse2[</span><span class="number">1</span><span>]&nbsp;=&nbsp;can[j].b; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse2[</span><span class="number">2</span><span>]&nbsp;=&nbsp;can[j].c; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse2[</span><span class="number">3</span><span>]&nbsp;=&nbsp;can[j].d; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;fill_in_line(&nbsp;cse1,&nbsp;cse2&nbsp;); &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;} &nbsp;&nbsp;</span></li>
    <li class="alt"><span>} &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span class="keyword">int</span><span>&nbsp;main() &nbsp;&nbsp;</span></li>
    <li><span>{ &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;time_t&nbsp;t; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;get_all_num(); &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>&nbsp; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;t&nbsp;=&nbsp;clock(); &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;fill_in_eight(); &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;time&nbsp;consumed:&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;clock()&nbsp;-&nbsp;t&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;ms&quot;</span><span>&nbsp;&lt;&lt;&nbsp;endl; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;sum_all&nbsp;&lt;&lt;&nbsp;endl; &nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;</span><span class="keyword">return</span><span>&nbsp;</span><span class="number">0</span><span>; &nbsp;&nbsp;</span></li>
    <li class="alt"><span>} &nbsp;&nbsp;</span></li>
</ol>
</div>
<p>&nbsp;</p>
          <br/>
          <span style="color:red;">
            <a href="http://t0uch.javaeye.com/blog/130544#comments" style="color:red;">本文的讨论也很精彩，浏览讨论>></a>
          </span>
          <br/><br/><br/>
          <span style="color:#E28822;">JavaEye推荐</span>
          <br/>
          <ul class='adverts'><li><a href='/adverts/92' target='_blank'><span style="color:red;font-weight:bold;">快来参加7月17日在成都举行的SOA中国技术论坛</span></a></li><li><a href='/adverts/41' target='_blank'><span style="color:red;font-weight:bold;">北京: 千橡集团暨校内网诚聘软件研发工程师</span></a></li><li><a href='/adverts/97' target='_blank'><span style="color:blue;font-weight:bold;">Oracle专区上线，有Oracle最新文章，重要下载及知识库等精彩内容，欢迎访问。</span></a></li><li><a href='/adverts/42' target='_blank'><span style="color:red;font-weight:bold;">搜狐网站诚聘Java、PHP和C++工程师</span></a></li><li><a href='/adverts/106' target='_blank'><span style="color:blue;font-weight:bold;">JavaEye问答大赛开始了！ 从6月23日 至 7月6日，奖品丰厚 ！</span></a></li></ul>
          <br/><br/><br/>
          ]]>
        </description>
        <pubDate>Wed, 10 Oct 2007 10:29:30 +0800</pubDate>
        <link>http://t0uch.javaeye.com/blog/130544</link>
        <guid>http://t0uch.javaeye.com/blog/130544</guid>
      </item>
      <item>
        <title>四阶幻方 v1.1 向2064ms进发</title>
        <author>t0uch</author>
        <description>
          <![CDATA[
          <br/>
          作者: <a href="http://t0uch.javaeye.com">t0uch</a>&nbsp;
          链接：<a href="http://t0uch.javaeye.com/blog/116211" style="color:red;">http://t0uch.javaeye.com/blog/116211</a>&nbsp;
          发表时间: 2007年08月24日
          <br/><br/>
          声明：本文系JavaEye网站发布的原创博客文章，未经作者书面许可，严禁任何网站转载本文，否则必将追究法律责任！
          <br/><br/>
          改进了一下程序，在我的p4 3.2上以2064ms运算完7040个<br />
到此告一段落，880的版本不想写了，麻烦，研究一下五阶的，好像好复杂。371993326789901217467999448150835200000000个组合，呼呼。<br />
<br />
开头的两个include 是iostream 和time.h，万恶的代码显示器<br />
<br />
<div class="code_title">cpp 代码</div>
<div class="dp-highlighter">
<div class="bar">&nbsp;</div>
<ol class="dp-cpp">
    <li class="alt"><span><span class="preprocessor">#include&nbsp;</span><span>&nbsp;&nbsp;</span></span></li>
    <li><span><span class="preprocessor">#include&nbsp;</span><span>&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span><span class="keyword">using</span><span>&nbsp;</span><span class="keyword">namespace</span><span>&nbsp;std;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span><span class="keyword">struct</span><span>&nbsp;uni&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="datatypes">int</span><span>&nbsp;a,b,c,d;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>};&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>uni&nbsp;can[3000];&nbsp;&nbsp;</span></li>
    <li><span><span class="datatypes">int</span><span>&nbsp;sum&nbsp;=&nbsp;0,sum_all&nbsp;=&nbsp;0;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span><span class="keyword">void</span><span>&nbsp;get_all_num()&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span>&nbsp;i&nbsp;=&nbsp;1;i&nbsp;&lt;=&nbsp;16;++i)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span>&nbsp;j&nbsp;=&nbsp;1;j&nbsp;&lt;=&nbsp;16;++j)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span>&nbsp;k&nbsp;=&nbsp;1;&nbsp;k&nbsp;&lt;=&nbsp;16;&nbsp;++k)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span>&nbsp;l&nbsp;=&nbsp;1;l&nbsp;&lt;=&nbsp;16;++l)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(i&nbsp;!=&nbsp;j&nbsp;&amp;&amp;&nbsp;i&nbsp;!=&nbsp;k&nbsp;&amp;&amp;&nbsp;i&nbsp;!=&nbsp;l&nbsp;&amp;&amp;&nbsp;j&nbsp;!=&nbsp;k&nbsp;&amp;&amp;&nbsp;j&nbsp;!=&nbsp;l&nbsp;&amp;&amp;&nbsp;k&nbsp;!=&nbsp;l)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(i&nbsp;+&nbsp;j&nbsp;+&nbsp;k&nbsp;+&nbsp;l&nbsp;==&nbsp;34)&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[sum].a&nbsp;=&nbsp;i;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[sum].b&nbsp;=&nbsp;j;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[sum].c&nbsp;=&nbsp;k;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[sum].d&nbsp;=&nbsp;l;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;++sum;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>}&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span><span class="keyword">void</span><span>&nbsp;p_rint(</span><span class="keyword">const</span><span>&nbsp;</span><span class="datatypes">int</span><span>&nbsp;sq[])&nbsp;&nbsp;</span></span></li>
    <li><span>{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;<span class="string">&quot;i&nbsp;wIll&nbsp;gIvE&nbsp;yOu&nbsp;sOme&nbsp;coLoR&nbsp;2CC!&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sum_all&nbsp;&lt;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;sq[0]&nbsp;&lt;&lt;&nbsp;<span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[1]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[2]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[3]&nbsp;&lt;&lt;&nbsp;endl;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;sq[4]&nbsp;&lt;&lt;&nbsp;<span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[5]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[6]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[7]&nbsp;&lt;&lt;&nbsp;endl;&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;sq[8]&nbsp;&lt;&lt;&nbsp;<span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[9]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[10]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[11]&nbsp;&lt;&lt;&nbsp;endl;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;sq[12]&nbsp;&lt;&lt;&nbsp;<span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[13]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[14]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[15]&nbsp;&lt;&lt;&nbsp;endl&nbsp;&lt;&lt;&nbsp;endl;&nbsp;&nbsp;</span></span></li>
    <li><span>}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span><span class="datatypes">bool</span><span>&nbsp;caca(</span><span class="keyword">const</span><span>&nbsp;</span><span class="datatypes">int</span><span>&nbsp;sq[])&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(sq[0]&nbsp;+&nbsp;sq[4]&nbsp;+&nbsp;sq[8]&nbsp;+&nbsp;sq[12]&nbsp;!=34)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">false</span><span>;&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(sq[2]&nbsp;+&nbsp;sq[6]&nbsp;+&nbsp;sq[10]&nbsp;+&nbsp;sq[14]&nbsp;!=34)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">false</span><span>;&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">true</span><span>;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>}&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span><span class="datatypes">bool</span><span>&nbsp;detec_2(</span><span class="keyword">const</span><span>&nbsp;</span><span class="datatypes">int</span><span>&nbsp;sq[])&nbsp;&nbsp;</span></span></li>
    <li><span>{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="datatypes">int</span><span>&nbsp;km2[17];&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="datatypes">int</span><span>&nbsp;i,m;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(i&nbsp;=&nbsp;0;i&nbsp;&lt;=&nbsp;16;++i)&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;km2[i]&nbsp;=&nbsp;0;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(m&nbsp;=&nbsp;0;m&nbsp;&lt;&nbsp;16;++m)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;km2[sq[m]]++;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(km2[sq[m]]&nbsp;&gt;&nbsp;1)&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">false</span><span>;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">true</span><span>;&nbsp;&nbsp;</span></span></li>
    <li><span>}&nbsp;&nbsp;</span></li>
    <li class="alt"><span><span class="datatypes">bool</span><span>&nbsp;detec_1(</span><span class="keyword">const</span><span>&nbsp;</span><span class="datatypes">int</span><span>&nbsp;c1[],</span><span class="keyword">const</span><span>&nbsp;</span><span class="datatypes">int</span><span>&nbsp;c2[])&nbsp;&nbsp;</span></span></li>
    <li><span>{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="datatypes">int</span><span>&nbsp;km2[17],i;&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(i&nbsp;=&nbsp;0;i&nbsp;&lt;&nbsp;16;++i)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;km2[i]&nbsp;=&nbsp;0;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c1[0]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c1[1]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c1[2]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c1[3]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c2[0]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c2[1]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c2[2]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c2[3]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(i&nbsp;=&nbsp;0;i&nbsp;&lt;&nbsp;16;i++)&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(km2[i]&nbsp;&gt;&nbsp;1)&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">false</span><span>;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">true</span><span>;&nbsp;&nbsp;</span></span></li>
    <li><span>}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span><span class="keyword">void</span><span>&nbsp;fill_in_line(</span><span class="keyword">const</span><span>&nbsp;</span><span class="datatypes">int</span><span>&nbsp;c1[],</span><span class="keyword">const</span><span>&nbsp;</span><span class="datatypes">int</span><span>&nbsp;c2[])&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="datatypes">int</span><span>&nbsp;sq[16],k,l;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[0]&nbsp;=&nbsp;c1[0];&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[5]&nbsp;=&nbsp;c1[1];&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[10]&nbsp;=&nbsp;c1[2];&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[15]&nbsp;=&nbsp;c1[3];&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[3]&nbsp;=&nbsp;c2[0];&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[6]&nbsp;=&nbsp;c2[1];&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[9]&nbsp;=&nbsp;c2[2];&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[12]&nbsp;=&nbsp;c2[3];&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(k&nbsp;=&nbsp;1;k&nbsp;&lt;=&nbsp;16;k++)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[4]&nbsp;=&nbsp;k;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(k&nbsp;!=&nbsp;c1[0]&nbsp;&amp;&amp;&nbsp;k&nbsp;!=&nbsp;c1[1]&nbsp;&amp;&amp;&nbsp;k&nbsp;!=&nbsp;c1[2]&nbsp;&amp;&amp;&nbsp;k&nbsp;!=&nbsp;c1[3]&nbsp;&amp;&amp;&nbsp;k&nbsp;!=&nbsp;c2[0]&nbsp;&amp;&amp;&nbsp;k&nbsp;!=&nbsp;c2[1]&nbsp;&amp;&amp;&nbsp;k&nbsp;!=&nbsp;c2[2]&nbsp;&amp;&amp;&nbsp;k&nbsp;!=&nbsp;c2[3])&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(l&nbsp;=&nbsp;1;l&nbsp;&lt;=&nbsp;16;++l)&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[1]&nbsp;=&nbsp;l;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(l&nbsp;!=&nbsp;sq[4])&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[7]&nbsp;=&nbsp;34&nbsp;-&nbsp;sq[4]&nbsp;-&nbsp;sq[5]&nbsp;-&nbsp;sq[6];&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[11]&nbsp;=&nbsp;34&nbsp;-&nbsp;sq[3]&nbsp;-&nbsp;sq[7]&nbsp;-&nbsp;sq[15];&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[8]&nbsp;=&nbsp;34&nbsp;-&nbsp;sq[9]&nbsp;-&nbsp;sq[10]&nbsp;-&nbsp;sq[11];&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[13]&nbsp;=&nbsp;34&nbsp;-&nbsp;sq[1]&nbsp;-&nbsp;sq[5]&nbsp;-&nbsp;sq[9];&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[14]&nbsp;=&nbsp;34&nbsp;-&nbsp;sq[12]&nbsp;-&nbsp;sq[13]&nbsp;-&nbsp;sq[15];&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[2]&nbsp;=&nbsp;34&nbsp;-&nbsp;sq[0]&nbsp;-&nbsp;sq[1]&nbsp;-&nbsp;sq[3];&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(sq[7]&nbsp;&gt;&nbsp;0&nbsp;&amp;&amp;&nbsp;sq[11]&nbsp;&gt;&nbsp;0&nbsp;&amp;&amp;&nbsp;sq[8]&nbsp;&gt;&nbsp;0&nbsp;&amp;&amp;&nbsp;sq[13]&nbsp;&gt;&nbsp;0&nbsp;&amp;&amp;&nbsp;sq[14]&nbsp;&gt;&nbsp;0&nbsp;&amp;&amp;&nbsp;sq[2]&nbsp;&gt;&nbsp;0&nbsp;&amp;&amp;&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[7]&nbsp;&lt;=&nbsp;16&nbsp;&amp;&amp;&nbsp;sq[11]&nbsp;&lt;=&nbsp;16&nbsp;&amp;&amp;&nbsp;sq[8]&nbsp;&lt;=&nbsp;16&nbsp;&amp;&amp;&nbsp;sq[13]&nbsp;&lt;=&nbsp;16&nbsp;&amp;&amp;&nbsp;sq[14]&nbsp;&lt;=&nbsp;16&nbsp;&amp;&amp;&nbsp;sq[2]&nbsp;&lt;=&nbsp;16)&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>((sq[0]&nbsp;+&nbsp;sq[1]&nbsp;+&nbsp;sq[4]&nbsp;+&nbsp;sq[5]&nbsp;==&nbsp;sq[10]&nbsp;+&nbsp;sq[11]&nbsp;+&nbsp;sq[14]&nbsp;+&nbsp;sq[15])&nbsp;&amp;&amp;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;(sq[2]&nbsp;+&nbsp;sq[3]&nbsp;+&nbsp;sq[6]&nbsp;+&nbsp;sq[7]&nbsp;==&nbsp;sq[8]&nbsp;+&nbsp;sq[9]&nbsp;+&nbsp;sq[12]&nbsp;+&nbsp;sq[13])&nbsp;&amp;&amp;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;caca(sq)&nbsp;&amp;&amp;&nbsp;detec_2(sq))&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sum_all++;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <span class="comment">p_rint(sq);</span><span>&nbsp;&nbsp;</span></span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>}&nbsp;&nbsp;</span></li>
    <li><span><span class="keyword">void</span><span>&nbsp;fill_in_eight()&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="datatypes">int</span><span>&nbsp;cse1[4],cse2[4];&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span>&nbsp;i&nbsp;=&nbsp;0;i&nbsp;&lt;&nbsp;sum;++i)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span>&nbsp;j&nbsp;=&nbsp;0;j&nbsp;&lt;&nbsp;sum;++j)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(&nbsp;i!=j&nbsp;)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse1[0]&nbsp;=&nbsp;can[i].a;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse1[1]&nbsp;=&nbsp;can[i].b;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse1[2]&nbsp;=&nbsp;can[i].c;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse1[3]&nbsp;=&nbsp;can[i].d;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse2[0]&nbsp;=&nbsp;can[j].a;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse2[1]&nbsp;=&nbsp;can[j].b;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse2[2]&nbsp;=&nbsp;can[j].c;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cse2[3]&nbsp;=&nbsp;can[j].d;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(detec_1(cse1,cse2))&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;fill_in_line(cse1,cse2);&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li><span>}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li><span><span class="datatypes">int</span><span>&nbsp;main()&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>{&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="datatypes">time_t</span><span>&nbsp;t;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;t&nbsp;=&nbsp;clock();&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;get_all_num();&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;fill_in_eight();&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;<span class="string">&quot;time&nbsp;consumed:&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;clock()&nbsp;-&nbsp;t&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;ms&quot;</span><span>&lt;&lt;&nbsp;endl;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;0;&nbsp;&nbsp;</span></span></li>
    <li><span>}</span></li>
</ol>
</div>
          <br/>
          <span style="color:red;">
            <a href="http://t0uch.javaeye.com/blog/116211#comments" style="color:red;">本文的讨论也很精彩，浏览讨论>></a>
          </span>
          <br/><br/><br/>
          <span style="color:#E28822;">JavaEye推荐</span>
          <br/>
          <ul class='adverts'><li><a href='/adverts/106' target='_blank'><span style="color:blue;font-weight:bold;">JavaEye问答大赛开始了！ 从6月23日 至 7月6日，奖品丰厚 ！</span></a></li><li><a href='/adverts/92' target='_blank'><span style="color:red;font-weight:bold;">快来参加7月17日在成都举行的SOA中国技术论坛</span></a></li><li><a href='/adverts/97' target='_blank'><span style="color:blue;font-weight:bold;">Oracle专区上线，有Oracle最新文章，重要下载及知识库等精彩内容，欢迎访问。</span></a></li><li><a href='/adverts/41' target='_blank'><span style="color:red;font-weight:bold;">北京: 千橡集团暨校内网诚聘软件研发工程师</span></a></li><li><a href='/adverts/42' target='_blank'><span style="color:red;font-weight:bold;">搜狐网站诚聘Java、PHP和C++工程师</span></a></li></ul>
          <br/><br/><br/>
          ]]>
        </description>
        <pubDate>Fri, 24 Aug 2007 17:14:52 +0800</pubDate>
        <link>http://t0uch.javaeye.com/blog/116211</link>
        <guid>http://t0uch.javaeye.com/blog/116211</guid>
      </item>
      <item>
        <title>四阶幻方</title>
        <author>t0uch</author>
        <description>
          <![CDATA[
          <br/>
          作者: <a href="http://t0uch.javaeye.com">t0uch</a>&nbsp;
          链接：<a href="http://t0uch.javaeye.com/blog/115681" style="color:red;">http://t0uch.javaeye.com/blog/115681</a>&nbsp;
          发表时间: 2007年08月23日
          <br/><br/>
          声明：本文系JavaEye网站发布的原创博客文章，未经作者书面许可，严禁任何网站转载本文，否则必将追究法律责任！
          <br/><br/>
          我写的四阶幻方出来了，运行结果正确，7040个的版本。虽然好像还有些问题，不过算了，能跑就可以了，呵呵。<br />
不要输出的话我的p4 3.2G上耗时5s，算还过得去吧 ^_^<br />
以下是程序：<br />
<font size="2" face="Courier New">
<div class="code_title"><font>cpp 代码</font></div>
<div class="dp-highlighter">
<div class="bar">&nbsp;</div>
<ol class="dp-cpp" start="1"><font>
    <li class=""><span><span class="preprocessor">#include <iostream></iostream></span></span></li>
    <li class=""><span><span class="preprocessor">#include <time.h></time.h></span></span></li>
    <li class=""><span><span class="preprocessor"><br />
    </span></span></li>
    <li class=""><span><span class="keyword">using</span><span>&nbsp;</span><span class="keyword">namespace</span><span>&nbsp;std;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li class=""><span><span class="keyword">struct</span><span>&nbsp;uni&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>{&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="datatypes">int</span><span>&nbsp;a,b,c,d;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>};&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>uni&nbsp;can[2065];&nbsp;&nbsp;</span></li>
    <li class=""><span><span class="datatypes">long</span><span>&nbsp;sum&nbsp;=&nbsp;0;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span><span class="datatypes">int</span><span>&nbsp;sum_all&nbsp;=&nbsp;0;&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span><span class="keyword">void</span><span>&nbsp;get_all_num()&nbsp;&nbsp;</span></span></li>
    <li class=""><span>{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span>&nbsp;i&nbsp;=&nbsp;1;i&nbsp;&lt;=&nbsp;16;++i)&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span>&nbsp;j&nbsp;=&nbsp;1;j&nbsp;&lt;=&nbsp;16;++j)&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span>&nbsp;k&nbsp;=&nbsp;1;&nbsp;k&nbsp;&lt;=&nbsp;16;&nbsp;++k)&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span>&nbsp;l&nbsp;=&nbsp;1;l&nbsp;&lt;=&nbsp;16;++l)&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(i&nbsp;!=&nbsp;j&nbsp;&amp;&amp;&nbsp;i&nbsp;!=&nbsp;k&nbsp;&amp;&amp;&nbsp;i&nbsp;!=&nbsp;l&nbsp;&amp;&amp;&nbsp;j&nbsp;!=&nbsp;k&nbsp;&amp;&amp;&nbsp;j&nbsp;!=&nbsp;l&nbsp;&amp;&amp;&nbsp;k&nbsp;!=&nbsp;l)&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(i&nbsp;+&nbsp;j&nbsp;+&nbsp;k&nbsp;+&nbsp;l&nbsp;==&nbsp;34)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[sum].a&nbsp;=&nbsp;i;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[sum].b&nbsp;=&nbsp;j;&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[sum].c&nbsp;=&nbsp;k;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;can[sum].d&nbsp;=&nbsp;l;&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;++sum;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class=""><span>}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li class=""><span><span class="keyword">void</span><span>&nbsp;p_rint(</span><span class="keyword">const</span><span>&nbsp;</span><span class="datatypes">int</span><span>&nbsp;sq[])&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>{&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;<span class="string">&quot;i&nbsp;wIll&nbsp;gIvE&nbsp;yOu&nbsp;sOme&nbsp;coLoR&nbsp;2CC!&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sum_all&nbsp;&lt;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;sq[0]&nbsp;&lt;&lt;&nbsp;<span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[1]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[2]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[3]&nbsp;&lt;&lt;&nbsp;endl;&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;sq[4]&nbsp;&lt;&lt;&nbsp;<span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[5]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[6]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[7]&nbsp;&lt;&lt;&nbsp;endl;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;sq[8]&nbsp;&lt;&lt;&nbsp;<span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[9]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[10]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[11]&nbsp;&lt;&lt;&nbsp;endl;&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;sq[12]&nbsp;&lt;&lt;&nbsp;<span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[13]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[14]&nbsp;&lt;&lt;&nbsp;</span><span class="string">&quot;&nbsp;&quot;</span><span>&nbsp;&lt;&lt;&nbsp;sq[15]&nbsp;&lt;&lt;&nbsp;endl&nbsp;&lt;&lt;&nbsp;endl;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>}&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span><span class="keyword">inline</span><span>&nbsp;</span><span class="datatypes">bool</span><span>&nbsp;caca(</span><span class="keyword">const</span><span>&nbsp;</span><span class="datatypes">int</span><span>&nbsp;sq[])&nbsp;&nbsp;</span></span></li>
    <li class=""><span>{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(sq[0]&nbsp;+&nbsp;sq[4]&nbsp;+&nbsp;sq[8]&nbsp;+&nbsp;sq[12]&nbsp;!=34)&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">false</span><span>;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(sq[2]&nbsp;+&nbsp;sq[6]&nbsp;+&nbsp;sq[10]&nbsp;+&nbsp;sq[14]&nbsp;!=34)&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">false</span><span>;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">true</span><span>;&nbsp;&nbsp;</span></span></li>
    <li class=""><span>}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li class=""><span><span class="keyword">inline</span><span>&nbsp;</span><span class="datatypes">bool</span><span>&nbsp;detec_2(</span><span class="keyword">const</span><span>&nbsp;</span><span class="datatypes">int</span><span>&nbsp;sq[])&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>{&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="datatypes">int</span><span>&nbsp;km2[17];&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="datatypes">int</span><span>&nbsp;i,m;&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(i&nbsp;=&nbsp;0;i&nbsp;&lt;&nbsp;16;++i)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;km2[i]&nbsp;=&nbsp;0;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(m&nbsp;=&nbsp;0;m&nbsp;&lt;&nbsp;16;++m)&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;km2[sq[m]]++;&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(km2[sq[m]]&nbsp;&gt;&nbsp;1)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">false</span><span>;&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">true</span><span>;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>}&nbsp;&nbsp;</span></li>
    <li class=""><span><span class="keyword">inline</span><span>&nbsp;</span><span class="datatypes">bool</span><span>&nbsp;detec_1(</span><span class="keyword">const</span><span>&nbsp;</span><span class="datatypes">int</span><span>&nbsp;c1[],</span><span class="keyword">const</span><span>&nbsp;</span><span class="datatypes">int</span><span>&nbsp;c2[])&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>{&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="datatypes">int</span><span>&nbsp;km2[17];&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span>&nbsp;i&nbsp;=&nbsp;0;i&nbsp;&lt;&nbsp;16;++i)&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;km2[i]&nbsp;=&nbsp;0;&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c1[0]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c1[1]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c1[2]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c1[3]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c2[0]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c2[1]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c2[2]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;km2[c2[3]&nbsp;-&nbsp;1]++;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(i&nbsp;=&nbsp;0;i&nbsp;&lt;&nbsp;16;i++)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(km2[i]&nbsp;&gt;&nbsp;1)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">false</span><span>;&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;}&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">return</span><span>&nbsp;</span><span class="keyword">true</span><span>;&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>}&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span><span class="keyword">void</span><span>&nbsp;fill_in_line(</span><span class="datatypes">int</span><span>&nbsp;c1[],</span><span class="datatypes">int</span><span>&nbsp;c2[])&nbsp;&nbsp;</span></span></li>
    <li class=""><span>{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="datatypes">int</span><span>&nbsp;sq[16];&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[0]&nbsp;=&nbsp;c1[0];&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[5]&nbsp;=&nbsp;c1[1];&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[10]&nbsp;=&nbsp;c1[2];&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[15]&nbsp;=&nbsp;c1[3];&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[3]&nbsp;=&nbsp;c2[0];&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[6]&nbsp;=&nbsp;c2[1];&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[9]&nbsp;=&nbsp;c2[2];&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;sq[12]&nbsp;=&nbsp;c2[3];&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span>&nbsp;k&nbsp;=&nbsp;1;k&nbsp;&lt;=&nbsp;16;k++)&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[4]&nbsp;=&nbsp;k;&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">for</span><span>(</span><span class="datatypes">int</span><span>&nbsp;l&nbsp;=&nbsp;1;l&nbsp;&lt;=&nbsp;16;++l)&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[1]&nbsp;=&nbsp;l;&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[7]&nbsp;=&nbsp;34&nbsp;-&nbsp;sq[4]&nbsp;-&nbsp;sq[5]&nbsp;-&nbsp;sq[6];&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[11]&nbsp;=&nbsp;34&nbsp;-&nbsp;sq[3]&nbsp;-&nbsp;sq[7]&nbsp;-&nbsp;sq[15];&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[8]&nbsp;=&nbsp;34&nbsp;-&nbsp;sq[9]&nbsp;-&nbsp;sq[10]&nbsp;-&nbsp;sq[11];&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[13]&nbsp;=&nbsp;34&nbsp;-&nbsp;sq[1]&nbsp;-&nbsp;sq[5]&nbsp;-&nbsp;sq[9];&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[14]&nbsp;=&nbsp;34&nbsp;-&nbsp;sq[12]&nbsp;-&nbsp;sq[13]&nbsp;-&nbsp;sq[15];&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sq[2]&nbsp;=&nbsp;34&nbsp;-&nbsp;sq[0]&nbsp;-&nbsp;sq[1]&nbsp;-&nbsp;sq[3];&nbsp;&nbsp;</span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(sq[7]&nbsp;&gt;&nbsp;0&nbsp;&amp;&amp;&nbsp;sq[11]&nbsp;&gt;&nbsp;0&nbsp;&amp;&amp;&nbsp;sq[8]&nbsp;&gt;&nbsp;0&nbsp;&amp;&amp;&nbsp;sq[13]&nbsp;&gt;&nbsp;0&nbsp;&amp;&amp;&nbsp;sq[14]&nbsp;&gt;&nbsp;0&nbsp;&amp;&amp;&nbsp;sq[2]&nbsp;&gt;&nbsp;0)&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(sq[7]&nbsp;&lt;=&nbsp;16&nbsp;&amp;&amp;&nbsp;sq[11]&nbsp;&lt;=&nbsp;16&nbsp;&amp;&amp;&nbsp;sq[8]&nbsp;&lt;=&nbsp;16&nbsp;&amp;&amp;&nbsp;sq[13]&nbsp;&lt;=&nbsp;16&nbsp;&amp;&amp;&nbsp;sq[14]&nbsp;&lt;=&nbsp;16&nbsp;&amp;&amp;&nbsp;sq[2]&nbsp;&lt;=&nbsp;16)&nbsp;&nbsp;</span></span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">if</span><span>(detec_2(sq)&nbsp;&amp;&amp;&nbsp;caca(sq))&nbsp;&nbsp;</span></span></li>
    <li class="alt"><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;&nbsp;</span></li>
    <li class=""><span>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp