OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity
ae15061d41
TheAlgorithms-C/db/d01/problem__13_2sol1_8c.html
github-actions 8dac294c8c Documentation for b819ddf3e6
2023-01-20 21:44:50 +00:00

438 lines
31 KiB
HTML
Raw Blame History

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C: project_euler/problem_13/sol1.c File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('db/d01/problem__13_2sol1_8c.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">sol1.c File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://projecteuler.net/problem=13" target="_blank">Problem 13</a> solution
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;stdint.h&gt;</code><br />
<code>#include &lt;stdio.h&gt;</code><br />
<code>#include &lt;stdlib.h&gt;</code><br />
<code>#include &lt;string.h&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for sol1.c:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d74/problem__13_2sol1_8c__incl.svg" width="340" height="124"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ac260f58785fb20eb09bb35385a7d47f8"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8">get_number</a> (FILE *fp, char *<a class="el" href="../../dd/da2/structbuffer.html">buffer</a>, uint8_t *out_int)</td></tr>
<tr class="memdesc:ac260f58785fb20eb09bb35385a7d47f8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to read the number from a file and store it in array. <br /></td></tr>
<tr class="separator:ac260f58785fb20eb09bb35385a7d47f8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad51742ca5a5c99e860bdf30299163bf2"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2">add_numbers</a> (uint8_t *a, uint8_t *b, uint8_t N)</td></tr>
<tr class="memdesc:ad51742ca5a5c99e860bdf30299163bf2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to add arbitrary length decimal integers stored in an array. <br /></td></tr>
<tr class="separator:ad51742ca5a5c99e860bdf30299163bf2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a248adc917818cc6666d8bc679a660319"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319">print_number</a> (uint8_t *number, uint8_t N, int8_t num_digits_to_print)</td></tr>
<tr class="memdesc:a248adc917818cc6666d8bc679a660319"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to print a long number. <br /></td></tr>
<tr class="separator:a248adc917818cc6666d8bc679a660319"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a840291bc02cba5474a4cb46a9b9566fe"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a840291bc02cba5474a4cb46a9b9566fe">main</a> (void)</td></tr>
<tr class="memdesc:a840291bc02cba5474a4cb46a9b9566fe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:a840291bc02cba5474a4cb46a9b9566fe"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://projecteuler.net/problem=13" target="_blank">Problem 13</a> solution </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ad51742ca5a5c99e860bdf30299163bf2" name="ad51742ca5a5c99e860bdf30299163bf2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad51742ca5a5c99e860bdf30299163bf2">&#9670;&#160;</a></span>add_numbers()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int add_numbers </td>
<td>(</td>
<td class="paramtype">uint8_t *&#160;</td>
<td class="paramname"><em>a</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint8_t *&#160;</td>
<td class="paramname"><em>b</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint8_t&#160;</td>
<td class="paramname"><em>N</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to add arbitrary length decimal integers stored in an array. </p>
<p>a + b = c = new b </p>
<div class="fragment"><div class="line"><span class="lineno"> 49</span>{</div>
<div class="line"><span class="lineno"> 50</span> <span class="keywordtype">int</span> carry = 0;</div>
<div class="line"><span class="lineno"> 51</span> uint8_t *c = b; <span class="comment">/* accumulate the result in the array &#39;b&#39; */</span></div>
<div class="line"><span class="lineno"> 52</span> </div>
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N; i++)</div>
<div class="line"><span class="lineno"> 54</span> {</div>
<div class="line"><span class="lineno"> 55</span> <span class="comment">// printf(&quot;\t%d + %d + %d &quot;, a[i], b[i], carry);</span></div>
<div class="line"><span class="lineno"> 56</span> c[i] = carry + a[i] + b[i]; <span class="comment">// NOLINT // This is a known false-positive</span></div>
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">if</span> (c[i] &gt; 9) <span class="comment">/* check for carry */</span></div>
<div class="line"><span class="lineno"> 58</span> {</div>
<div class="line"><span class="lineno"> 59</span> carry = 1;</div>
<div class="line"><span class="lineno"> 60</span> c[i] -= 10;</div>
<div class="line"><span class="lineno"> 61</span> }</div>
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 63</span> {</div>
<div class="line"><span class="lineno"> 64</span> carry = 0;</div>
<div class="line"><span class="lineno"> 65</span> }</div>
<div class="line"><span class="lineno"> 66</span> <span class="comment">// printf(&quot;= %d, %d\n&quot;, carry, c[i]);</span></div>
<div class="line"><span class="lineno"> 67</span> }</div>
<div class="line"><span class="lineno"> 68</span> </div>
<div class="line"><span class="lineno"> 69</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = N; i &lt; N + 10; i++)</div>
<div class="line"><span class="lineno"> 70</span> {</div>
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">if</span> (carry == 0)</div>
<div class="line"><span class="lineno"> 72</span> {</div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 74</span> }</div>
<div class="line"><span class="lineno"> 75</span> <span class="comment">// printf(&quot;\t0 + %d + %d &quot;, b[i], carry);</span></div>
<div class="line"><span class="lineno"> 76</span> c[i] = carry + c[i];</div>
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">if</span> (c[i] &gt; 9)</div>
<div class="line"><span class="lineno"> 78</span> {</div>
<div class="line"><span class="lineno"> 79</span> carry = 1;</div>
<div class="line"><span class="lineno"> 80</span> c[i] -= 10;</div>
<div class="line"><span class="lineno"> 81</span> }</div>
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 83</span> {</div>
<div class="line"><span class="lineno"> 84</span> carry = 0;</div>
<div class="line"><span class="lineno"> 85</span> }</div>
<div class="line"><span class="lineno"> 86</span> <span class="comment">// printf(&quot;= %d, %d\n&quot;, carry, c[i]);</span></div>
<div class="line"><span class="lineno"> 87</span> }</div>
<div class="line"><span class="lineno"> 88</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 89</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="ac260f58785fb20eb09bb35385a7d47f8" name="ac260f58785fb20eb09bb35385a7d47f8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac260f58785fb20eb09bb35385a7d47f8">&#9670;&#160;</a></span>get_number()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int get_number </td>
<td>(</td>
<td class="paramtype">FILE *&#160;</td>
<td class="paramname"><em>fp</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">char *&#160;</td>
<td class="paramname"><em>buffer</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint8_t *&#160;</td>
<td class="paramname"><em>out_int</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to read the number from a file and store it in array. </p>
<p><br />
index 0 of output buffer =&gt; units place <br />
index 1 of output buffer =&gt; tens place and so on i.e., index i =&gt; 10^i th place </p>
<div class="fragment"><div class="line"><span class="lineno"> 17</span>{</div>
<div class="line"><span class="lineno"> 18</span> <span class="keywordtype">long</span> l = fscanf(fp, <span class="stringliteral">&quot;%s\n&quot;</span>, <a class="code hl_struct" href="../../dd/da2/structbuffer.html">buffer</a>);</div>
<div class="line"><span class="lineno"> 19</span> <span class="keywordflow">if</span> (!l)</div>
<div class="line"><span class="lineno"> 20</span> {</div>
<div class="line"><span class="lineno"> 21</span> perror(<span class="stringliteral">&quot;Error reading line.&quot;</span>);</div>
<div class="line"><span class="lineno"> 22</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><span class="lineno"> 23</span> }</div>
<div class="line"><span class="lineno"> 24</span> <span class="comment">// printf(&quot;Number: %s\t length: %ld, %ld\n&quot;, buffer, strlen(buffer), l);</span></div>
<div class="line"><span class="lineno"> 25</span> </div>
<div class="line"><span class="lineno"> 26</span> <span class="keywordtype">long</span> <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a> = strlen(<a class="code hl_struct" href="../../dd/da2/structbuffer.html">buffer</a>);</div>
<div class="line"><span class="lineno"> 27</span> </div>
<div class="line"><span class="lineno"> 28</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_struct" href="../../df/db3/struct_l.html">L</a>; i++)</div>
<div class="line"><span class="lineno"> 29</span> {</div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">if</span> (<a class="code hl_struct" href="../../dd/da2/structbuffer.html">buffer</a>[i] &lt; 0x30 || <a class="code hl_struct" href="../../dd/da2/structbuffer.html">buffer</a>[i] &gt; 0x39)</div>
<div class="line"><span class="lineno"> 31</span> {</div>
<div class="line"><span class="lineno"> 32</span> perror(<span class="stringliteral">&quot;found inavlid character in the number!&quot;</span>);</div>
<div class="line"><span class="lineno"> 33</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><span class="lineno"> 34</span> }</div>
<div class="line"><span class="lineno"> 35</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 36</span> {</div>
<div class="line"><span class="lineno"> 37</span> out_int[<a class="code hl_struct" href="../../df/db3/struct_l.html">L</a> - i - 1] = <a class="code hl_struct" href="../../dd/da2/structbuffer.html">buffer</a>[i] - 0x30;</div>
<div class="line"><span class="lineno"> 38</span> }</div>
<div class="line"><span class="lineno"> 39</span> }</div>
<div class="line"><span class="lineno"> 40</span> </div>
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 42</span>}</div>
<div class="ttc" id="astruct_l_html"><div class="ttname"><a href="../../df/db3/struct_l.html">L</a></div><div class="ttdef"><b>Definition:</b> list.h:8</div></div>
<div class="ttc" id="astructbuffer_html"><div class="ttname"><a href="../../dd/da2/structbuffer.html">buffer</a></div><div class="ttdoc">struct used to store character in certain times</div><div class="ttdef"><b>Definition:</b> min_printf.h:31</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a840291bc02cba5474a4cb46a9b9566fe" name="a840291bc02cba5474a4cb46a9b9566fe"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a840291bc02cba5474a4cb46a9b9566fe">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<div class="fragment"><div class="line"><span class="lineno"> 124</span>{</div>
<div class="line"><span class="lineno"> 125</span> <span class="comment">/* number of digits of the large number */</span></div>
<div class="line"><span class="lineno"> 126</span> <span class="keyword">const</span> <span class="keywordtype">int</span> N = 10;</div>
<div class="line"><span class="lineno"> 127</span> <span class="comment">/* number of digits in output number */</span></div>
<div class="line"><span class="lineno"> 128</span> <span class="keyword">const</span> <span class="keywordtype">int</span> N2 = N + 10;</div>
<div class="line"><span class="lineno"> 129</span> </div>
<div class="line"><span class="lineno"> 130</span> <span class="comment">// const char N = 50, N2 = N+10; /* length of numbers */</span></div>
<div class="line"><span class="lineno"> 131</span> <span class="keywordtype">char</span> *txt_buffer =</div>
<div class="line"><span class="lineno"> 132</span> (<span class="keywordtype">char</span> *)<a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a>(N + 5, <span class="keyword">sizeof</span>(<span class="keywordtype">char</span>)); <span class="comment">/* temporary buffer */</span></div>
<div class="line"><span class="lineno"> 133</span> uint8_t *number = (uint8_t *)<a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a>(</div>
<div class="line"><span class="lineno"> 134</span> N, <span class="keyword">sizeof</span>(uint8_t)); <span class="comment">/* array to store digits of a large number */</span></div>
<div class="line"><span class="lineno"> 135</span> uint8_t *sum = (uint8_t *)<a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a>(</div>
<div class="line"><span class="lineno"> 136</span> N2, <span class="keyword">sizeof</span>(uint8_t)); <span class="comment">/* array to store the sum of the large</span></div>
<div class="line"><span class="lineno"> 137</span><span class="comment">numbers. For safety, we make it twice the length of a number. */</span></div>
<div class="line"><span class="lineno"> 138</span> </div>
<div class="line"><span class="lineno"> 139</span> FILE *fp = fopen(<span class="stringliteral">&quot;num.txt&quot;</span>, <span class="stringliteral">&quot;rt&quot;</span>); <span class="comment">/* open text file to read */</span></div>
<div class="line"><span class="lineno"> 140</span> <span class="keywordflow">if</span> (!fp)</div>
<div class="line"><span class="lineno"> 141</span> {</div>
<div class="line"><span class="lineno"> 142</span> perror(<span class="stringliteral">&quot;Unable to open file &#39;num.txt&#39;.&quot;</span>);</div>
<div class="line"><span class="lineno"> 143</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(txt_buffer);</div>
<div class="line"><span class="lineno"> 144</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(sum);</div>
<div class="line"><span class="lineno"> 145</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(number);</div>
<div class="line"><span class="lineno"> 146</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><span class="lineno"> 147</span> }</div>
<div class="line"><span class="lineno"> 148</span> </div>
<div class="line"><span class="lineno"> 149</span> <span class="keywordtype">int</span> count = 0;</div>
<div class="line"><span class="lineno"> 150</span> <a class="code hl_function" href="../../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8">get_number</a>(fp, txt_buffer, sum); <span class="comment">/* 0 + = first_number = first_number */</span></div>
<div class="line"><span class="lineno"> 151</span> <span class="keywordflow">do</span></div>
<div class="line"><span class="lineno"> 152</span> {</div>
<div class="line"><span class="lineno"> 153</span> count++;</div>
<div class="line"><span class="lineno"> 154</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8">get_number</a>(fp, txt_buffer, number) != 0)</div>
<div class="line"><span class="lineno"> 155</span> {</div>
<div class="line"><span class="lineno"> 156</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 157</span> }</div>
<div class="line"><span class="lineno"> 158</span> <a class="code hl_function" href="../../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2">add_numbers</a>(number, sum, N);</div>
<div class="line"><span class="lineno"> 159</span> } <span class="keywordflow">while</span> (!feof(fp));</div>
<div class="line"><span class="lineno"> 160</span> </div>
<div class="line"><span class="lineno"> 161</span> printf(<span class="stringliteral">&quot;\nSum : &quot;</span>);</div>
<div class="line"><span class="lineno"> 162</span> <a class="code hl_function" href="../../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319">print_number</a>(sum, N2, -1);</div>
<div class="line"><span class="lineno"> 163</span> </div>
<div class="line"><span class="lineno"> 164</span> printf(<span class="stringliteral">&quot;first 10 digits: \t&quot;</span>);</div>
<div class="line"><span class="lineno"> 165</span> <a class="code hl_function" href="../../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319">print_number</a>(sum, N2, 10);</div>
<div class="line"><span class="lineno"> 166</span> </div>
<div class="line"><span class="lineno"> 167</span> fclose(fp); <span class="comment">/* close file */</span></div>
<div class="line"><span class="lineno"> 168</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(txt_buffer);</div>
<div class="line"><span class="lineno"> 169</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(sum);</div>
<div class="line"><span class="lineno"> 170</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(number);</div>
<div class="line"><span class="lineno"> 171</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 172</span>}</div>
<div class="ttc" id="amalloc__dbg_8h_html_a9cc854374299a1dd933bf62029761768"><div class="ttname"><a href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a></div><div class="ttdeci">#define free(ptr)</div><div class="ttdoc">This macro replace the standard free function with free_dbg.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.h:26</div></div>
<div class="ttc" id="amalloc__dbg_8h_html_afdddaa949a93c1ef559a638e98f9c21b"><div class="ttname"><a href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a></div><div class="ttdeci">#define calloc(elemCount, elemSize)</div><div class="ttdoc">This macro replace the standard calloc function with calloc_dbg.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.h:22</div></div>
<div class="ttc" id="aproblem__13_2sol1_8c_html_a248adc917818cc6666d8bc679a660319"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319">print_number</a></div><div class="ttdeci">int print_number(uint8_t *number, uint8_t N, int8_t num_digits_to_print)</div><div class="ttdoc">Function to print a long number.</div><div class="ttdef"><b>Definition:</b> sol1.c:92</div></div>
<div class="ttc" id="aproblem__13_2sol1_8c_html_ac260f58785fb20eb09bb35385a7d47f8"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#ac260f58785fb20eb09bb35385a7d47f8">get_number</a></div><div class="ttdeci">int get_number(FILE *fp, char *buffer, uint8_t *out_int)</div><div class="ttdoc">Function to read the number from a file and store it in array.</div><div class="ttdef"><b>Definition:</b> sol1.c:16</div></div>
<div class="ttc" id="aproblem__13_2sol1_8c_html_ad51742ca5a5c99e860bdf30299163bf2"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2">add_numbers</a></div><div class="ttdeci">int add_numbers(uint8_t *a, uint8_t *b, uint8_t N)</div><div class="ttdoc">Function to add arbitrary length decimal integers stored in an array.</div><div class="ttdef"><b>Definition:</b> sol1.c:48</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d01/problem__13_2sol1_8c_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg" width="210" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a248adc917818cc6666d8bc679a660319" name="a248adc917818cc6666d8bc679a660319"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a248adc917818cc6666d8bc679a660319">&#9670;&#160;</a></span>print_number()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int print_number </td>
<td>(</td>
<td class="paramtype">uint8_t *&#160;</td>
<td class="paramname"><em>number</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint8_t&#160;</td>
<td class="paramname"><em>N</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int8_t&#160;</td>
<td class="paramname"><em>num_digits_to_print</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to print a long number. </p>
<div class="fragment"><div class="line"><span class="lineno"> 93</span>{</div>
<div class="line"><span class="lineno"> 94</span> uint8_t start_pos = N - 1;</div>
<div class="line"><span class="lineno"> 95</span> uint8_t end_pos;</div>
<div class="line"><span class="lineno"> 96</span> </div>
<div class="line"><span class="lineno"> 97</span> <span class="comment">/* skip all initial zeros */</span></div>
<div class="line"><span class="lineno"> 98</span> <span class="keywordflow">while</span> (number[start_pos] == 0) start_pos--;</div>
<div class="line"><span class="lineno"> 99</span> </div>
<div class="line"><span class="lineno"> 100</span> <span class="comment">/* if end_pos &lt; 0, print all digits */</span></div>
<div class="line"><span class="lineno"> 101</span> <span class="keywordflow">if</span> (num_digits_to_print &lt; 0)</div>
<div class="line"><span class="lineno"> 102</span> {</div>
<div class="line"><span class="lineno"> 103</span> end_pos = 0;</div>
<div class="line"><span class="lineno"> 104</span> }</div>
<div class="line"><span class="lineno"> 105</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (num_digits_to_print &lt;= start_pos)</div>
<div class="line"><span class="lineno"> 106</span> {</div>
<div class="line"><span class="lineno"> 107</span> end_pos = start_pos - num_digits_to_print + 1;</div>
<div class="line"><span class="lineno"> 108</span> }</div>
<div class="line"><span class="lineno"> 109</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 110</span> {</div>
<div class="line"><span class="lineno"> 111</span> fprintf(stderr, <span class="stringliteral">&quot;invalid number of digits argumet!\n&quot;</span>);</div>
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><span class="lineno"> 113</span> }</div>
<div class="line"><span class="lineno"> 114</span> </div>
<div class="line"><span class="lineno"> 115</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = start_pos; i &gt;= end_pos; i--) putchar(number[i] + 0x30);</div>
<div class="line"><span class="lineno"> 116</span> </div>
<div class="line"><span class="lineno"> 117</span> putchar(<span class="charliteral">&#39;\n&#39;</span>);</div>
<div class="line"><span class="lineno"> 118</span> </div>
<div class="line"><span class="lineno"> 119</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 120</span>}</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_b3d331eabd4234f247030c297aaf021c.html">project_euler</a></li><li class="navelem"><a class="el" href="../../dir_f7d3c03fcac84aef1b0c66cc497ed1ea.html">problem_13</a></li><li class="navelem"><a class="el" href="../../db/d01/problem__13_2sol1_8c.html">sol1.c</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.6 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink