﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>BlogJava-302班-随笔分类-C语言学习历程</title><link>http://www.blogjava.net/yank/category/23660.html</link><description>java突击队</description><language>zh-cn</language><lastBuildDate>Sat, 07 Jul 2007 08:18:35 GMT</lastBuildDate><pubDate>Sat, 07 Jul 2007 08:18:35 GMT</pubDate><ttl>60</ttl><item><title>计算一段文本的单词数</title><link>http://www.blogjava.net/yank/archive/2007/07/06/128717.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Fri, 06 Jul 2007 15:49:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/06/128717.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/128717.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/06/128717.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/128717.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/128717.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 为了使得程序更加灵活，我们将不限制用户输入的行数。因此，我们需要找到一种方式，用于通知程序用户已经完成输入。有一个简单的方法可以完成这个任务，那就是当用户输入最后一行文字以后，再额外加一个空行。当我们使用readLine()函数读取这个额外的空行时，程序将在用作缓冲区的数组的第一个位置上存储一个空字符。我们程序可以专门检查这种特殊的情况，并由此得知用户已经完成了输入。<br>&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/06/128717.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/128717.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-06 23:49 <a href="http://www.blogjava.net/yank/archive/2007/07/06/128717.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>数字符串转换为整数</title><link>http://www.blogjava.net/yank/archive/2007/07/06/128466.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Thu, 05 Jul 2007 16:47:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/06/128466.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/128466.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/06/128466.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/128466.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/128466.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 主要利用ASC||码比较大小。<br>c>='a'||c<='z'也是依据如此。&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/06/128466.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/128466.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-06 00:47 <a href="http://www.blogjava.net/yank/archive/2007/07/06/128466.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>计算单词的个数</title><link>http://www.blogjava.net/yank/archive/2007/07/05/128344.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Thu, 05 Jul 2007 07:04:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/05/128344.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/128344.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/05/128344.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/128344.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/128344.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 注意：<br>首先判断是不是一个字母，然后检查lookingForWord标志，如果该标志为0，我们就会给wordCount加1，然后置其为1(false）,这说明我们在单词内部进行扫描。&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/05/128344.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/128344.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-05 15:04 <a href="http://www.blogjava.net/yank/archive/2007/07/05/128344.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>读取一行数据【getchar函数的应用】</title><link>http://www.blogjava.net/yank/archive/2007/07/05/128333.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Thu, 05 Jul 2007 06:27:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/05/128333.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/128333.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/05/128333.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/128333.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/128333.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: getchar函数可以用于从终端读取一个字符，多次调用该函数，我们就可以逐个的读取用户在终端上的输入，如果读入到达了一行的末尾，该函数则返回换行符'\n'。该函数，我们不需要传递任何参数给它。如果使用scanf函数，在遇到空白的时候就会停止读取。&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/05/128333.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/128333.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-05 14:27 <a href="http://www.blogjava.net/yank/archive/2007/07/05/128333.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>输入字符串</title><link>http://www.blogjava.net/yank/archive/2007/07/04/128186.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Wed, 04 Jul 2007 13:01:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/04/128186.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/128186.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/04/128186.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/128186.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/128186.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 在C语言中，有若干个库函数可以帮助我们完成这项工作。如果我们使用scanf函数，并使用格式化输入符号%s，那么该函数将从终端上读取一个字符串。<br>注意：<br><1>遇到空格、制表符或者换行符中的任何一个为止。<br><2>当字符数组作为参数传递给scanf函数的时候，我们不需要在变量名前面加上“&”符号。<br>例子：<br>char string[81];<br>scanf("%s",string);&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/04/128186.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/128186.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-04 21:01 <a href="http://www.blogjava.net/yank/archive/2007/07/04/128186.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>检验字符串相等</title><link>http://www.blogjava.net/yank/archive/2007/07/04/128181.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Wed, 04 Jul 2007 12:31:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/04/128181.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/128181.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/04/128181.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/128181.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/128181.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 为了检验两个字符串是否相等，我们必须逐个比较这两个字符串的所有的所有字符，如果在比较的过程中，我们同时到达两个字符串的结尾（空字符），而且在此之前比较的所有字符都相同，那么这两个字符串才相等，否则不相等。&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/04/128181.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/128181.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-04 20:31 <a href="http://www.blogjava.net/yank/archive/2007/07/04/128181.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>连接字符串</title><link>http://www.blogjava.net/yank/archive/2007/07/04/128168.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Wed, 04 Jul 2007 10:42:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/04/128168.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/128168.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/04/128168.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/128168.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/128168.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 两个字符串的连接，充分利用'\0'空字符，注意下表的使用<br><1> 字符串数组的第一个字符下标是0；<br><2>如果字符串数组string不算结尾的空字符共包含n个字符时，那么表达式string[n-1]指的是字符串的最后一个非空字符，而表达式string[n]指的是结尾的空字符<br><3>在定义字符数组string 的时候，大小必须是n+1，以便存放结尾的空字符&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/04/128168.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/128168.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-04 18:42 <a href="http://www.blogjava.net/yank/archive/2007/07/04/128168.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>时间个更新问题{时间和日期同步更新}</title><link>http://www.blogjava.net/yank/archive/2007/07/03/127968.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Tue, 03 Jul 2007 15:23:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/03/127968.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127968.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/03/127968.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127968.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127968.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 编写一个名为clockKeeper的函数，该函数接受一个类型为struct dateAndTime类型的参数。该函数内部调用timeUpdate函数，如果日期到达了午夜，那么还应该调用 dateUpdate函数，最后，将更新过的日期作为一个dateAndTime结构返回给调用者。&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/03/127968.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/127968.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-03 23:23 <a href="http://www.blogjava.net/yank/archive/2007/07/03/127968.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>求两个时间的时间间隔{struct的应用}</title><link>http://www.blogjava.net/yank/archive/2007/07/03/127920.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Tue, 03 Jul 2007 09:51:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/03/127920.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127920.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/03/127920.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127920.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127920.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 这个算法是我自己设计的，主要利用了整除，求余运算<br>主要：<br> preTime.second=preSec%60;<br> temp=preSec/60;<br> preTime.minute=temp%60;<br> temp=temp/60;<br> preTime.hour=temp%24;<br> return preTime;&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/03/127920.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/127920.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-03 17:51 <a href="http://www.blogjava.net/yank/archive/2007/07/03/127920.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>结构数组</title><link>http://www.blogjava.net/yank/archive/2007/07/02/127694.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Mon, 02 Jul 2007 14:14:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/02/127694.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127694.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/02/127694.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127694.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127694.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 结构中也可以有结构<br>    struct dateAndTime<br>     {<br>         struct  date sdate;<br>         struct  time  stime;<br>      };<br>struct  dateAndTime={{2,1,2004},{3,30,0}}; 这就是2004年2月日，3：30：0<br><br><br>定义结构数组<br>struct  dateAndTime  events[100];<br>events[0].sdate.year=2004;<br>events[0].stime.hour=12;<br>events[0].stime.minutes=0;&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/02/127694.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/127694.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-02 22:14 <a href="http://www.blogjava.net/yank/archive/2007/07/02/127694.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>结构数组（Time）</title><link>http://www.blogjava.net/yank/archive/2007/07/02/127668.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Mon, 02 Jul 2007 12:09:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/02/127668.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127668.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/02/127668.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127668.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127668.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 结构的初始化类似于数组：  struct time this_time={3,26,26};<br><br>结构数组：struct time runTimes[3]={{12,0,12},{23,15,58},{21,42,26}};<br>还有：struct time runTime[5]={12,0,0,12,30,20,15,23,3}初始化前三个元素&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/02/127668.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/127668.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-02 20:09 <a href="http://www.blogjava.net/yank/archive/2007/07/02/127668.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>time的更新、设置</title><link>http://www.blogjava.net/yank/archive/2007/07/02/127664.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Mon, 02 Jul 2007 11:50:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/02/127664.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127664.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/02/127664.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127664.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127664.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:  time的变化情况：(hh:mm:ss)&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/02/127664.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/127664.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-02 19:50 <a href="http://www.blogjava.net/yank/archive/2007/07/02/127664.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>日期（today tomorrow）利用struct</title><link>http://www.blogjava.net/yank/archive/2007/07/02/127588.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Mon, 02 Jul 2007 08:19:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/02/127588.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127588.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/02/127588.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127588.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127588.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 注意判定瑞年的二月是29天&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/02/127588.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/127588.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-02 16:19 <a href="http://www.blogjava.net/yank/archive/2007/07/02/127588.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>stuct 结构体  date</title><link>http://www.blogjava.net/yank/archive/2007/07/02/127506.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Mon, 02 Jul 2007 04:38:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/02/127506.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127506.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/02/127506.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127506.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127506.html</trackback:ping><description><![CDATA[<p>#include &lt;stdio.h&gt;</p>
<p>int main(void)<br>{<br>&nbsp;&nbsp; struct date<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp; int month;<br>&nbsp; int day;<br>&nbsp; int year;<br>&nbsp;&nbsp; };</p>
<p>&nbsp;&nbsp; struct date today;<br>&nbsp;&nbsp; today.month=9;<br>&nbsp;&nbsp; today.day=25;<br>&nbsp;&nbsp; today.year=2004;</p>
<p>&nbsp;&nbsp; printf("Today's date is %i/%i/%.2i.\n",today.month,today.day,today.year%100);</p>
<p>&nbsp;&nbsp; return 0;<br>}<br>运行图：<br><img height=64 alt="" src="http://www.blogjava.net/images/blogjava_net/yank/stuct.jpg" width=271 border=0></p>
<img src ="http://www.blogjava.net/yank/aggbug/127506.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-02 12:38 <a href="http://www.blogjava.net/yank/archive/2007/07/02/127506.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>求数组中最小元素</title><link>http://www.blogjava.net/yank/archive/2007/07/02/127407.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Sun, 01 Jul 2007 16:29:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/02/127407.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127407.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/02/127407.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127407.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127407.html</trackback:ping><description><![CDATA[<p>#include &lt;stdio.h&gt;<br>&nbsp;int minimum(int values[],int numberOfElements)<br>&nbsp;{<br>&nbsp;&nbsp; int minValue,i;<br>&nbsp;&nbsp; minValue=values[0];</p>
<p>&nbsp;&nbsp; for(i=1;i&lt;numberOfElements;i++)<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; if(values[i]&lt;minValue)<br>&nbsp;&nbsp;minValue=values[i];<br>&nbsp;&nbsp; }<br>&nbsp;&nbsp; return minValue;<br>&nbsp;}<br>&nbsp;int main(void)<br>&nbsp;{<br>&nbsp; int a[5]={1,2,5,8,9};&nbsp; <br>&nbsp; <br>&nbsp; printf("Array minimus: %i\n",minimum(a,5));<br>&nbsp; return 0;<br>&nbsp;}<br>运行结果：<br><img height=87 alt="" src="http://www.blogjava.net/images/blogjava_net/yank/minto.JPG" width=278 border=0></p>
<p><br>&nbsp;</p>
<img src ="http://www.blogjava.net/yank/aggbug/127407.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-02 00:29 <a href="http://www.blogjava.net/yank/archive/2007/07/02/127407.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>C语言中的变量长度数组</title><link>http://www.blogjava.net/yank/archive/2007/07/01/127337.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Sun, 01 Jul 2007 02:40:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/01/127337.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127337.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/01/127337.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127337.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127337.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 这与编译器有关系，VC 就不支持变量长度数组，而GCC就支持&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/01/127337.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/127337.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-01 10:40 <a href="http://www.blogjava.net/yank/archive/2007/07/01/127337.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>求几个数的和（数组）</title><link>http://www.blogjava.net/yank/archive/2007/07/01/127322.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Sun, 01 Jul 2007 02:14:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/01/127322.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127322.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/01/127322.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127322.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127322.html</trackback:ping><description><![CDATA[<p>#include &lt;stdio.h&gt;</p>
<p>int main(void)<br>{<br>&nbsp;int array[5],i;<br>&nbsp;printf("Please enter 5 int numbers!\n");<br>&nbsp;for(i=0;i&lt;5;i++)<br>&nbsp;{<br>&nbsp;&nbsp;&nbsp; scanf("%i",&amp;array[i]);<br>&nbsp;}<br>&nbsp;int arraySum(int array[],int n);<br>&nbsp;int result=arraySum(array,5);<br>&nbsp;for(i=0;i&lt;5;i++)<br>&nbsp;{<br>&nbsp;&nbsp; printf("%i\n",array[i]);<br>&nbsp;}<br>&nbsp;&nbsp;&nbsp; printf("%i\n",result);<br>&nbsp;return 0;<br>}</p>
<p>int arraySum(int array[],int n)<br>{<br>&nbsp;&nbsp; int i,result=0;<br>&nbsp;&nbsp; for(i=0;i&lt;n;i++)<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp; result+=array[i];<br>&nbsp;&nbsp; }<br>&nbsp;&nbsp; return result;<br>}<br>测试结果：<br><img height=180 alt="" src="http://www.blogjava.net/images/blogjava_net/yank/ti-11.jpg" width=331 border=0></p>
<img src ="http://www.blogjava.net/yank/aggbug/127322.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-01 10:14 <a href="http://www.blogjava.net/yank/archive/2007/07/01/127322.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>求两个数的最大公倍数</title><link>http://www.blogjava.net/yank/archive/2007/07/01/127302.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Sat, 30 Jun 2007 17:03:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/01/127302.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127302.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/01/127302.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127302.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127302.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 输入两个数，a,b,有函数知道他们的最大公约数，然后利用公式：result=a*b/最大公约数。&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/07/01/127302.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/127302.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-01 01:03 <a href="http://www.blogjava.net/yank/archive/2007/07/01/127302.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>求一个数的n次方</title><link>http://www.blogjava.net/yank/archive/2007/07/01/127297.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Sat, 30 Jun 2007 16:10:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/07/01/127297.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127297.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/07/01/127297.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127297.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127297.html</trackback:ping><description><![CDATA[<p>#include &lt;stdio.h&gt;</p>
<p>long int x_to_the_n(int i,int n)<br>{<br>&nbsp;&nbsp; long int result=1;<br>&nbsp;&nbsp; for(int j=1;j&lt;=n;j++)<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp; result*=i;<br>&nbsp;&nbsp; }<br>&nbsp;&nbsp; return result;<br>}<br>int main(void)<br>{<br>&nbsp;int num1,num2;<br>&nbsp; printf("Enter two numbers !\n");<br>&nbsp; scanf("%i",&amp;num1);<br>&nbsp; scanf("%i",&amp;num2);<br>&nbsp; long&nbsp; int result=x_to_the_n(num1,num2);<br>&nbsp; printf("%i的%i次方 is %li.\n",num1,num2,result);<br>&nbsp; return 0;<br>}<br>运行图：<br><img height=119 alt="" src="http://www.blogjava.net/images/blogjava_net/yank/cifang.jpg" width=407 border=0></p>
<p>&nbsp;</p>
<img src ="http://www.blogjava.net/yank/aggbug/127297.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-07-01 00:10 <a href="http://www.blogjava.net/yank/archive/2007/07/01/127297.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>递归函数</title><link>http://www.blogjava.net/yank/archive/2007/06/30/127289.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Sat, 30 Jun 2007 15:13:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/06/30/127289.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127289.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/06/30/127289.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127289.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127289.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 函数自身调用。将同样的步骤应用与越来越小的问题子集，最终得到答案。&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/06/30/127289.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/127289.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-06-30 23:13 <a href="http://www.blogjava.net/yank/archive/2007/06/30/127289.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>静态变量的使用</title><link>http://www.blogjava.net/yank/archive/2007/06/30/127287.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Sat, 30 Jun 2007 15:03:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/06/30/127287.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127287.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/06/30/127287.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127287.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127287.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 在上次电泳函数的时候如果我们给静态变量赋了某个值的话，下次调用的时候，这个值将被保留。&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/06/30/127287.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/127287.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-06-30 23:03 <a href="http://www.blogjava.net/yank/archive/2007/06/30/127287.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>求两个数的最大公约数（函数）</title><link>http://www.blogjava.net/yank/archive/2007/06/30/127275.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Sat, 30 Jun 2007 13:30:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/06/30/127275.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127275.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/06/30/127275.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127275.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127275.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:   int temp;  <br>  while(v!=0)<br>  {<br>   temp=u%v;<br>   u=v;<br>   v=temp;<br>  }<br> return u;&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/06/30/127275.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/127275.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-06-30 21:30 <a href="http://www.blogjava.net/yank/archive/2007/06/30/127275.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>求你一个数的平方根</title><link>http://www.blogjava.net/yank/archive/2007/06/30/127274.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Sat, 30 Jun 2007 13:27:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/06/30/127274.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/127274.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/06/30/127274.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/127274.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/127274.html</trackback:ping><description><![CDATA[#include &lt;stdio.h&gt;<br>&nbsp;float absoluteValue(float x)<br>&nbsp;{<br>&nbsp;&nbsp; if(x&lt;0)<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; x=-x;<br>&nbsp;&nbsp; }<br>&nbsp;&nbsp; return x;<br>&nbsp;}<br>&nbsp;float squareRoot(float x)<br>&nbsp;{<br>&nbsp;&nbsp; const float epsilon= 0.0001;<br>&nbsp;&nbsp; float guess=1.0;<br>&nbsp;&nbsp; if(x&lt;0)<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; printf("Negative argument to squareRoot.\n");<br>&nbsp;&nbsp;&nbsp; return -1.0;<br>&nbsp;&nbsp; }&nbsp; <br>&nbsp;&nbsp; while (absoluteValue((guess*guess)-x)&gt;=epsilon)<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; guess=(x/guess+guess)/2.0;<br>&nbsp;&nbsp; }<br>&nbsp;&nbsp; return guess;<br>&nbsp; <br>&nbsp;}<br>int main(void)<br>{<br>&nbsp; float&nbsp; number;&nbsp; <br>&nbsp; printf("Enter an float number!\n");<br>&nbsp; scanf("%f",&amp;number);<br>&nbsp; <br>&nbsp; printf("The squareRoot of number %f is %f.\n",number,squareRoot(number));<br>&nbsp; return 0;<br>}
<img src ="http://www.blogjava.net/yank/aggbug/127274.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-06-30 21:27 <a href="http://www.blogjava.net/yank/archive/2007/06/30/127274.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>条件语句的使用</title><link>http://www.blogjava.net/yank/archive/2007/06/28/126943.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Thu, 28 Jun 2007 15:41:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/06/28/126943.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/126943.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/06/28/126943.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/126943.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/126943.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 公式：<br>(condition)条件表达式？（expression）1:表达式（expression）2<br>相当于：<br>if(){}else{}&nbsp;&nbsp;<a href='http://www.blogjava.net/yank/archive/2007/06/28/126943.html'>阅读全文</a><img src ="http://www.blogjava.net/yank/aggbug/126943.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-06-28 23:41 <a href="http://www.blogjava.net/yank/archive/2007/06/28/126943.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>求质数</title><link>http://www.blogjava.net/yank/archive/2007/06/28/126935.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Thu, 28 Jun 2007 14:41:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/06/28/126935.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/126935.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/06/28/126935.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/126935.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/126935.html</trackback:ping><description><![CDATA[<p>#include &lt;stdio.h&gt;<br>int main(void)<br>{<br>&nbsp; int p,d,number;<br>&nbsp; bool isPrime;<br>&nbsp; printf("Enter a Int number:\n");<br>&nbsp; scanf("%i",&amp;number);</p>
<p>&nbsp; for(p=2;p&lt;=number;++p)<br>&nbsp; {<br>&nbsp;&nbsp; isPrime=1;<br>&nbsp;&nbsp;&nbsp;&nbsp; for(d=2;d&lt;p;++d)<br>&nbsp; {<br>&nbsp;&nbsp; if(p%d==0)<br>&nbsp;&nbsp;&nbsp; isPrime=0;<br>&nbsp; }<br>&nbsp;&nbsp; if(isPrime!=0)<br>&nbsp;&nbsp;&nbsp; printf("%i ",p);<br>&nbsp;<br>&nbsp; }<br>&nbsp;&nbsp; printf("\n");<br>&nbsp;<br>&nbsp; return 0;<br>}</p>
<img src ="http://www.blogjava.net/yank/aggbug/126935.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-06-28 22:41 <a href="http://www.blogjava.net/yank/archive/2007/06/28/126935.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>判定输入字符的类型</title><link>http://www.blogjava.net/yank/archive/2007/06/28/126932.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Thu, 28 Jun 2007 14:12:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/06/28/126932.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/126932.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/06/28/126932.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/126932.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/126932.html</trackback:ping><description><![CDATA[<p>#include &lt;stdio.h&gt;<br>int main(void)<br>{<br>&nbsp; char c;<br>&nbsp; printf("Enter a single character:\n");<br>&nbsp; scanf("%c",&amp;c);</p>
<p>&nbsp; if((c&gt;='a'&amp;&amp;c&lt;'z')||(c&gt;='A'&amp;&amp;c&lt;='Z'))<br>&nbsp; {<br>&nbsp;&nbsp; printf("It's an alphabetic character .\n");<br>&nbsp; }<br>&nbsp; else if(c&gt;'0'&amp;&amp;c&lt;'9')<br>&nbsp;&nbsp; printf("It's digit.\n");<br>&nbsp; else<br>&nbsp;&nbsp; printf("It's a special character.\n");<br>&nbsp;return 0;</p>
<p>}</p>
<img src ="http://www.blogjava.net/yank/aggbug/126932.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-06-28 22:12 <a href="http://www.blogjava.net/yank/archive/2007/06/28/126932.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>判断闰年问题</title><link>http://www.blogjava.net/yank/archive/2007/06/28/126931.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Thu, 28 Jun 2007 13:58:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/06/28/126931.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/126931.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/06/28/126931.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/126931.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/126931.html</trackback:ping><description><![CDATA[<p>#include &lt;stdio.h&gt;<br>int main(void)<br>{<br>&nbsp; int year;<br>&nbsp;<br>&nbsp; printf(" Enter a year like this \"1986\"&nbsp; :&nbsp; ");<br>&nbsp; scanf("%i",&amp;year);</p>
<p>&nbsp;if(year%4==0&amp;&amp;year%100!=0||year%400==0)<br>&nbsp;{<br>&nbsp;&nbsp; printf("This year %i is a leap year!\n",year);<br>&nbsp;}<br>&nbsp;else<br>&nbsp;{<br>&nbsp; printf("This year %i is not a leap year!\n",year);<br>&nbsp;}<br>&nbsp; return 0;<br>}</p>
<img src ="http://www.blogjava.net/yank/aggbug/126931.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-06-28 21:58 <a href="http://www.blogjava.net/yank/archive/2007/06/28/126931.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>求几门课程的平均成绩以及挂科的门数</title><link>http://www.blogjava.net/yank/archive/2007/06/28/126929.html</link><dc:creator>停留的风</dc:creator><author>停留的风</author><pubDate>Thu, 28 Jun 2007 13:44:00 GMT</pubDate><guid>http://www.blogjava.net/yank/archive/2007/06/28/126929.html</guid><wfw:comment>http://www.blogjava.net/yank/comments/126929.html</wfw:comment><comments>http://www.blogjava.net/yank/archive/2007/06/28/126929.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/yank/comments/commentRss/126929.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/yank/services/trackbacks/126929.html</trackback:ping><description><![CDATA[<p>求几门课程的平均成绩以及挂科的门数<br>#include &lt;stdio.h&gt;<br>int main(void)<br>{<br>&nbsp; int number,i,grade;<br>&nbsp; int gradeTotal=0;<br>&nbsp; int failureCount=0;<br>&nbsp; float average;</p>
<p>&nbsp; printf("How many grades will you be entering?");<br>&nbsp; scanf("%i",&amp;number);</p>
<p>&nbsp; for(i=1;i&lt;=number;i++)<br>&nbsp; {<br>&nbsp;&nbsp; printf("Enter grade #%i: ",i);<br>&nbsp;&nbsp; scanf("%i",&amp;grade);</p>
<p>&nbsp;&nbsp; gradeTotal=gradeTotal+grade;<br>&nbsp;&nbsp; if(grade&lt;65)<br>&nbsp;&nbsp;&nbsp; ++failureCount;<br>&nbsp; }</p>
<p>&nbsp; average=(float)gradeTotal/number;<br>&nbsp; printf("\nGrade average = %.2f\n",average);//这是个格式化字符串，保留两位有效数字<br>&nbsp; printf("Number of failures =%i\n",failureCount);</p>
<p>&nbsp; return 0;<br>}</p>
<img src ="http://www.blogjava.net/yank/aggbug/126929.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/yank/" target="_blank">停留的风</a> 2007-06-28 21:44 <a href="http://www.blogjava.net/yank/archive/2007/06/28/126929.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>