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
gh-pages
TheAlgorithms-C/d1/df9/problem__26_2sol1_8c.html
github-actions cfa7262f7d Documentation for db3d6e2886
2023-09-08 21:40:54 +00:00

374 lines
29 KiB
HTML
Raw Permalink 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.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C: project_euler/problem_26/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.8 -->
<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('d1/df9/problem__26_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="#define-members">Macros</a> &#124;
<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=26" target="_blank">Problem 26</a> solution
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;stdio.h&gt;</code><br />
<code>#include &lt;stdlib.h&gt;</code><br />
<code>#include &lt;string.h&gt;</code><br />
<code>#include &lt;time.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/dd8/problem__26_2sol1_8c__incl.svg" width="328" height="126"><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="define-members" name="define-members"></a>
Macros</h2></td></tr>
<tr class="memitem:a619eec3220cebd7c5e455edbb14e9b12" id="r_a619eec3220cebd7c5e455edbb14e9b12"><td class="memItemLeft" align="right" valign="top"><a id="a619eec3220cebd7c5e455edbb14e9b12" name="a619eec3220cebd7c5e455edbb14e9b12"></a>
#define&#160;</td><td class="memItemRight" valign="bottom"><b>MAX_DENO</b>&#160;&#160;&#160;2000</td></tr>
<tr class="memdesc:a619eec3220cebd7c5e455edbb14e9b12"><td class="mdescLeft">&#160;</td><td class="mdescRight">limit of unit fractions <br /></td></tr>
<tr class="separator:a619eec3220cebd7c5e455edbb14e9b12"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aabf4f709c8199e41cf279c77112345fe" id="r_aabf4f709c8199e41cf279c77112345fe"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">MAX_LEN</a>&#160;&#160;&#160; (<a class="el" href="../../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12">MAX_DENO</a> + 10)</td></tr>
<tr class="memdesc:aabf4f709c8199e41cf279c77112345fe"><td class="mdescLeft">&#160;</td><td class="mdescRight">length of resulting recurring fraction number <br /></td></tr>
<tr class="separator:aabf4f709c8199e41cf279c77112345fe"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><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:ac70138609ef6aa6fabca57aca8681e83" id="r_ac70138609ef6aa6fabca57aca8681e83"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83">compare</a> (const void *a, const void *b)</td></tr>
<tr class="memdesc:ac70138609ef6aa6fabca57aca8681e83"><td class="mdescLeft">&#160;</td><td class="mdescRight">comparison function for use with internal <code>qsort</code> algorithm <br /></td></tr>
<tr class="separator:ac70138609ef6aa6fabca57aca8681e83"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97" id="r_a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/df9/problem__26_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
<tr class="memdesc:a0ddf1224851353fc92bfbff6f499fa97"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><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=26" target="_blank">Problem 26</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">Macro Definition Documentation</h2>
<a id="aabf4f709c8199e41cf279c77112345fe" name="aabf4f709c8199e41cf279c77112345fe"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aabf4f709c8199e41cf279c77112345fe">&#9670;&#160;</a></span>MAX_LEN</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">#define MAX_LEN&#160;&#160;&#160; (<a class="el" href="../../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12">MAX_DENO</a> + 10)</td>
</tr>
</table>
</div><div class="memdoc">
<p>length of resulting recurring fraction number </p>
<div class="fragment"><div class="line"><span class="lineno"> 19</span>{</div>
<div class="line"><span class="lineno"> 20</span> <span class="keywordflow">return</span> (*(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> *)a - *(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> *)b);</div>
<div class="line"><span class="lineno"> 21</span>}</div>
<div class="line"><span class="lineno"> 22</span><span class="comment"></span> </div>
<div class="line"><span class="lineno"> 23</span><span class="comment">/** Main function */</span></div>
<div class="line"><span class="lineno"> 24</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d35/problem__1_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[])</div>
<div class="line"><span class="lineno"> 25</span>{</div>
<div class="line"><span class="lineno"> 26</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> max_digits = 0, max_idx_number = 0;</div>
<div class="line"><span class="lineno"> 27</span> </div>
<div class="line"><span class="lineno"> 28</span> clock_t start_time = clock();</div>
<div class="line"><span class="lineno"> 29</span> <span class="keywordtype">short</span> deno;</div>
<div class="line"><span class="lineno"> 30</span><span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><span class="lineno"> 31</span><span class="preprocessor">#pragma omp for</span></div>
<div class="line"><span class="lineno"> 32</span><span class="preprocessor">#endif</span></div>
<div class="line"><span class="lineno"> 33</span> <span class="keywordflow">for</span> (deno = 2; deno &lt; <a class="code hl_define" href="../../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12">MAX_DENO</a>; deno++)</div>
<div class="line"><span class="lineno"> 34</span> {</div>
<div class="line"><span class="lineno"> 35</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> remainders[<a class="code hl_define" href="../../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">MAX_LEN</a>];</div>
<div class="line"><span class="lineno"> 36</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> rem = 1, *rem_ptr = remainders;</div>
<div class="line"><span class="lineno"> 37</span> memset(remainders, (<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>)-1,</div>
<div class="line"><span class="lineno"> 38</span> <a class="code hl_define" href="../../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">MAX_LEN</a> * <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>));</div>
<div class="line"><span class="lineno"> 39</span> <span class="comment">// remainders[0] = 1;</span></div>
<div class="line"><span class="lineno"> 40</span> <span class="comment">// printf(&quot;1/%-4u\t &quot;, deno);</span></div>
<div class="line"><span class="lineno"> 41</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> index = 0, num_digits;</div>
<div class="line"><span class="lineno"> 42</span> </div>
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">while</span> (rem != 0)</div>
<div class="line"><span class="lineno"> 44</span> {</div>
<div class="line"><span class="lineno"> 45</span> rem = (rem * 10) % deno;</div>
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span> (rem == 0)</div>
<div class="line"><span class="lineno"> 47</span> {</div>
<div class="line"><span class="lineno"> 48</span> index = 0;</div>
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 50</span> }</div>
<div class="line"><span class="lineno"> 51</span> rem_ptr = (<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> *)bsearch(</div>
<div class="line"><span class="lineno"> 52</span> &amp;rem, remainders, <a class="code hl_define" href="../../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">MAX_LEN</a>, <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>), <a class="code hl_function" href="../../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83">compare</a>);</div>
<div class="line"><span class="lineno"> 53</span> <span class="comment">// printf(&quot;%2d, &quot;, rem);</span></div>
<div class="line"><span class="lineno"> 54</span> <span class="comment">// printf(&quot;(%14p), &quot;, rem_ptr);</span></div>
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">if</span> (rem_ptr != NULL)</div>
<div class="line"><span class="lineno"> 56</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 57</span> remainders[index] = rem;</div>
<div class="line"><span class="lineno"> 58</span> rem_ptr = remainders;</div>
<div class="line"><span class="lineno"> 59</span> index++;</div>
<div class="line"><span class="lineno"> 60</span> }</div>
<div class="line"><span class="lineno"> 61</span> </div>
<div class="line"><span class="lineno"> 62</span> num_digits = index - (rem_ptr - remainders);</div>
<div class="line"><span class="lineno"> 63</span> <span class="comment">// printf(&quot;\n\t(%14p, %14p, %4u, %4u)\n&quot;, rem_ptr, remainders, index,</span></div>
<div class="line"><span class="lineno"> 64</span> <span class="comment">// num_digits);</span></div>
<div class="line"><span class="lineno"> 65</span><span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><span class="lineno"> 66</span><span class="preprocessor">#pragma omp critical</span></div>
<div class="line"><span class="lineno"> 67</span> {</div>
<div class="line"><span class="lineno"> 68</span><span class="preprocessor">#endif</span></div>
<div class="line"><span class="lineno"> 69</span> <span class="keywordflow">if</span> (num_digits &gt; max_digits)</div>
<div class="line"><span class="lineno"> 70</span> {</div>
<div class="line"><span class="lineno"> 71</span> max_digits = num_digits;</div>
<div class="line"><span class="lineno"> 72</span> max_idx_number = deno;</div>
<div class="line"><span class="lineno"> 73</span> <span class="comment">// printf(&quot;\t (%u, %u)\n &quot;, max_digits, max_idx_number);</span></div>
<div class="line"><span class="lineno"> 74</span> }</div>
<div class="line"><span class="lineno"> 75</span><span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><span class="lineno"> 76</span> }</div>
<div class="line"><span class="lineno"> 77</span><span class="preprocessor">#endif</span></div>
<div class="line"><span class="lineno"> 78</span> }</div>
<div class="line"><span class="lineno"> 79</span> clock_t end_time = clock();</div>
<div class="line"><span class="lineno"> 80</span> </div>
<div class="line"><span class="lineno"> 81</span> printf(<span class="stringliteral">&quot;Time taken: %.4g ms\n&quot;</span>,</div>
<div class="line"><span class="lineno"> 82</span> 1e3 * (<span class="keywordtype">double</span>)(end_time - start_time) / CLOCKS_PER_SEC);</div>
<div class="line"><span class="lineno"> 83</span> printf(<span class="stringliteral">&quot;Maximum digits: %hu\t Denominator: %hu\n&quot;</span>, max_digits,</div>
<div class="line"><span class="lineno"> 84</span> max_idx_number);</div>
<div class="line"><span class="lineno"> 85</span> </div>
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 87</span>}</div>
<div class="ttc" id="aproblem__1_2sol1_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d35/problem__1_2sol1_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> sol1.c:12</div></div>
<div class="ttc" id="aproblem__26_2sol1_8c_html_a619eec3220cebd7c5e455edbb14e9b12"><div class="ttname"><a href="../../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12">MAX_DENO</a></div><div class="ttdeci">#define MAX_DENO</div><div class="ttdoc">limit of unit fractions</div><div class="ttdef"><b>Definition</b> sol1.c:14</div></div>
<div class="ttc" id="aproblem__26_2sol1_8c_html_aabf4f709c8199e41cf279c77112345fe"><div class="ttname"><a href="../../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">MAX_LEN</a></div><div class="ttdeci">#define MAX_LEN</div><div class="ttdoc">length of resulting recurring fraction number</div><div class="ttdef"><b>Definition</b> sol1.c:15</div></div>
<div class="ttc" id="aproblem__26_2sol1_8c_html_ac70138609ef6aa6fabca57aca8681e83"><div class="ttname"><a href="../../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdoc">comparison function for use with internal qsort algorithm</div><div class="ttdef"><b>Definition</b> sol1.c:19</div></div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Function Documentation</h2>
<a id="ac70138609ef6aa6fabca57aca8681e83" name="ac70138609ef6aa6fabca57aca8681e83"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac70138609ef6aa6fabca57aca8681e83">&#9670;&#160;</a></span>compare()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int compare </td>
<td>(</td>
<td class="paramtype">const void *&#160;</td>
<td class="paramname"><em>a</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const void *&#160;</td>
<td class="paramname"><em>b</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>comparison function for use with internal <code>qsort</code> algorithm </p>
<div class="fragment"><div class="line"><span class="lineno"> 20</span>{</div>
<div class="line"><span class="lineno"> 21</span> <span class="keywordflow">return</span> (*(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> *)a - *(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> *)b);</div>
<div class="line"><span class="lineno"> 22</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#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">int&#160;</td>
<td class="paramname"><em>argc</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">char *&#160;</td>
<td class="paramname"><em>argv</em>[]&#160;</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"><span class="lineno"> 26</span>{</div>
<div class="line"><span class="lineno"> 27</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> max_digits = 0, max_idx_number = 0;</div>
<div class="line"><span class="lineno"> 28</span> </div>
<div class="line"><span class="lineno"> 29</span> clock_t start_time = clock();</div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordtype">short</span> deno;</div>
<div class="line"><span class="lineno"> 31</span><span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><span class="lineno"> 32</span><span class="preprocessor">#pragma omp for</span></div>
<div class="line"><span class="lineno"> 33</span><span class="preprocessor">#endif</span></div>
<div class="line"><span class="lineno"> 34</span> <span class="keywordflow">for</span> (deno = 2; deno &lt; <a class="code hl_define" href="../../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12">MAX_DENO</a>; deno++)</div>
<div class="line"><span class="lineno"> 35</span> {</div>
<div class="line"><span class="lineno"> 36</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> remainders[<a class="code hl_define" href="../../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">MAX_LEN</a>];</div>
<div class="line"><span class="lineno"> 37</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> rem = 1, *rem_ptr = remainders;</div>
<div class="line"><span class="lineno"> 38</span> memset(remainders, (<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>)-1,</div>
<div class="line"><span class="lineno"> 39</span> <a class="code hl_define" href="../../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">MAX_LEN</a> * <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>));</div>
<div class="line"><span class="lineno"> 40</span> <span class="comment">// remainders[0] = 1;</span></div>
<div class="line"><span class="lineno"> 41</span> <span class="comment">// printf(&quot;1/%-4u\t &quot;, deno);</span></div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> index = 0, num_digits;</div>
<div class="line"><span class="lineno"> 43</span> </div>
<div class="line"><span class="lineno"> 44</span> <span class="keywordflow">while</span> (rem != 0)</div>
<div class="line"><span class="lineno"> 45</span> {</div>
<div class="line"><span class="lineno"> 46</span> rem = (rem * 10) % deno;</div>
<div class="line"><span class="lineno"> 47</span> <span class="keywordflow">if</span> (rem == 0)</div>
<div class="line"><span class="lineno"> 48</span> {</div>
<div class="line"><span class="lineno"> 49</span> index = 0;</div>
<div class="line"><span class="lineno"> 50</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 51</span> }</div>
<div class="line"><span class="lineno"> 52</span> rem_ptr = (<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> *)bsearch(</div>
<div class="line"><span class="lineno"> 53</span> &amp;rem, remainders, <a class="code hl_define" href="../../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">MAX_LEN</a>, <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>), <a class="code hl_function" href="../../d1/df9/problem__26_2sol1_8c.html#ac70138609ef6aa6fabca57aca8681e83">compare</a>);</div>
<div class="line"><span class="lineno"> 54</span> <span class="comment">// printf(&quot;%2d, &quot;, rem);</span></div>
<div class="line"><span class="lineno"> 55</span> <span class="comment">// printf(&quot;(%14p), &quot;, rem_ptr);</span></div>
<div class="line"><span class="lineno"> 56</span> <span class="keywordflow">if</span> (rem_ptr != NULL)</div>
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 58</span> remainders[index] = rem;</div>
<div class="line"><span class="lineno"> 59</span> rem_ptr = remainders;</div>
<div class="line"><span class="lineno"> 60</span> index++;</div>
<div class="line"><span class="lineno"> 61</span> }</div>
<div class="line"><span class="lineno"> 62</span> </div>
<div class="line"><span class="lineno"> 63</span> num_digits = index - (rem_ptr - remainders);</div>
<div class="line"><span class="lineno"> 64</span> <span class="comment">// printf(&quot;\n\t(%14p, %14p, %4u, %4u)\n&quot;, rem_ptr, remainders, index,</span></div>
<div class="line"><span class="lineno"> 65</span> <span class="comment">// num_digits);</span></div>
<div class="line"><span class="lineno"> 66</span><span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><span class="lineno"> 67</span><span class="preprocessor">#pragma omp critical</span></div>
<div class="line"><span class="lineno"> 68</span> {</div>
<div class="line"><span class="lineno"> 69</span><span class="preprocessor">#endif</span></div>
<div class="line"><span class="lineno"> 70</span> <span class="keywordflow">if</span> (num_digits &gt; max_digits)</div>
<div class="line"><span class="lineno"> 71</span> {</div>
<div class="line"><span class="lineno"> 72</span> max_digits = num_digits;</div>
<div class="line"><span class="lineno"> 73</span> max_idx_number = deno;</div>
<div class="line"><span class="lineno"> 74</span> <span class="comment">// printf(&quot;\t (%u, %u)\n &quot;, max_digits, max_idx_number);</span></div>
<div class="line"><span class="lineno"> 75</span> }</div>
<div class="line"><span class="lineno"> 76</span><span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><span class="lineno"> 77</span> }</div>
<div class="line"><span class="lineno"> 78</span><span class="preprocessor">#endif</span></div>
<div class="line"><span class="lineno"> 79</span> }</div>
<div class="line"><span class="lineno"> 80</span> clock_t end_time = clock();</div>
<div class="line"><span class="lineno"> 81</span> </div>
<div class="line"><span class="lineno"> 82</span> printf(<span class="stringliteral">&quot;Time taken: %.4g ms\n&quot;</span>,</div>
<div class="line"><span class="lineno"> 83</span> 1e3 * (<span class="keywordtype">double</span>)(end_time - start_time) / CLOCKS_PER_SEC);</div>
<div class="line"><span class="lineno"> 84</span> printf(<span class="stringliteral">&quot;Maximum digits: %hu\t Denominator: %hu\n&quot;</span>, max_digits,</div>
<div class="line"><span class="lineno"> 85</span> max_idx_number);</div>
<div class="line"><span class="lineno"> 86</span> </div>
<div class="line"><span class="lineno"> 87</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 88</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="../../d1/df9/problem__26_2sol1_8c_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</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_16e00c78ef36d1842d0d8a4afc46b852.html">problem_26</a></li><li class="navelem"><a class="el" href="../../d1/df9/problem__26_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.8 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink