snipt

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

C++

Codeforces 39 B - Company Income Growth

//============================================================================
// Name        : cf@39-B.cpp	B. Company Income Growth
// Author      : LiJunLe
// Version     : Accepted
// Copyright   : http://codeforces.com/contest/39/problem/B
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <stdio.h>
using namespace std;

int data[105];
int out[105];

int main() {
	int n;
	while(scanf("%d", &n) != EOF) {
		for (int i = 0; i < n; i ++) {
			scanf("%d", &data[i]);
		}
		int cnt = 0;
		for (int i = 0; i < n; i ++) {
			if (data[i] == cnt + 1) {
				out[cnt] = 2000 + i + 1;
				cnt ++;
			}
		}
		printf("%d\n", cnt);
		if (cnt) {
			for (int i = 0; i < cnt-1; i ++) {
				printf("%d ", out[i]);
			}
			printf("%d\n", out[cnt-1]);
		}
	}
	return 0;
}
https://snipt.net/embed/4d24d5b9466480fa8de155a504914144/
https://snipt.net/raw/4d24d5b9466480fa8de155a504914144/
4d24d5b9466480fa8de155a504914144
cpp
C++
39
2014-04-25T00:36:43
True
False
/api/public/snipt/20166/
codeforces-39-b-company-income-growth
<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></pre></div></td><td class="code"><div class="highlight"><pre><span id="L-1"><a name="L-1"></a><span class="c1">//============================================================================</span> </span><span id="L-2"><a name="L-2"></a><span class="c1">// Name : cf@39-B.cpp B. Company Income Growth</span> </span><span id="L-3"><a name="L-3"></a><span class="c1">// Author : LiJunLe</span> </span><span id="L-4"><a name="L-4"></a><span class="c1">// Version : Accepted</span> </span><span id="L-5"><a name="L-5"></a><span class="c1">// Copyright : http://codeforces.com/contest/39/problem/B</span> </span><span id="L-6"><a name="L-6"></a><span class="c1">// Description : Hello World in C++, Ansi-style</span> </span><span id="L-7"><a name="L-7"></a><span class="c1">//============================================================================</span> </span><span id="L-8"><a name="L-8"></a> </span><span id="L-9"><a name="L-9"></a><span class="cp">#include &lt;iostream&gt;</span> </span><span id="L-10"><a name="L-10"></a><span class="cp">#include &lt;stdio.h&gt;</span> </span><span id="L-11"><a name="L-11"></a><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</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="kt">int</span> <span class="n">data</span><span class="p">[</span><span class="mi">105</span><span class="p">];</span> </span><span id="L-14"><a name="L-14"></a><span class="kt">int</span> <span class="n">out</span><span class="p">[</span><span class="mi">105</span><span class="p">];</span> </span><span id="L-15"><a name="L-15"></a> </span><span id="L-16"><a name="L-16"></a><span class="kt">int</span> <span class="nf">main</span><span class="p">()</span> <span class="p">{</span> </span><span id="L-17"><a name="L-17"></a> <span class="kt">int</span> <span class="n">n</span><span class="p">;</span> </span><span id="L-18"><a name="L-18"></a> <span class="k">while</span><span class="p">(</span><span class="n">scanf</span><span class="p">(</span><span class="s">&quot;%d&quot;</span><span class="p">,</span> <span class="o">&amp;</span><span class="n">n</span><span class="p">)</span> <span class="o">!=</span> <span class="n">EOF</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-19"><a name="L-19"></a> <span class="k">for</span> <span class="p">(</span><span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">n</span><span class="p">;</span> <span class="n">i</span> <span class="o">++</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-20"><a name="L-20"></a> <span class="n">scanf</span><span class="p">(</span><span class="s">&quot;%d&quot;</span><span class="p">,</span> <span class="o">&amp;</span><span class="n">data</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span> </span><span id="L-21"><a name="L-21"></a> <span class="p">}</span> </span><span id="L-22"><a name="L-22"></a> <span class="kt">int</span> <span class="n">cnt</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-23"><a name="L-23"></a> <span class="k">for</span> <span class="p">(</span><span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">n</span><span class="p">;</span> <span class="n">i</span> <span class="o">++</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-24"><a name="L-24"></a> <span class="k">if</span> <span class="p">(</span><span class="n">data</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">==</span> <span class="n">cnt</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-25"><a name="L-25"></a> <span class="n">out</span><span class="p">[</span><span class="n">cnt</span><span class="p">]</span> <span class="o">=</span> <span class="mi">2000</span> <span class="o">+</span> <span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">;</span> </span><span id="L-26"><a name="L-26"></a> <span class="n">cnt</span> <span class="o">++</span><span class="p">;</span> </span><span id="L-27"><a name="L-27"></a> <span class="p">}</span> </span><span id="L-28"><a name="L-28"></a> <span class="p">}</span> </span><span id="L-29"><a name="L-29"></a> <span class="n">printf</span><span class="p">(</span><span class="s">&quot;%d</span><span class="se">\n</span><span class="s">&quot;</span><span class="p">,</span> <span class="n">cnt</span><span class="p">);</span> </span><span id="L-30"><a name="L-30"></a> <span class="k">if</span> <span class="p">(</span><span class="n">cnt</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-31"><a name="L-31"></a> <span class="k">for</span> <span class="p">(</span><span class="kt">int</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">cnt</span><span class="o">-</span><span class="mi">1</span><span class="p">;</span> <span class="n">i</span> <span class="o">++</span><span class="p">)</span> <span class="p">{</span> </span><span id="L-32"><a name="L-32"></a> <span class="n">printf</span><span class="p">(</span><span class="s">&quot;%d &quot;</span><span class="p">,</span> <span class="n">out</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span> </span><span id="L-33"><a name="L-33"></a> <span class="p">}</span> </span><span id="L-34"><a name="L-34"></a> <span class="n">printf</span><span class="p">(</span><span class="s">&quot;%d</span><span class="se">\n</span><span class="s">&quot;</span><span class="p">,</span> <span class="n">out</span><span class="p">[</span><span class="n">cnt</span><span class="o">-</span><span class="mi">1</span><span class="p">]);</span> </span><span id="L-35"><a name="L-35"></a> <span class="p">}</span> </span><span id="L-36"><a name="L-36"></a> <span class="p">}</span> </span><span id="L-37"><a name="L-37"></a> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-38"><a name="L-38"></a><span class="p">}</span> </span></pre></div> </td></tr></table>
39, cf, codeforces, company, growth, income