mirror of
https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git
synced 2023-10-11 15:56:24 +08:00
386 lines
27 KiB
HTML
386 lines
27 KiB
HTML
<!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">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.18"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Algorithms_in_C: project_euler/problem_25/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 style="height: 56px;">
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">Algorithms_in_C
|
|
 <span id="projectnumber">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.8.18 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
|
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('d8/d32/problem__25_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">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="summary">
|
|
<a href="#define-members">Macros</a> |
|
|
<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=25">Problem 25</a> solution implemented using arbitrarily large numbers represented as arrays
|
|
<a href="#details">More...</a></p>
|
|
<div class="textblock"><code>#include <stdint.h></code><br />
|
|
<code>#include <stdio.h></code><br />
|
|
<code>#include <stdlib.h></code><br />
|
|
<code>#include <string.h></code><br />
|
|
<code>#include <time.h></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="../../d5/d51/problem__25_2sol1_8c__incl.svg" width="424" height="127"><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 name="define-members"></a>
|
|
Macros</h2></td></tr>
|
|
<tr class="memitem:a001791a21d538b8b9176287ae60d9b61"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a>   1000</td></tr>
|
|
<tr class="separator:a001791a21d538b8b9176287ae60d9b61"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:af9729befaffc1aab9ac9fedc4706e66c"><td class="memItemLeft" align="right" valign="top">unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c">add_numbers</a> (unsigned char *a, unsigned char *b, unsigned char *c, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
|
<tr class="separator:af9729befaffc1aab9ac9fedc4706e66c"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:abe5bc1f170b2108a19d0a16d30bd3235"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235">print_number</a> (unsigned char *number, int <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
|
<tr class="separator:abe5bc1f170b2108a19d0a16d30bd3235"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a2b90df6bfbf0d18cd9a19c1a71453783"><td class="memItemLeft" align="right" valign="top">unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783">get_digits</a> (unsigned char *number)</td></tr>
|
|
<tr class="separator:a2b90df6bfbf0d18cd9a19c1a71453783"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
|
|
<tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><td class="memSeparator" colspan="2"> </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=25">Problem 25</a> solution implemented using arbitrarily large numbers represented as arrays </p>
|
|
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala">Krishna Vedala</a> </dd></dl>
|
|
</div><h2 class="groupheader">Macro Definition Documentation</h2>
|
|
<a id="a001791a21d538b8b9176287ae60d9b61"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a001791a21d538b8b9176287ae60d9b61">◆ </a></span>MAX_DIGITS</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">#define MAX_DIGITS   1000</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>maximum number of digits </p>
|
|
|
|
</div>
|
|
</div>
|
|
<h2 class="groupheader">Function Documentation</h2>
|
|
<a id="af9729befaffc1aab9ac9fedc4706e66c"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#af9729befaffc1aab9ac9fedc4706e66c">◆ </a></span>add_numbers()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">unsigned int add_numbers </td>
|
|
<td>(</td>
|
|
<td class="paramtype">unsigned char * </td>
|
|
<td class="paramname"><em>a</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">unsigned char * </td>
|
|
<td class="paramname"><em>b</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">unsigned char * </td>
|
|
<td class="paramname"><em>c</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int </td>
|
|
<td class="paramname"><em>N</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Function to add arbitraty length decimal integers stored in an array.<br />
|
|
a + b = c = new b </p>
|
|
<div class="fragment"><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> {</div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> carry = 0;</div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i;</div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  </div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="keywordflow">for</span> (i = 0; i < <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  {</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="comment">// printf("\t%d + %d + %d ", a[i], b[i], carry);</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  c[i] = carry + a[i] + b[i];</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keywordflow">if</span> (c[i] > 9) <span class="comment">/* check for carry */</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  {</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  carry = 1;</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  c[i] -= 10;</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  }</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">else</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  carry = 0;</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="comment">// printf("= %d, %d\n", carry, c[i]);</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  }</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  </div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">while</span> (carry != 0)</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  {</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">// printf("\t\t...adding new digit\n");</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// printf("\t0 + %d + %d ", b[i], carry);</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  c[i] = carry + c[i];</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">if</span> (c[i] > 9)</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  {</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  carry = 1;</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  c[i] -= 10;</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  }</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">else</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  carry = 0;</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// printf("= %d, %d\n", carry, c[i]);</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  i++;</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  }</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">return</span> i;</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a2b90df6bfbf0d18cd9a19c1a71453783"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a2b90df6bfbf0d18cd9a19c1a71453783">◆ </a></span>get_digits()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">unsigned int get_digits </td>
|
|
<td>(</td>
|
|
<td class="paramtype">unsigned char * </td>
|
|
<td class="paramname"><em>number</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Get number of digits in a large number </p>
|
|
<div class="fragment"><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> {</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> digits = <a class="code" href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a>;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">while</span> (number[digits] == 0)</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  digits--;</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">return</span> digits;</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a0ddf1224851353fc92bfbff6f499fa97"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">◆ </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">int </td>
|
|
<td class="paramname"><em>argc</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">char * </td>
|
|
<td class="paramname"><em>argv</em>[] </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Main function </p>
|
|
<div class="fragment"><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> {</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  fn[<a class="code" href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a> + 1]; <span class="comment">/* array to store digits of a large number */</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> fn1[<a class="code" href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a> + 1];</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> sum[<a class="code" href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a> + 1];</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  </div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  memset(fn, 0, <a class="code" href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a>);</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  memset(fn1, 0, <a class="code" href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a>);</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  memset(sum, 0, <a class="code" href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a>);</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  </div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  fn[0] = 1;</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  fn1[1] = 1;</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  </div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> index = 1, digit_count = 1;</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  </div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  clock_t start_time = clock();</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">do</span></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  {</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  digit_count = <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#ad51742ca5a5c99e860bdf30299163bf2">add_numbers</a>(fn, fn1, sum, digit_count);</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// digit_count = get_digits(sum);</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  </div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// printf("%5u (%u) (%u) ", index, digit_count, get_digits(sum));</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// print_number(sum, digit_count);</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// putchar('\n');</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  </div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">if</span> (digit_count == <a class="code" href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a>)</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  memcpy(fn, fn1, <a class="code" href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a>);</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  memcpy(fn1, sum, <a class="code" href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a>);</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  index++;</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  } <span class="keywordflow">while</span> (digit_count < <a class="code" href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a>);</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  clock_t end_time = clock();</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  </div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  printf(<span class="stringliteral">"Time taken: %.4g ms\n"</span>,</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  1e3 * (end_time - start_time) / CLOCKS_PER_SEC);</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  printf(<span class="stringliteral">"The nth term for %d digits: %u \n"</span>, <a class="code" href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a>, index--);</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a248adc917818cc6666d8bc679a660319">print_number</a>(sum, digit_count);</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  </div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> }</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="../../d8/d32/problem__25_2sol1_8c_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="210" height="88"><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="abe5bc1f170b2108a19d0a16d30bd3235"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#abe5bc1f170b2108a19d0a16d30bd3235">◆ </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">unsigned char * </td>
|
|
<td class="paramname"><em>number</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int </td>
|
|
<td class="paramname"><em>N</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Print a large number </p>
|
|
<div class="fragment"><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> {</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordtype">int</span> start_pos = <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> - 1;</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  </div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">/* skip all initial zeros */</span></div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">while</span> (number[start_pos] == 0)</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  start_pos--;</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  </div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = start_pos; i >= 0; i--)</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  putchar(number[i] + 0x30);</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  </div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="aproblem__13_2sol1_8c_html_a0240ac851181b84ac374872dc5434ee4"><div class="ttname"><a href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a></div><div class="ttdeci">#define N</div><div class="ttdef"><b>Definition:</b> sol1.c:111</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="ttdef"><b>Definition:</b> sol1.c:44</div></div>
|
|
<div class="ttc" id="aproblem__25_2sol1_8c_html_a001791a21d538b8b9176287ae60d9b61"><div class="ttname"><a href="../../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61">MAX_DIGITS</a></div><div class="ttdeci">#define MAX_DIGITS</div><div class="ttdef"><b>Definition:</b> sol1.c:13</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="ttdef"><b>Definition:</b> sol1.c:82</div></div>
|
|
<!-- 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_079e1f799fb08a8a0b98cb030ab15687.html">problem_25</a></li><li class="navelem"><a class="el" href="../../d8/d32/problem__25_2sol1_8c.html">sol1.c</a></li>
|
|
<li class="footer">Generated on Sun Jun 28 2020 15:07:07 for Algorithms_in_C by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|