solution.</p><p>One is focused on counting ananas or in case of generic version any substring in
the file, but with a restriction on the function you use.</p><p>Other one has a more algorithmic spirit.</p><p>For this bonus you can get at maximum 2.5 K₡.</p><h2class="anchor anchorWithStickyNavbar_LWe7"id="warning">Warning<ahref="#warning"class="hash-link"aria-label="Direct link to Warning"title="Direct link to Warning"></a></h2><p><strong>DO NOT COMMIT test data</strong> to your own git repository, since the tests include
files that exceed 10MB by themselves. Even if they are on separate branch, they
take up the space.</p><h2class="anchor anchorWithStickyNavbar_LWe7"id="testing">Testing<ahref="#testing"class="hash-link"aria-label="Direct link to Testing"title="Direct link to Testing"></a></h2><p>For testing you are provided with python script (requires <code>click</code> to be installed:
<code>pip3 install --user click</code>) and <code>Makefile</code> that provides following targets:</p><ul><li><code>check-counting</code> - runs the <code>counting</code> tests</li><li><code>check-counting-bonus</code> - runs the <code>counting</code> tests with bonus implemented</li><li><code>check</code> - runs both <code>counting</code> and <code>counting-bonus</code> tests</li><li><code>clean</code> - removes output files from the test runs</li></ul><h2class="anchor anchorWithStickyNavbar_LWe7"id="task-no-1-counting-075-k">Task no. 1: Counting (0.75 K₡)<ahref="#task-no-1-counting-075-k"class="hash-link"aria-label="Direct link to Task no. 1: Counting (0.75 K₡)"title="Direct link to Task no. 1: Counting (0.75 K₡)"></a></h2><p>Your first task is to make smallish program that counts occurences of specific
(or given) word from file and writes the number to other file.</p><p>Usage of the program is:</p><divclass="codeBlockContainer_Ckt0 theme-code-block"style="--prism-color:#000000;--prism-background-color:#ffffff"><divclass="codeBlockContent_biex"><pretabindex="0"class="prism-code language-text codeBlock_bY9V thin-scrollbar"><codeclass="codeBlockLines_e6Vv"><spanclass="token-line"style="color:#000000"><spanclass="token plain">Usage: ./counting <input-file><output-file> [string-to-be-counted]</span><br></span></code></pre><divclass="buttonGroup__atx"><buttontype="button"aria-label="Copy code to clipboard"title="Copy"class="clean-btn"><spanclass="copyButtonIcons_eSgA"aria-hidden="true"><svgviewBox="0 0 24 24"class="copyButtonIcon_y97N"><pathfill="currentColor"d="M19,21H8V7H19M19,5H8A2,2 0 0,0 6,7V21A2,2 0 0,0 8,23H19A2,2 0 0,0 21,21V7A2,2 0 0,0 19,5M16,1H4A2,2 0 0,0 2,3V17H4V3H16V1Z"></path></svg><svgviewBox="0 0 24 24"class="copyButtonSuccessIcon_LjdS"><pathfill="currentColor"d="M21,7L9,19L3.5,13.5L4.91,12.09L9,16.17L19.59,5.59L21,7Z"></path></svg></span></button></div></div></div><p>Arguments that are passed to the program represent:</p><ul><li><code><input-file></code> - path to the file where we count the words</li><li><code><output-file></code> - path to the file where we output the count</li><li>(optional argument) <code>[string-to-be-counted]</code> - in case you implement bonus,
otherwise we default to word <code>ananas</code> ;)</li></ul><p>In skeleton you are given 3 empty, but documented, functions to implement.</p><ol><li><code>count_anything</code> - function accepts input file and substring to be counted in
the file, returns the count.</li><li><code>count_ananas</code> - same as <code>count_anything</code>, but specialized for ananases, the
default implementation from the skeleton expects you to implement <code>count_anything</code>
and therefore it just calls the other function.</li><li><code>write_number</code> - function that writes the number to the file, why would you
need the function is explained later :)</li></ol><h3class="anchor anchorWithStickyNavbar_LWe7"id="requirements">Requirements<ahref="#requirements"class="hash-link"aria-label="Direct link to Requirements"title="Direct link to Requirements"></a></h3><p>For manipulation with the files you are only allowed to use <code>fopen</code>, <code>fclose</code>,
<code>fgetc</code> and <code>fputc</code>. Functions like <code>fprintf</code> (except for <code>stderr</code> or logging) and
<code>fscanf</code> are <strong>forbidden</strong>.</p><p>In case you struggle and want to use one of those functions, the solution will be
penalized by 50% of points.</p><h3class="anchor anchorWithStickyNavbar_LWe7"id="bonus-part-075-k">Bonus part (0.75 K₡)<ahref="#bonus-part-075-k"class="hash-link"aria-label="Direct link to Bonus part (0.75 K₡)"title="Direct link to Bonus part (0.75 K₡)"></a></h3><p>Bonus part of this assignment is to implement <code>count_anything</code> rather than <code>count_ananas</code>.</p><blockquote><p>Smaller hint: This task does not need dynamic allocation :) You just need one
good helper function and the right idea ;)</p></blockquote><h2class="anchor anchorWithStickyNavbar_LWe7"id="task-no-2-weird-trees-1-k">Task no. 2: Weird trees (1 K₡)<ahref="#task-no-2-weird-trees-1-k"class="hash-link"aria-label="Direct link to Task no. 2: Weird trees (1 K₡)"title="Direct link to Task no. 2: Weird trees (1 K₡)"></a></h2><p>In this task we are crossing our paths with <em>algorithms and data structures</em>.
Your task is to write a program that constructs tree from the file that is given
as an argument and pretty-prints it.</p><p>Input file consists of lines, that include <code>key</code> and <code>rank</code> in form <code>key;rank</code>
or <code>nil</code>. Why would we have <code>nil</code> in a file? The file represents pre-order iteration
through the tree. Leaves never have rank different than 0, so you can safely assume
2 non-existing <code>nil</code>s in the input after you read such node ;)</p><table><tr><th>Example input file</th><th>Tree it represents</th></tr><tr><td><divclass="codeBlockContainer_Ckt0 theme-code-block"style="--prism-color:#000000;--prism-background-color:#ffffff"><divclass="codeBlockContent_biex"><pretabindex="0"class="prism-code language-text codeBlock_bY9V thin-scrollbar"><codeclass="codeBlockLines_e6Vv"><spanclass="token-line"style="color:#000000"><spanclass="token plain">8;4</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">5;3</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">3;2</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">2;1</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">1;0</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">nil</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">4;0</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">7;1</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">6;0</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">nil</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">11;2</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">10;1</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">9;0</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">nil</span><br></span><spanclass="token-line"style="color:#000000"><spanclass="token plain">12;0</span><br></span></code></pre><divclass="buttonGroup__atx"><buttontype="button"aria-label="Copy code to clipboard"title="Copy"class="clean-btn"><spanclass="copyButtonIcons_eSgA"aria-hidden="true"><svgviewBox="0 0 24 24"class="copyButtonIcon_y97N"><pathfill="currentColor"d="M19,21H8V7H19M19,5H8A2,2 0 0,0 6,7V21A2,2 0 0,0 8,23H19A2,2 0 0,0 21,21V7A2,2 0 0,0 19,5M16,1H4A2,2 0 0,0 2,3V17H4V3H16V1Z"></path></svg><svgviewBox="0 0 24 24"class="copyButtonSuccessIcon_LjdS"><pathfill="currentColor"d="M21,7L9,19L3.5,13.5L4.91,12.09L9,16.17L19.59,5.59L21,7Z"></path></svg></span></button></div></div></div></td><td><p><imgloading="lazy"alt="tree"src="/assets/images/tree-c9e37f87f9095c00fad33ea034485ce6.png"width="633"height="684"class="img_ev3q"></p></td></tr></table><p>In this task you are only provided with different trees in the <code>test-trees</code> directory.
