<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>大樂透程式開發過程 by 20516吳侑恆</title>
      <link>https://padlet.com/s11030023/xo75pfss5j0i8pes</link>
      <description></description>
      <language>en-us</language>
      <pubDate>2023-03-30 01:27:10 UTC</pubDate>
      <lastBuildDate>2023-04-27 01:27:42 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url>https://padlet-uploads.storage.googleapis.com/1907989286/fb8a4d10ccc2243c422efa468d9e3c38/76efe6e6d336aece640a962820f938e9.PNG</url>
      </image>
      <item>
         <title>取亂數</title>
         <author>s11030023</author>
         <link>https://padlet.com/s11030023/xo75pfss5j0i8pes/wish/2537566836</link>
         <description><![CDATA[<div>#include &lt;iostream&gt;<br>#include &lt;cstdlib&gt;<br>#include &lt;ctime&gt;<br>using namespace std;<br><br>int main()<br>{<br>&nbsp; &nbsp; <mark>const int NUM_EVEN_NUMBERS = 6; // 要生成的偶數數量<br>&nbsp; &nbsp; int evenNumbers[NUM_EVEN_NUMBERS]; <br>&nbsp; &nbsp; // 建立一個陣列來存放偶數<br><br>&nbsp; &nbsp; srand(time(nullptr)); // 設置亂數種子<br><br>&nbsp; &nbsp; int count = 0; // 計數器<br><br>&nbsp; &nbsp; // 生成六個偶數<br>&nbsp; &nbsp; while (count &lt; NUM_EVEN_NUMBERS)<br>&nbsp; &nbsp; {<br>&nbsp; &nbsp; &nbsp; &nbsp; int num = rand() % 100 + 1; <br>&nbsp; &nbsp; // 生成 1 到 100 之間的隨機數<br></mark><br>&nbsp;<mark>&nbsp; &nbsp; &nbsp; &nbsp;if (num % 2 == 0)<br>&nbsp; &nbsp; &nbsp; &nbsp; {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; evenNumbers[count] = num;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; count++;<br>&nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; }<br></mark><br>&nbsp; &nbsp; // 列印出六個偶數<br>&nbsp; &nbsp; for (int i = 0; i &lt; NUM_EVEN_NUMBERS; i++)<br>&nbsp; &nbsp; {<br>&nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; evenNumbers[i] &lt;&lt; " ";<br>&nbsp; &nbsp; }<br><br>&nbsp; &nbsp; return 0;<br>}</div>]]></description>
         <enclosure url="https://onlinegdb.com/dTWt-q_JZE" />
         <pubDate>2023-03-30 01:33:01 UTC</pubDate>
         <guid>https://padlet.com/s11030023/xo75pfss5j0i8pes/wish/2537566836</guid>
      </item>
      <item>
         <title>排序</title>
         <author>s11030023</author>
         <link>https://padlet.com/s11030023/xo75pfss5j0i8pes/wish/2537571536</link>
         <description><![CDATA[<div>#include &lt;iostream&gt;<br>#include &lt;cstdlib&gt;<br>#include &lt;ctime&gt;<br>using namespace std;<br><br>int main()<br>{<br>&nbsp; &nbsp; const int NUM_EVEN_NUMBERS = 6; // 要生成的偶數數量<br>&nbsp; &nbsp; int evenNumbers[NUM_EVEN_NUMBERS]; <br>&nbsp; &nbsp; // 建立一個陣列來存放偶數<br><br>&nbsp; &nbsp; srand(time(nullptr)); // 設置亂數種子<br><br>&nbsp; &nbsp; int count = 0; // 計數器<br><br>&nbsp; &nbsp; // 生成六個偶數<br>&nbsp; &nbsp; while (count &lt; NUM_EVEN_NUMBERS)<br>&nbsp; &nbsp; {<br>&nbsp; &nbsp; &nbsp; &nbsp; int num = rand() % 100 + 1; <br>&nbsp; &nbsp; // 生成 1 到 100 之間的隨機數<br><br>&nbsp; &nbsp; &nbsp; &nbsp; if (num % 2 == 0)<br>&nbsp; &nbsp; &nbsp; &nbsp; {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; evenNumbers[count] = num;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; count++;<br>&nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; }<br>&nbsp; &nbsp;<mark>&nbsp;//將數字由小到大重新排列並列出第n次的更改過程<br>&nbsp; &nbsp; for (int i=5; i&gt;0; i--) {<br>&nbsp; &nbsp; &nbsp; &nbsp; for (int j=0; j&lt;i; j++) {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (evenNumbers[j] &gt; evenNumbers[j+1]) {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int tmp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; tmp = evenNumbers[j];<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; evenNumbers[j] = evenNumbers[j+1];<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; evenNumbers[j+1] =tmp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }</mark><br>&nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; }<br>&nbsp; &nbsp;&nbsp;<br>&nbsp; &nbsp; //最終排序結果<br>&nbsp; &nbsp; cout &lt;&lt; "排序後結果為:";<br>&nbsp; &nbsp; for (int i=0; i&lt;6; i++)<br>&nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; " " &lt;&lt; evenNumbers[i];<br>&nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; endl;<br>&nbsp; &nbsp; return 0;<br>}&nbsp;</div>]]></description>
         <enclosure url="https://onlinegdb.com/qLeMtPyv6r" />
         <pubDate>2023-03-30 01:36:21 UTC</pubDate>
         <guid>https://padlet.com/s11030023/xo75pfss5j0i8pes/wish/2537571536</guid>
      </item>
      <item>
         <title>號碼不重複</title>
         <author>s11030023</author>
         <link>https://padlet.com/s11030023/xo75pfss5j0i8pes/wish/2537576125</link>
         <description><![CDATA[<div>#include &lt;iostream&gt;<br>#include &lt;cstdlib&gt;<br>#include &lt;ctime&gt;<br>using namespace std;<br><br>int main()<br>{&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;<br>&nbsp; &nbsp; srand(time(NULL)); //給定亂樹種子<br>&nbsp; &nbsp; int n[6];<br>&nbsp; &nbsp;<br>&nbsp; &nbsp; for(int i =0;i&lt;6;i++)<br>&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br>&nbsp; &nbsp; &nbsp; &nbsp; n[i] = rand()% 49 +1;&nbsp; // rand()%(最大值-最小值+1)+ 最小值 值放進陣列<br>&nbsp; &nbsp; &nbsp; &nbsp; <br>&nbsp; &nbsp; &nbsp; &nbsp; <mark>for(int j=0;j&lt;i;j++)&nbsp; //跑我之前已經產生的結果<br>&nbsp; &nbsp; &nbsp; &nbsp; {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;if(n[i]==n[j])&nbsp; //比較值是否已經存在<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;{<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;i--;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;break;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;}</mark><br>&nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; }<br>&nbsp; &nbsp;&nbsp;<br>&nbsp; &nbsp; //將數字由小到大重新排列並列出第n次的更改過程<br>&nbsp; &nbsp; for (int i=5; i&gt;0; i--) {<br>&nbsp; &nbsp; &nbsp; &nbsp; for (int j=0; j&lt;i; j++) {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (n[j] &gt; n[j+1]) {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int tmp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; tmp = n[j];<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n[j] = n[j+1];<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n[j+1] =tmp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; }<br><br>&nbsp; &nbsp; //最終排序結果<br>&nbsp; &nbsp; cout &lt;&lt; "排序後結果為:";<br>&nbsp; &nbsp; for (int i=0; i&lt;6; i++)<br>&nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; " " &lt;&lt; n[i];<br>&nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; endl;<br>&nbsp; &nbsp; return 0;<br>}&nbsp;</div>]]></description>
         <enclosure url="https://onlinegdb.com/seVGbVCrp" />
         <pubDate>2023-03-30 01:39:45 UTC</pubDate>
         <guid>https://padlet.com/s11030023/xo75pfss5j0i8pes/wish/2537576125</guid>
      </item>
      <item>
         <title>N 期中獎號碼  </title>
         <author>s11030023</author>
         <link>https://padlet.com/s11030023/xo75pfss5j0i8pes/wish/2537584744</link>
         <description><![CDATA[<div>#include &lt;iostream&gt;<br>#include &lt;cstdlib&gt;<br>#include &lt;ctime&gt;<br>using namespace std;<br><br>int main()<br>{&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;<br>&nbsp; &nbsp; srand(time(NULL)); //給定亂樹種子<br>&nbsp; &nbsp; int n[6];<br>&nbsp; &nbsp; cout&lt;&lt;"需要抽出幾期?";<br>&nbsp; &nbsp; <mark>int A; cin&gt;&gt;A;</mark><br>&nbsp; &nbsp; <mark>for(int p=1;p&lt;=A;p++){</mark><br>&nbsp; &nbsp; &nbsp; &nbsp; for(int i=0;i&lt;6;i++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n[i] = rand()% 49 +1;&nbsp; // rand()%(最大值-最小值+1)+ 最小值 值放進陣列<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(int j=0;j&lt;i;j++){&nbsp; //跑我之前已經產生的結果<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;if(n[i]==n[j]){&nbsp; //比較值是否已經存在<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;i--;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; for (int i=5; i&gt;0; i--) {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int j=0; j&lt;i; j++) {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (n[j] &gt; n[j+1]) {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int tmp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; tmp = n[j];<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n[j] = n[j+1];<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n[j+1] =tmp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; <mark>cout&lt;&lt;"第" &lt;&lt;p&lt;&lt;"期:[ ";<br>&nbsp; &nbsp; &nbsp; &nbsp; for(int i=0;i&lt;6;i++){<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout&lt;&lt; n[i] &lt;&lt;" ";<br>&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; cout&lt;&lt;"]";<br>&nbsp; &nbsp; &nbsp; &nbsp; cout&lt;&lt;endl;<br>&nbsp; &nbsp; }</mark><br>}&nbsp;</div>]]></description>
         <enclosure url="https://onlinegdb.com/eTwxnqfc7" />
         <pubDate>2023-03-30 01:47:11 UTC</pubDate>
         <guid>https://padlet.com/s11030023/xo75pfss5j0i8pes/wish/2537584744</guid>
      </item>
      <item>
         <title>加上特別號 / 查詢期別 </title>
         <author>s11030023</author>
         <link>https://padlet.com/s11030023/xo75pfss5j0i8pes/wish/2569561907</link>
         <description><![CDATA[<div>#include &lt;iostream&gt;<br>using namespace std;<br><br>int main()<br>{&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;<br>&nbsp; &nbsp; srand(time(NULL)); //給定亂數種子<br>&nbsp; &nbsp; int n[10][7];<br>&nbsp; &nbsp; int A=10;<br>&nbsp; &nbsp; for(int p=1;p&lt;=A;p++){<br>&nbsp; &nbsp; &nbsp; &nbsp; for(int i=0;i&lt;7;i++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n[p][i] = rand()% 49 +1;&nbsp; // rand()%(最大值-最小值+1)+ 最小值 值放進陣列<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(int j=0;j&lt;i;j++){&nbsp; //跑我之前已經產生的結果<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;if(n[p][i]==n[p][j]){&nbsp; //比較值是否已經存在<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;i--;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; for (int i=5; i&gt;0; i--) {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int j=0; j&lt;i; j++) {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (n[p][j] &gt; n[p][j+1]) {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int tmp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; tmp = n[p][j];<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n[p][j] = n[p][j+1];<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n[p][j+1] =tmp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; cout&lt;&lt;"第" &lt;&lt;p&lt;&lt;"期:";<br>&nbsp; &nbsp; &nbsp; &nbsp; for(int i=0;i&lt;6;i++){<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout&lt;&lt; n[p][i] &lt;&lt;" ";<br>&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; "&nbsp; 特別號: " &lt;&lt; n[p][6] &lt;&lt; endl;<br>&nbsp; &nbsp; }<br>}</div>]]></description>
         <enclosure url="https://onlinegdb.com/VHmglnDKMr" />
         <pubDate>2023-04-27 01:17:11 UTC</pubDate>
         <guid>https://padlet.com/s11030023/xo75pfss5j0i8pes/wish/2569561907</guid>
      </item>
      <item>
         <title>單一期別/號碼的對獎</title>
         <author>s11030023</author>
         <link>https://padlet.com/s11030023/xo75pfss5j0i8pes/wish/2569565658</link>
         <description><![CDATA[<div>#include &lt;iostream&gt;<br>using namespace std;<br><br>int main()<br>{&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;<br>&nbsp; &nbsp; srand(time(NULL)); //給定亂數種子<br>&nbsp; &nbsp; int n[10][7];<br>&nbsp; &nbsp; int A=10;<br>&nbsp; &nbsp; for(int p=1;p&lt;=A;p++){<br>&nbsp; &nbsp; &nbsp; &nbsp; for(int i=0;i&lt;7;i++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n[p][i] = rand()% 49 +1;&nbsp; // rand()%(最大值-最小值+1)+ 最小值 值放進陣列<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(int j=0;j&lt;i;j++){&nbsp; //跑我之前已經產生的結果<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;if(n[p][i]==n[p][j]){&nbsp; //比較值是否已經存在<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;i--;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; for (int i=5; i&gt;0; i--) {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int j=0; j&lt;i; j++) {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (n[p][j] &gt; n[p][j+1]) {<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int tmp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; tmp = n[p][j];<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n[p][j] = n[p][j+1];<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n[p][j+1] =tmp;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; cout&lt;&lt;"第" &lt;&lt;p&lt;&lt;"期:";<br>&nbsp; &nbsp; &nbsp; &nbsp; for(int i=0;i&lt;6;i++){<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout&lt;&lt; n[p][i] &lt;&lt;" ";<br>&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp;<br>&nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; "&nbsp; 特別號: " &lt;&lt; n[p][6] &lt;&lt; endl;<br>&nbsp; &nbsp; }<br>&nbsp; &nbsp; <mark>int a,b;<br>&nbsp; &nbsp; bool c=false;<br>&nbsp; &nbsp; string YN ="Y";<br>&nbsp; &nbsp; cout &lt;&lt; "已抽十期，要查詢第幾期?" &lt;&lt; endl;<br>&nbsp; &nbsp; cin &gt;&gt; a;<br>&nbsp; &nbsp; cout &lt;&lt; "要查詢哪個號碼?" &lt;&lt; endl;<br>&nbsp; &nbsp; cin &gt;&gt; b;<br>&nbsp; &nbsp; while(YN=="Y"){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br>&nbsp; &nbsp; &nbsp; &nbsp; for(int i=0; i&lt;7; i++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(b == n[a][i]) c = true;&nbsp; &nbsp; //如果要查詢的數與該期別的數有一樣的，b就變成true(有中獎)<br>&nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; if(c==true){<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; "中獎了!!是否要繼續查詢（Ｙ(繼續)/Ｎ(結束)）?" &lt;&lt; endl;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; c = false;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cin &gt;&gt; YN;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(YN=="Y"){<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; "要查詢第幾期?" &lt;&lt; endl;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cin &gt;&gt; a;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; "要查詢哪個號碼?" &lt;&lt; endl;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cin &gt;&gt; b;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }else if(YN=="y"){<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; "要查詢第幾期?" &lt;&lt; endl;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cin &gt;&gt; a;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; "要查詢哪個號碼?" &lt;&lt; endl;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cin &gt;&gt; b;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }else{<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; YN = "N";<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; }else{<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; "可惜沒中，是否要繼續查詢（Ｙ(繼續)/Ｎ(結束)）?" &lt;&lt; endl;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cin &gt;&gt; YN;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(YN=="Y"){<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; "要查詢第幾期?" &lt;&lt; endl;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cin &gt;&gt; a;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; "要查詢哪個號碼?" &lt;&lt; endl;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cin &gt;&gt; b;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }else if(YN=="y"){<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; "要查詢第幾期?" &lt;&lt; endl;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cin &gt;&gt; a;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout &lt;&lt; "要查詢哪個號碼?" &lt;&lt; endl;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cin &gt;&gt; b;<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }else{<br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; YN = "N";</mark><br>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; &nbsp; &nbsp; }<br>&nbsp; &nbsp; }<br>}<br><br></div>]]></description>
         <enclosure url="https://onlinegdb.com/35syajYkm" />
         <pubDate>2023-04-27 01:19:42 UTC</pubDate>
         <guid>https://padlet.com/s11030023/xo75pfss5j0i8pes/wish/2569565658</guid>
      </item>
   </channel>
</rss>
