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
de2b6116d1
TheAlgorithms-C/d7/ddb/problem__23_2sol1_8c.html

383 lines
29 KiB
HTML
Raw Normal View History

Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
<!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"/>
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.2"/>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C: project_euler/problem_23/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">
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
});
</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;">
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<div id="projectname">Algorithms_in_C<span id="projectnumber">&#160;1.0.0</span>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
</div>
<div id="projectbrief">Set of algorithms implemented in C.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<!-- Generated by Doxygen 1.9.2 -->
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
<script type="text/javascript">
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
/* @license-end */
</script>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
<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">
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
$(document).ready(function(){initNavTree('d7/ddb/problem__23_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">
Documentation for 5d9bf078514f3b5dd913100f10fe56f050f005d7
2020-07-17 04:36:47 +08:00
<a href="#func-members">Functions</a> </div>
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<div class="headertitle"><div class="title">sol1.c File Reference</div></div>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
</div><!--header-->
<div class="contents">
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<p><a href="https://projecteuler.net/problem=23" target="_blank">Problem 23</a> solution
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
<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;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="../../d4/d89/problem__23_2sol1_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">
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
Functions</h2></td></tr>
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<tr class="memitem:a1aca7f530f82b27100262adba9e7556b"><td class="memItemLeft" align="right" valign="top">char&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a> (unsigned long N)</td></tr>
<tr class="memdesc:a1aca7f530f82b27100262adba9e7556b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns: -1 if N is deficient 1 if N is abundant 0 if N is perfect. <a href="../../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b">More...</a><br /></td></tr>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
<tr class="separator:a1aca7f530f82b27100262adba9e7556b"><td class="memSeparator" colspan="2">&#160;</td></tr>
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<tr class="memitem:a4f128410e6582fe26488e2316cc96e17"><td class="memItemLeft" align="right" valign="top">unsigned long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a> (unsigned long N)</td></tr>
<tr class="memdesc:a4f128410e6582fe26488e2316cc96e17"><td class="mdescLeft">&#160;</td><td class="mdescRight">Is the given number an abundant number (1) or not (0) <a href="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">More...</a><br /></td></tr>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
<tr class="separator:a4f128410e6582fe26488e2316cc96e17"><td class="memSeparator" colspan="2">&#160;</td></tr>
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<tr class="memitem:ac5d600bf3077f4188afc4c5cd2c40eaf"><td class="memItemLeft" align="right" valign="top">unsigned long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a> (unsigned long N)</td></tr>
<tr class="memdesc:ac5d600bf3077f4188afc4c5cd2c40eaf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find the next abundant number after N and not including N. <a href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">More...</a><br /></td></tr>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
<tr class="separator:ac5d600bf3077f4188afc4c5cd2c40eaf"><td class="memSeparator" colspan="2">&#160;</td></tr>
Documentation for 5d9bf078514f3b5dd913100f10fe56f050f005d7
2020-07-17 04:36:47 +08:00
<tr class="memitem:a3ab61b5a1c4f2288625d160aa0ea8478"><td class="memItemLeft" align="right" valign="top">char&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a> (unsigned long N)</td></tr>
Documentation for 8914128e137073825c3730774c678aca379e7a49
2020-06-29 04:40:24 +08:00
<tr class="memdesc:a3ab61b5a1c4f2288625d160aa0ea8478"><td class="mdescLeft">&#160;</td><td class="mdescRight">check if a given number can be represented as a sum of two abundant numbers. <a href="../../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">More...</a><br /></td></tr>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
<tr class="separator:a3ab61b5a1c4f2288625d160aa0ea8478"><td class="memSeparator" colspan="2">&#160;</td></tr>
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a> (int argc, char **argv)</td></tr>
<tr class="memdesc:a3c04138a5bfe5d72780bb7e82a18e627"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../d7/ddb/problem__23_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">More...</a><br /></td></tr>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
<tr class="separator:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<div class="textblock"><p ><a href="https://projecteuler.net/problem=23" target="_blank">Problem 23</a> solution </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
</div><h2 class="groupheader">Function Documentation</h2>
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<a id="ac5d600bf3077f4188afc4c5cd2c40eaf" name="ac5d600bf3077f4188afc4c5cd2c40eaf"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac5d600bf3077f4188afc4c5cd2c40eaf">&#9670;&nbsp;</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&#160;</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 id="l00056" name="l00056"></a><span class="lineno"> 56</span>{</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i;</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keywordflow">for</span> (i = N + 1; !<a class="code hl_function" href="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a>(i); i++)</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> {</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> ;</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> }</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">return</span> i;</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span>}</div>
<div class="ttc" id="aproblem__23_2sol1_8c_html_a4f128410e6582fe26488e2316cc96e17"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a></div><div class="ttdeci">unsigned long is_abundant(unsigned long N)</div><div class="ttdoc">Is the given number an abundant number (1) or not (0)</div><div class="ttdef"><b>Definition:</b> sol1.c:47</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/ddb/problem__23_2sol1_8c_ac5d600bf3077f4188afc4c5cd2c40eaf_cgraph.svg" width="479" 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" name="a1aca7f530f82b27100262adba9e7556b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1aca7f530f82b27100262adba9e7556b">&#9670;&nbsp;</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&#160;</td>
<td class="paramname"><em>N</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns: -1 if N is deficient 1 if N is abundant 0 if N is perfect. </p>
<div class="fragment"><div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span>{</div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> sum = 1;</div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> <span class="keywordtype">char</span> ret = 0;</div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span> </div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i = 2; i * i &lt;= N; i++)</div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> {</div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> <span class="keywordflow">if</span> (N % i == 0)</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> {</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> sum += i;</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> tmp = N / i;</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> <span class="keywordflow">if</span> (tmp != i)</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> {</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> sum += tmp;</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> }</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> }</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> }</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> </div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> ret = sum == N ? 0 : (sum &gt; N ? 1 : -1);</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// #ifdef DEBUG</span></div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// printf(&quot;%5lu: %5lu : %d\n&quot;, N, sum, ret);</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// #endif</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keywordflow">return</span> ret;</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a4f128410e6582fe26488e2316cc96e17" name="a4f128410e6582fe26488e2316cc96e17"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4f128410e6582fe26488e2316cc96e17">&#9670;&nbsp;</a></span>is_abundant()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">unsigned long is_abundant </td>
<td>(</td>
<td class="paramtype">unsigned long&#160;</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 id="l00048" name="l00048"></a><span class="lineno"> 48</span>{</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a>(N) == 1 ? 1 : 0;</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span>}</div>
<div class="ttc" id="aproblem__23_2sol1_8c_html_a1aca7f530f82b27100262adba9e7556b"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a></div><div class="ttdeci">char get_perfect_number(unsigned long N)</div><div class="ttdoc">Returns: -1 if N is deficient 1 if N is abundant 0 if N is perfect.</div><div class="ttdef"><b>Definition:</b> sol1.c:19</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/ddb/problem__23_2sol1_8c_a4f128410e6582fe26488e2316cc96e17_cgraph.svg" width="295" 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="a3ab61b5a1c4f2288625d160aa0ea8478" name="a3ab61b5a1c4f2288625d160aa0ea8478"></a>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
<h2 class="memtitle"><span class="permalink"><a href="#a3ab61b5a1c4f2288625d160aa0ea8478">&#9670;&nbsp;</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&#160;</td>
<td class="paramname"><em>N</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
Documentation for 8914128e137073825c3730774c678aca379e7a49
2020-06-29 04:40:24 +08:00
<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>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
<dd>
0 - if not </dd></dl>
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<div class="fragment"><div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span>{</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="comment">/* optimized logic:</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span><span class="comment"> * i + j = N where both i and j should be abundant</span></div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment"> * hence we can simply check for j = N - i as we loop through i</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="comment"> */</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i = <a class="code hl_function" href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a>(1); i &lt;= (N &gt;&gt; 1);</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> i = <a class="code hl_function" href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a>(i))</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> {</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a>(N - i))</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> {</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span><span class="preprocessor">#ifdef DEBUG</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> printf(<span class="stringliteral">&quot;\t%4lu + %4lu = %4lu\n&quot;</span>, i, N - i, N);</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">return</span> 1;</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> }</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> }</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span>}</div>
Documentation for 604ec7d2b3e1895b5663cf6194accc9b9606b9a6
2021-02-06 03:52:57 +08:00
<div class="ttc" id="aproblem__23_2sol1_8c_html_ac5d600bf3077f4188afc4c5cd2c40eaf"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a></div><div class="ttdeci">unsigned long get_next_abundant(unsigned long N)</div><div class="ttdoc">Find the next abundant number after N and not including N.</div><div class="ttdef"><b>Definition:</b> sol1.c:55</div></div>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d7/ddb/problem__23_2sol1_8c_a3ab61b5a1c4f2288625d160aa0ea8478_cgraph.svg" width="100%" height="300"><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>
<a id="a3c04138a5bfe5d72780bb7e82a18e627" name="a3c04138a5bfe5d72780bb7e82a18e627"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3c04138a5bfe5d72780bb7e82a18e627">&#9670;&nbsp;</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"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span>{</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> MAX_N = 28123; <span class="comment">/* upper limit of numbers to check */</span></div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> </div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> sum = 0;</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="keywordflow">if</span> (argc == 2)</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> {</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> MAX_N = strtoul(argv[1], NULL, 10);</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> }</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> </div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span><span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> printf(<span class="stringliteral">&quot;Using OpenMP parallleization with %d threads\n&quot;</span>,</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> omp_get_max_threads());</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span><span class="preprocessor">#else</span></div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> printf(<span class="stringliteral">&quot;Not using parallleization!\n&quot;</span>);</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> </div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keywordtype">double</span> total_duration = 0.f;</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keywordtype">long</span> i;</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span><span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span><span class="preprocessor">#pragma omp parallel for reduction(+ : sum) schedule(runtime)</span></div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keywordflow">for</span> (i = 1; i &lt;= MAX_N; i++)</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> {</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> clock_t start_time = clock();</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a>(i))</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> {</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> sum += i;</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> }</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> clock_t end_time = clock();</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> total_duration += (double)(end_time - start_time) / CLOCKS_PER_SEC;</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> </div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> printf(<span class="stringliteral">&quot;... %5lu: %8lu\r&quot;</span>, i, sum);</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">if</span> (i % 100 == 0)</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> {</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> fflush(stdout);</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> }</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> }</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> </div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> printf(<span class="stringliteral">&quot;Time taken: %.4g s\n&quot;</span>, total_duration);</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> printf(</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="stringliteral">&quot;Sum of numbers that cannot be represented as sum of two abundant &quot;</span></div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="stringliteral">&quot;numbers : %lu\n&quot;</span>,</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> sum);</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> </div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span>}</div>
<div class="ttc" id="aproblem__23_2sol1_8c_html_a3ab61b5a1c4f2288625d160aa0ea8478"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a></div><div class="ttdeci">char is_sum_of_abundant(unsigned long N)</div><div class="ttdoc">check if a given number can be represented as a sum of two abundant numbers.</div><div class="ttdef"><b>Definition:</b> sol1.c:71</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d7/ddb/problem__23_2sol1_8c_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg" width="100%" height="300"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
</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_f75ccd45e00436eafed446b9b2682984.html">problem_23</a></li><li class="navelem"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html">sol1.c</a></li>
Documentation for 779e2f073e30694c6448e8f988e54e3ae007caf4
2021-10-26 03:34:27 +08:00
<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.2 </li>
Documentation for d5d68d5842827cbbc1d35d7ec67247b97acb8dde
2020-06-28 23:07:29 +08:00
</ul>
</div>
</body>
</html>
Reference in New Issue Copy Permalink