mirror of
https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git
synced 2023-10-11 15:56:24 +08:00
458 lines
39 KiB
HTML
458 lines
39 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_23/sol2.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('d4/dbd/problem__23_2sol2_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="#func-members">Functions</a> |
|
|
<a href="#var-members">Variables</a> </div>
|
|
<div class="headertitle">
|
|
<div class="title">sol2.c File Reference</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p><a href="https://projecteuler.net/problem=23">Problem 23</a> solution - optimization using look-up array
|
|
<a href="#details">More...</a></p>
|
|
<div class="textblock"><code>#include <stdio.h></code><br />
|
|
<code>#include <stdlib.h></code><br />
|
|
<code>#include <time.h></code><br />
|
|
</div><div class="textblock"><div class="dynheader">
|
|
Include dependency graph for sol2.c:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d23/problem__23_2sol2_8c__incl.svg" width="243" 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="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:a1aca7f530f82b27100262adba9e7556b"><td class="memItemLeft" align="right" valign="top">char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
|
<tr class="separator:a1aca7f530f82b27100262adba9e7556b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a34f4ad85151e3a43368ae67f42347f56"><td class="memItemLeft" align="right" valign="top">char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56">is_abundant</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
|
<tr class="separator:a34f4ad85151e3a43368ae67f42347f56"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ac5d600bf3077f4188afc4c5cd2c40eaf"><td class="memItemLeft" align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
|
<tr class="separator:ac5d600bf3077f4188afc4c5cd2c40eaf"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a3ab61b5a1c4f2288625d160aa0ea8478"><td class="memItemLeft" align="right" valign="top">char </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
|
<tr class="separator:a3ab61b5a1c4f2288625d160aa0ea8478"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a> (int argc, char **argv)</td></tr>
|
|
<tr class="separator:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a>
|
|
Variables</h2></td></tr>
|
|
<tr class="memitem:a8c7ddb39906f281b801f2cd58d416c2b"><td class="memItemLeft" align="right" valign="top">long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">MAX_N</a> = 28123</td></tr>
|
|
<tr class="separator:a8c7ddb39906f281b801f2cd58d416c2b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:af920a16d6ef69dd604b283f427892e06"><td class="memItemLeft" align="right" valign="top">char * </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06">abundant_flags</a> = NULL</td></tr>
|
|
<tr class="separator:af920a16d6ef69dd604b283f427892e06"><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=23">Problem 23</a> solution - optimization using look-up array </p>
|
|
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala">Krishna Vedala</a></dd></dl>
|
|
<p>Optimization applied - compute & store abundant numbers once into a look-up array. </p>
|
|
</div><h2 class="groupheader">Function Documentation</h2>
|
|
<a id="ac5d600bf3077f4188afc4c5cd2c40eaf"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ac5d600bf3077f4188afc4c5cd2c40eaf">◆ </a></span>get_next_abundant()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">unsigned long get_next_abundant </td>
|
|
<td>(</td>
|
|
<td class="paramtype">unsigned long </td>
|
|
<td class="paramname"><em>N</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Find the next abundant number after N and not including N </p>
|
|
<div class="fragment"><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> {</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i;</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">/* keep checking successive numbers till an abundant number is found */</span></div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">for</span> (i = <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> + 1; !<a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56">is_abundant</a>(i); ++i)</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  ;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">return</span> i;</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</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="../../d4/dbd/problem__23_2sol2_8c_ac5d600bf3077f4188afc4c5cd2c40eaf_cgraph.svg" width="283" height="38"><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="a1aca7f530f82b27100262adba9e7556b"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a1aca7f530f82b27100262adba9e7556b">◆ </a></span>get_perfect_number()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">char get_perfect_number </td>
|
|
<td>(</td>
|
|
<td class="paramtype">unsigned long </td>
|
|
<td class="paramname"><em>N</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<dl class="section return"><dt>Returns</dt><dd>-1 if N is deficient </dd>
|
|
<dd>
|
|
1 if N is abundant </dd>
|
|
<dd>
|
|
0 if N is perfect </dd></dl>
|
|
<div class="fragment"><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> {</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> sum = 1;</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordtype">char</span> ret = 0;</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>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i = 2; i * i <= <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>; i++)</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  {</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordflow">if</span> (<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> % i == 0)</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  {</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  sum += i;</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> tmp = <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> / i;</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">if</span> (tmp != i)</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  sum += tmp;</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  }</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  }</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>  ret = sum == <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> ? 0 : (sum > <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> ? 1 : -1);</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor">#ifdef DEBUG</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  printf(<span class="stringliteral">"%5lu: %5lu : %d\n"</span>, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>, sum, ret);</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">return</span> ret;</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a34f4ad85151e3a43368ae67f42347f56"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a34f4ad85151e3a43368ae67f42347f56">◆ </a></span>is_abundant()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">char is_abundant </td>
|
|
<td>(</td>
|
|
<td class="paramtype">unsigned long </td>
|
|
<td class="paramname"><em>N</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Is the given number an abundant number (1) or not (0) </p>
|
|
<div class="fragment"><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> {</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// return abundant_flags[N >> 3] & (1 << N % 8) ? 1 : 0;</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">return</span> <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06">abundant_flags</a>[<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> >> 3] & (1 << (<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> & 7))</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  ? 1</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  : 0; <span class="comment">/* optimized modulo operation */</span></div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a3ab61b5a1c4f2288625d160aa0ea8478"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a3ab61b5a1c4f2288625d160aa0ea8478">◆ </a></span>is_sum_of_abundant()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">char is_sum_of_abundant </td>
|
|
<td>(</td>
|
|
<td class="paramtype">unsigned long </td>
|
|
<td class="paramname"><em>N</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>check if a given number can be represented as a sum of two abundant numbers. </p><dl class="section return"><dt>Returns</dt><dd>1 - if yes </dd>
|
|
<dd>
|
|
0 - if not </dd></dl>
|
|
<p>optimized logic: i + j = N where both i and j should be abundant hence we can simply check for j = N - i as we loop through i</p>
|
|
<div class="fragment"><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> {<span class="comment"></span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> /** optimized logic:</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> * i + j = N where both i and j should be abundant</span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> * hence we can simply check for j = N - i as we loop through i</span></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> **/</span></div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i = <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a>(1); i <= (<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> >> 1);</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  i = <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a>(i))</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56">is_abundant</a>(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> - i))</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  {</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="preprocessor">#ifdef DEBUG</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  printf(<span class="stringliteral">"\t%4lu + %4lu = %4lu\n"</span>, i, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> - i, <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>);</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">return</span> 1;</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  }</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</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="../../d4/dbd/problem__23_2sol2_8c_a3ab61b5a1c4f2288625d160aa0ea8478_cgraph.svg" width="474" height="63"><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="a3c04138a5bfe5d72780bb7e82a18e627"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a3c04138a5bfe5d72780bb7e82a18e627">◆ </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>
|
|
<p>byte array to store flags to identify abundant numbers the flags are identified by bits</p>
|
|
<div class="fragment"><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> {</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> sum = 0;</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">if</span> (argc == 2)</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">MAX_N</a> = strtoul(argv[1], NULL, 10);</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"></span> </div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> /** byte array to store flags to identify abundant numbers</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> * the flags are identified by bits</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> **/</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06">abundant_flags</a> = (<span class="keywordtype">char</span> *)calloc(<a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">MAX_N</a> >> 3, 1);</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06">abundant_flags</a>)</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>  perror(<span class="stringliteral">"Unable to allocate memoey!"</span>);</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  </div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  printf(<span class="stringliteral">"Using OpenMP parallleization with %d threads\n"</span>,</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  omp_get_max_threads());</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="preprocessor">#else</span></div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  printf(<span class="stringliteral">"Not using parallleization!\n"</span>);</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  </div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  clock_t start_time = clock();</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  </div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">/* Loop to set abundant flags */</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordtype">long</span> <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>;</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="preprocessor">#pragma omp for schedule(runtime)</span></div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">for</span> (<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> = 1; <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> <= <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">MAX_N</a>; <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>++)</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  {</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordtype">char</span> ret = <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a>(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>);</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">if</span> (ret == 1)</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  {</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// int byte_offset = N % 8, index = N >> 3;</span></div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordtype">int</span> byte_offset = <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> & 7, index = <a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> >> 3;</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="preprocessor">#pragma omp critical</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06">abundant_flags</a>[index] |= ret << byte_offset;</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// if (i % 100 == 0)</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// printf("... %5lu: %8lu\r", i, sum);</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  }</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  </div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  clock_t end_time = clock();</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordtype">double</span> t1 = 1e3 * (end_time - start_time) / CLOCKS_PER_SEC;</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  printf(<span class="stringliteral">"Time taken to get abundant numbers: %.4g ms\n"</span>, t1);</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  </div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  clock_t t2 = 0;</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordtype">long</span> i;</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="preprocessor">#pragma omp parallel for schedule(runtime) reduction(+ : sum)</span></div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">for</span> (i = 1; i < <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">MAX_N</a>; i++)</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  {</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  clock_t start_time1 = clock();</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a>(i))</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// #ifdef _OPENMP</span></div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="comment">// #pragma omp critical</span></div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="comment">// #endif</span></div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  sum += i;</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  clock_t end_time1 = clock();</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="preprocessor">#pragma omp critical</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  t2 += end_time1 - start_time1;</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  </div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  printf(<span class="stringliteral">"... %5lu: %8lu\r"</span>, i, sum);</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">if</span> (i % 100 == 0)</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  fflush(stdout);</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  }</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="preprocessor">#ifdef DEBUG</span></div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  putchar(<span class="charliteral">'\n'</span>);</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="preprocessor">#endif</span></div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordtype">double</span> t22 = 1e3 * t2 / CLOCKS_PER_SEC;</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  printf(<span class="stringliteral">"Time taken for final sum: %.4g ms\nTotal Time taken: %.4g ms\n"</span>,</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  t22, t1 + t22);</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  printf(<span class="stringliteral">"Memory used: %lu bytes\n"</span>, <a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">MAX_N</a> >> 3);</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  printf(<span class="stringliteral">"Sum of numbers that cannot be represented as sum of two abundant "</span></div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="stringliteral">"numbers : %lu\n"</span>,</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  sum);</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  </div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  free(<a class="code" href="../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06">abundant_flags</a>);</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  </div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</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="../../d4/dbd/problem__23_2sol2_8c_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg" width="572" 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>
|
|
<h2 class="groupheader">Variable Documentation</h2>
|
|
<a id="af920a16d6ef69dd604b283f427892e06"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#af920a16d6ef69dd604b283f427892e06">◆ </a></span>abundant_flags</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">char* abundant_flags = NULL</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>This is the global array to be used to store a flag to identify if a particular number is abundant (1) or not (0). Using a whole byte to store a binary info would be redundant. We will use each byte to represent 8 numbers by relying on bits. This saves memory required by 1/8 </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a8c7ddb39906f281b801f2cd58d416c2b"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a8c7ddb39906f281b801f2cd58d416c2b">◆ </a></span>MAX_N</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">long MAX_N = 28123</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Limit of numbers to check </p>
|
|
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="aproblem__23_2sol2_8c_html_a1aca7f530f82b27100262adba9e7556b"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a></div><div class="ttdeci">char get_perfect_number(unsigned long N)</div><div class="ttdef"><b>Definition:</b> sol2.c:33</div></div>
|
|
<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__23_2sol2_8c_html_ac5d600bf3077f4188afc4c5cd2c40eaf"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a></div><div class="ttdeci">unsigned long get_next_abundant(unsigned long N)</div><div class="ttdef"><b>Definition:</b> sol2.c:70</div></div>
|
|
<div class="ttc" id="aproblem__23_2sol2_8c_html_a34f4ad85151e3a43368ae67f42347f56"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56">is_abundant</a></div><div class="ttdeci">char is_abundant(unsigned long N)</div><div class="ttdef"><b>Definition:</b> sol2.c:59</div></div>
|
|
<div class="ttc" id="aproblem__23_2sol2_8c_html_a3ab61b5a1c4f2288625d160aa0ea8478"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a></div><div class="ttdeci">char is_sum_of_abundant(unsigned long N)</div><div class="ttdef"><b>Definition:</b> sol2.c:85</div></div>
|
|
<div class="ttc" id="aproblem__23_2sol2_8c_html_a8c7ddb39906f281b801f2cd58d416c2b"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#a8c7ddb39906f281b801f2cd58d416c2b">MAX_N</a></div><div class="ttdeci">long MAX_N</div><div class="ttdef"><b>Definition:</b> sol2.c:17</div></div>
|
|
<div class="ttc" id="aproblem__23_2sol2_8c_html_af920a16d6ef69dd604b283f427892e06"><div class="ttname"><a href="../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06">abundant_flags</a></div><div class="ttdeci">char * abundant_flags</div><div class="ttdef"><b>Definition:</b> sol2.c:26</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_f75ccd45e00436eafed446b9b2682984.html">problem_23</a></li><li class="navelem"><a class="el" href="../../d4/dbd/problem__23_2sol2_8c.html">sol2.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>
|