snipt

Ctrl+h for KB shortcuts
Notice: Snipt is moving away from free accounts on May 1st, 2014. Read more about the transition here.
#9344

C++

HuiHui(Array-seat)

#include <iostream>
#include <string>

using namespace std;

int main()
{
    int x = 10;
    int y = 10;
    int seat[x][y];
    string exit;

    for (int x=0; x<10; x++)
    {
        for (int y=0; y<10; y++)
        {
            seat[x][y] = 0;
        }
    }

    while (exit != "n")
    {
        cout << "Enter 1st digit of seat num.: " ;
        cin >> x;
        cout << "Enter 2nd digit of seat num.: " ;
        cin >> y;

        cout << endl << "Seat num " << x << y << ": " << seat[x][y] << endl;

        if (seat[x][y] == 1)
                cout << "Seat is occupied, please find another seat." << endl;

        while (seat[x][y] != 1)
        {
                seat[x][y] = 1;
                cout << "You have taken the seat." << endl;
        }

        cout << endl << endl;

        for (int x=0; x<10; x++)
        {
            for (int y=0; y<10; y++)
            {
                if (seat[x][y] == 0)
                    cout << "*" ;
                else if (seat[x][y] == 1)
                    cout << "0";
            }
            cout << endl;
        }

        cout << endl;
        cout << "Do you want to book another seat? ";
        cin >> exit;
        cout << endl;
    }

    return 0;
}
https://snipt.net/embed/9711b7efc5a89bb4f38020b1cb3b1ddc/
https://snipt.net/raw/9711b7efc5a89bb4f38020b1cb3b1ddc/
9711b7efc5a89bb4f38020b1cb3b1ddc
cpp
C++
61
2014-04-25T04:50:13
True
False
/api/public/snipt/9344/
huihuiarray-seat
<table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><a href="#L-1"> 1</a> <a href="#L-2"> 2</a> <a href="#L-3"> 3</a> <a href="#L-4"> 4</a> <a href="#L-5"> 5</a> <a href="#L-6"> 6</a> <a href="#L-7"> 7</a> <a href="#L-8"> 8</a> <a href="#L-9"> 9</a> <a href="#L-10">10</a> <a href="#L-11">11</a> <a href="#L-12">12</a> <a href="#L-13">13</a> <a href="#L-14">14</a> <a href="#L-15">15</a> <a href="#L-16">16</a> <a href="#L-17">17</a> <a href="#L-18">18</a> <a href="#L-19">19</a> <a href="#L-20">20</a> <a href="#L-21">21</a> <a href="#L-22">22</a> <a href="#L-23">23</a> <a href="#L-24">24</a> <a href="#L-25">25</a> <a href="#L-26">26</a> <a href="#L-27">27</a> <a href="#L-28">28</a> <a href="#L-29">29</a> <a href="#L-30">30</a> <a href="#L-31">31</a> <a href="#L-32">32</a> <a href="#L-33">33</a> <a href="#L-34">34</a> <a href="#L-35">35</a> <a href="#L-36">36</a> <a href="#L-37">37</a> <a href="#L-38">38</a> <a href="#L-39">39</a> <a href="#L-40">40</a> <a href="#L-41">41</a> <a href="#L-42">42</a> <a href="#L-43">43</a> <a href="#L-44">44</a> <a href="#L-45">45</a> <a href="#L-46">46</a> <a href="#L-47">47</a> <a href="#L-48">48</a> <a href="#L-49">49</a> <a href="#L-50">50</a> <a href="#L-51">51</a> <a href="#L-52">52</a> <a href="#L-53">53</a> <a href="#L-54">54</a> <a href="#L-55">55</a> <a href="#L-56">56</a> <a href="#L-57">57</a> <a href="#L-58">58</a> <a href="#L-59">59</a> <a href="#L-60">60</a></pre></div></td><td class="code"><div class="highlight"><pre><span id="L-1"><a name="L-1"></a><span class="cp">#include &lt;iostream&gt;</span> </span><span id="L-2"><a name="L-2"></a><span class="cp">#include &lt;string&gt;</span> </span><span id="L-3"><a name="L-3"></a> </span><span id="L-4"><a name="L-4"></a><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span> </span><span id="L-5"><a name="L-5"></a> </span><span id="L-6"><a name="L-6"></a><span class="kt">int</span> <span class="nf">main</span><span class="p">()</span> </span><span id="L-7"><a name="L-7"></a><span class="p">{</span> </span><span id="L-8"><a name="L-8"></a> <span class="kt">int</span> <span class="n">x</span> <span class="o">=</span> <span class="mi">10</span><span class="p">;</span> </span><span id="L-9"><a name="L-9"></a> <span class="kt">int</span> <span class="n">y</span> <span class="o">=</span> <span class="mi">10</span><span class="p">;</span> </span><span id="L-10"><a name="L-10"></a> <span class="kt">int</span> <span class="n">seat</span><span class="p">[</span><span class="n">x</span><span class="p">][</span><span class="n">y</span><span class="p">];</span> </span><span id="L-11"><a name="L-11"></a> <span class="n">string</span> <span class="n">exit</span><span class="p">;</span> </span><span id="L-12"><a name="L-12"></a> </span><span id="L-13"><a name="L-13"></a> <span class="k">for</span> <span class="p">(</span><span class="kt">int</span> <span class="n">x</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span> <span class="n">x</span><span class="o">&lt;</span><span class="mi">10</span><span class="p">;</span> <span class="n">x</span><span class="o">++</span><span class="p">)</span> </span><span id="L-14"><a name="L-14"></a> <span class="p">{</span> </span><span id="L-15"><a name="L-15"></a> <span class="k">for</span> <span class="p">(</span><span class="kt">int</span> <span class="n">y</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span> <span class="n">y</span><span class="o">&lt;</span><span class="mi">10</span><span class="p">;</span> <span class="n">y</span><span class="o">++</span><span class="p">)</span> </span><span id="L-16"><a name="L-16"></a> <span class="p">{</span> </span><span id="L-17"><a name="L-17"></a> <span class="n">seat</span><span class="p">[</span><span class="n">x</span><span class="p">][</span><span class="n">y</span><span class="p">]</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-18"><a name="L-18"></a> <span class="p">}</span> </span><span id="L-19"><a name="L-19"></a> <span class="p">}</span> </span><span id="L-20"><a name="L-20"></a> </span><span id="L-21"><a name="L-21"></a> <span class="k">while</span> <span class="p">(</span><span class="n">exit</span> <span class="o">!=</span> <span class="s">&quot;n&quot;</span><span class="p">)</span> </span><span id="L-22"><a name="L-22"></a> <span class="p">{</span> </span><span id="L-23"><a name="L-23"></a> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="s">&quot;Enter 1st digit of seat num.: &quot;</span> <span class="p">;</span> </span><span id="L-24"><a name="L-24"></a> <span class="n">cin</span> <span class="o">&gt;&gt;</span> <span class="n">x</span><span class="p">;</span> </span><span id="L-25"><a name="L-25"></a> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="s">&quot;Enter 2nd digit of seat num.: &quot;</span> <span class="p">;</span> </span><span id="L-26"><a name="L-26"></a> <span class="n">cin</span> <span class="o">&gt;&gt;</span> <span class="n">y</span><span class="p">;</span> </span><span id="L-27"><a name="L-27"></a> </span><span id="L-28"><a name="L-28"></a> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span> <span class="o">&lt;&lt;</span> <span class="s">&quot;Seat num &quot;</span> <span class="o">&lt;&lt;</span> <span class="n">x</span> <span class="o">&lt;&lt;</span> <span class="n">y</span> <span class="o">&lt;&lt;</span> <span class="s">&quot;: &quot;</span> <span class="o">&lt;&lt;</span> <span class="n">seat</span><span class="p">[</span><span class="n">x</span><span class="p">][</span><span class="n">y</span><span class="p">]</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span><span class="p">;</span> </span><span id="L-29"><a name="L-29"></a> </span><span id="L-30"><a name="L-30"></a> <span class="k">if</span> <span class="p">(</span><span class="n">seat</span><span class="p">[</span><span class="n">x</span><span class="p">][</span><span class="n">y</span><span class="p">]</span> <span class="o">==</span> <span class="mi">1</span><span class="p">)</span> </span><span id="L-31"><a name="L-31"></a> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="s">&quot;Seat is occupied, please find another seat.&quot;</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span><span class="p">;</span> </span><span id="L-32"><a name="L-32"></a> </span><span id="L-33"><a name="L-33"></a> <span class="k">while</span> <span class="p">(</span><span class="n">seat</span><span class="p">[</span><span class="n">x</span><span class="p">][</span><span class="n">y</span><span class="p">]</span> <span class="o">!=</span> <span class="mi">1</span><span class="p">)</span> </span><span id="L-34"><a name="L-34"></a> <span class="p">{</span> </span><span id="L-35"><a name="L-35"></a> <span class="n">seat</span><span class="p">[</span><span class="n">x</span><span class="p">][</span><span class="n">y</span><span class="p">]</span> <span class="o">=</span> <span class="mi">1</span><span class="p">;</span> </span><span id="L-36"><a name="L-36"></a> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="s">&quot;You have taken the seat.&quot;</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span><span class="p">;</span> </span><span id="L-37"><a name="L-37"></a> <span class="p">}</span> </span><span id="L-38"><a name="L-38"></a> </span><span id="L-39"><a name="L-39"></a> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span><span class="p">;</span> </span><span id="L-40"><a name="L-40"></a> </span><span id="L-41"><a name="L-41"></a> <span class="k">for</span> <span class="p">(</span><span class="kt">int</span> <span class="n">x</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span> <span class="n">x</span><span class="o">&lt;</span><span class="mi">10</span><span class="p">;</span> <span class="n">x</span><span class="o">++</span><span class="p">)</span> </span><span id="L-42"><a name="L-42"></a> <span class="p">{</span> </span><span id="L-43"><a name="L-43"></a> <span class="k">for</span> <span class="p">(</span><span class="kt">int</span> <span class="n">y</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span> <span class="n">y</span><span class="o">&lt;</span><span class="mi">10</span><span class="p">;</span> <span class="n">y</span><span class="o">++</span><span class="p">)</span> </span><span id="L-44"><a name="L-44"></a> <span class="p">{</span> </span><span id="L-45"><a name="L-45"></a> <span class="k">if</span> <span class="p">(</span><span class="n">seat</span><span class="p">[</span><span class="n">x</span><span class="p">][</span><span class="n">y</span><span class="p">]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> </span><span id="L-46"><a name="L-46"></a> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="s">&quot;*&quot;</span> <span class="p">;</span> </span><span id="L-47"><a name="L-47"></a> <span class="k">else</span> <span class="k">if</span> <span class="p">(</span><span class="n">seat</span><span class="p">[</span><span class="n">x</span><span class="p">][</span><span class="n">y</span><span class="p">]</span> <span class="o">==</span> <span class="mi">1</span><span class="p">)</span> </span><span id="L-48"><a name="L-48"></a> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="s">&quot;0&quot;</span><span class="p">;</span> </span><span id="L-49"><a name="L-49"></a> <span class="p">}</span> </span><span id="L-50"><a name="L-50"></a> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span><span class="p">;</span> </span><span id="L-51"><a name="L-51"></a> <span class="p">}</span> </span><span id="L-52"><a name="L-52"></a> </span><span id="L-53"><a name="L-53"></a> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span><span class="p">;</span> </span><span id="L-54"><a name="L-54"></a> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="s">&quot;Do you want to book another seat? &quot;</span><span class="p">;</span> </span><span id="L-55"><a name="L-55"></a> <span class="n">cin</span> <span class="o">&gt;&gt;</span> <span class="n">exit</span><span class="p">;</span> </span><span id="L-56"><a name="L-56"></a> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span><span class="p">;</span> </span><span id="L-57"><a name="L-57"></a> <span class="p">}</span> </span><span id="L-58"><a name="L-58"></a> </span><span id="L-59"><a name="L-59"></a> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-60"><a name="L-60"></a><span class="p">}</span> </span></pre></div> </td></tr></table>
array