mirror of
https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git
synced 2023-10-11 15:56:24 +08:00
385 lines
29 KiB
HTML
385 lines
29 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/sol1.c File Reference</title>
|
||
|
|
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||
|
|
<script type="text/javascript" src="../../jquery.js"></script>
|
||
|
|
<script type="text/javascript" src="../../dynsections.js"></script>
|
||
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||
|
|
<script type="text/javascript" src="../../resize.js"></script>
|
||
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
||
|
|
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||
|
|
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||
|
|
<script type="text/javascript" src="../../search/search.js"></script>
|
||
|
|
<script type="text/x-mathjax-config">
|
||
|
|
MathJax.Hub.Config({
|
||
|
|
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||
|
|
jax: ["input/TeX","output/HTML-CSS"],
|
||
|
|
});
|
||
|
|
</script>
|
||
|
|
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||
|
|
</head>
|
||
|
|
<body>
|
||
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||
|
|
<div id="titlearea">
|
||
|
|
<table cellspacing="0" cellpadding="0">
|
||
|
|
<tbody>
|
||
|
|
<tr style="height: 56px;">
|
||
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
||
|
|
<div id="projectname">Algorithms_in_C
|
||
|
|
 <span id="projectnumber">1.0.0</span>
|
||
|
|
</div>
|
||
|
|
<div id="projectbrief">Set of algorithms implemented in C.</div>
|
||
|
|
</td>
|
||
|
|
</tr>
|
||
|
|
</tbody>
|
||
|
|
</table>
|
||
|
|
</div>
|
||
|
|
<!-- end header part -->
|
||
|
|
<!-- Generated by Doxygen 1.8.18 -->
|
||
|
|
<script type="text/javascript">
|
||
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||
|
|
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||
|
|
/* @license-end */
|
||
|
|
</script>
|
||
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
||
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
||
|
|
<script type="text/javascript">
|
||
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||
|
|
$(function() {
|
||
|
|
initMenu('../../',true,false,'search.php','Search');
|
||
|
|
$(document).ready(function() { init_search(); });
|
||
|
|
});
|
||
|
|
/* @license-end */</script>
|
||
|
|
<div id="main-nav"></div>
|
||
|
|
</div><!-- top -->
|
||
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||
|
|
<div id="nav-tree">
|
||
|
|
<div id="nav-tree-contents">
|
||
|
|
<div id="nav-sync" class="sync"></div>
|
||
|
|
</div>
|
||
|
|
</div>
|
||
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
||
|
|
class="ui-resizable-handle">
|
||
|
|
</div>
|
||
|
|
</div>
|
||
|
|
<script type="text/javascript">
|
||
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||
|
|
$(document).ready(function(){initNavTree('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">
|
||
|
|
<a href="#func-members">Functions</a> |
|
||
|
|
<a href="#var-members">Variables</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=23">Problem 23</a> solution
|
||
|
|
<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 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">
|
||
|
|
<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="../../d7/ddb/problem__23_2sol1_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:a4f128410e6582fe26488e2316cc96e17"><td class="memItemLeft" align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a> (unsigned long <a class="el" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>)</td></tr>
|
||
|
|
<tr class="separator:a4f128410e6582fe26488e2316cc96e17"><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="../../d7/ddb/problem__23_2sol1_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="../../d7/ddb/problem__23_2sol1_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="../../d7/ddb/problem__23_2sol1_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:a337e545af040d754dc012b42523ee1ee"><td class="memItemLeft" align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee">MAX_N</a> = 28123</td></tr>
|
||
|
|
<tr class="separator:a337e545af040d754dc012b42523ee1ee"><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 </p>
|
||
|
|
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala">Krishna Vedala</a> </dd></dl>
|
||
|
|
</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="l00056"></a><span class="lineno"> 56</span> {</div>
|
||
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i;</div>
|
||
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</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="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a>(i); i++)</div>
|
||
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  ;</div>
|
||
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">return</span> i;</div>
|
||
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</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="../../d7/ddb/problem__23_2sol1_8c_ac5d600bf3077f4188afc4c5cd2c40eaf_cgraph.svg" width="468" 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">
|
||
|
|
<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 name="l00022"></a><span class="lineno"> 22</span> {</div>
|
||
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> sum = 1;</div>
|
||
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keywordtype">char</span> ret = 0;</div>
|
||
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  </div>
|
||
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</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="l00027"></a><span class="lineno"> 27</span>  {</div>
|
||
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</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="l00029"></a><span class="lineno"> 29</span>  {</div>
|
||
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  sum += i;</div>
|
||
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</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="l00032"></a><span class="lineno"> 32</span>  <span class="keywordflow">if</span> (tmp != i)</div>
|
||
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  sum += tmp;</div>
|
||
|
|
<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>  }</div>
|
||
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  </div>
|
||
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</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="l00038"></a><span class="lineno"> 38</span>  <span class="comment">// #ifdef DEBUG</span></div>
|
||
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="comment">// printf("%5lu: %5lu : %d\n", N, sum, ret);</span></div>
|
||
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="comment">// #endif</span></div>
|
||
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keywordflow">return</span> ret;</div>
|
||
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> }</div>
|
||
|
|
</div><!-- fragment -->
|
||
|
|
</div>
|
||
|
|
</div>
|
||
|
|
<a id="a4f128410e6582fe26488e2316cc96e17"></a>
|
||
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a4f128410e6582fe26488e2316cc96e17">◆ </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 </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="l00048"></a><span class="lineno"> 48</span> {</div>
|
||
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">return</span> <a class="code" href="../../d7/ddb/problem__23_2sol1_8c.html#a1aca7f530f82b27100262adba9e7556b">get_perfect_number</a>(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a>) == 1 ? 1 : 0;</div>
|
||
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</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="../../d7/ddb/problem__23_2sol1_8c_a4f128410e6582fe26488e2316cc96e17_cgraph.svg" width="288" 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"></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="l00070"></a><span class="lineno"> 70</span> {<span class="comment"></span></div>
|
||
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> /** optimized logic:</span></div>
|
||
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * i + j = N where both i and j should be abundant</span></div>
|
||
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</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="l00074"></a><span class="lineno"> 74</span> <span class="comment"> **/</span></div>
|
||
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i = <a class="code" href="../../d7/ddb/problem__23_2sol1_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="l00076"></a><span class="lineno"> 76</span>  i = <a class="code" href="../../d7/ddb/problem__23_2sol1_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf">get_next_abundant</a>(i))</div>
|
||
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d7/ddb/problem__23_2sol1_8c.html#a4f128410e6582fe26488e2316cc96e17">is_abundant</a>(<a class="code" href="../../db/d01/problem__13_2sol1_8c.html#a0240ac851181b84ac374872dc5434ee4">N</a> - i))</div>
|
||
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  {</div>
|
||
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor">#ifdef DEBUG</span></div>
|
||
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</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="l00081"></a><span class="lineno"> 81</span> <span class="preprocessor">#endif</span></div>
|
||
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">return</span> 1;</div>
|
||
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div>
|
||
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">return</span> 0;</div>
|
||
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</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="../../d7/ddb/problem__23_2sol1_8c_a3ab61b5a1c4f2288625d160aa0ea8478_cgraph.svg" width="659" 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>
|
||
|
|
<div class="fragment"><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> {</div>
|
||
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> sum = 0;</div>
|
||
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">if</span> (argc == 2)</div>
|
||
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <a class="code" href="../../d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee">MAX_N</a> = strtoul(argv[1], NULL, 10);</div>
|
||
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  </div>
|
||
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
||
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  printf(<span class="stringliteral">"Using OpenMP parallleization with %d threads\n"</span>,</div>
|
||
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  omp_get_max_threads());</div>
|
||
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor">#else</span></div>
|
||
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  printf(<span class="stringliteral">"Not using parallleization!\n"</span>);</div>
|
||
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="preprocessor">#endif</span></div>
|
||
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  </div>
|
||
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordtype">double</span> total_duration = 0.f;</div>
|
||
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordtype">long</span> i;</div>
|
||
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="preprocessor">#ifdef _OPENMP</span></div>
|
||
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="preprocessor">#pragma omp parallel for reduction(+ : sum) schedule(runtime)</span></div>
|
||
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="preprocessor">#endif</span></div>
|
||
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">for</span> (i = 1; i <= <a class="code" href="../../d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee">MAX_N</a>; i++)</div>
|
||
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  {</div>
|
||
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  clock_t start_time = clock();</div>
|
||
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d7/ddb/problem__23_2sol1_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478">is_sum_of_abundant</a>(i))</div>
|
||
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  sum += i;</div>
|
||
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  clock_t end_time = clock();</div>
|
||
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  total_duration += (double)(end_time - start_time) / CLOCKS_PER_SEC;</div>
|
||
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  </div>
|
||
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  printf(<span class="stringliteral">"... %5lu: %8lu\r"</span>, i, sum);</div>
|
||
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">if</span> (i % 100 == 0)</div>
|
||
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  fflush(stdout);</div>
|
||
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  }</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>  printf(<span class="stringliteral">"Time taken: %.4g s\n"</span>, total_duration);</div>
|
||
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  printf(<span class="stringliteral">"Sum of numbers that cannot be represented as sum of two abundant "</span></div>
|
||
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="stringliteral">"numbers : %lu\n"</span>,</div>
|
||
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  sum);</div>
|
||
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  </div>
|
||
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">return</span> 0;</div>
|
||
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> }</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>
|
||
|
|
</div>
|
||
|
|
</div>
|
||
|
|
|
||
|
|
</div>
|
||
|
|
</div>
|
||
|
|
<h2 class="groupheader">Variable Documentation</h2>
|
||
|
|
<a id="a337e545af040d754dc012b42523ee1ee"></a>
|
||
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a337e545af040d754dc012b42523ee1ee">◆ </a></span>MAX_N</h2>
|
||
|
|
|
||
|
|
<div class="memitem">
|
||
|
|
<div class="memproto">
|
||
|
|
<table class="memname">
|
||
|
|
<tr>
|
||
|
|
<td class="memname">unsigned long MAX_N = 28123</td>
|
||
|
|
</tr>
|
||
|
|
</table>
|
||
|
|
</div><div class="memdoc">
|
||
|
|
<p>upper limit of numbers to check </p>
|
||
|
|
|
||
|
|
</div>
|
||
|
|
</div>
|
||
|
|
</div><!-- contents -->
|
||
|
|
</div><!-- doc-content -->
|
||
|
|
<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="ttdef"><b>Definition:</b> sol1.c:55</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_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="ttdef"><b>Definition:</b> sol1.c:47</div></div>
|
||
|
|
<div class="ttc" id="aproblem__23_2sol1_8c_html_a337e545af040d754dc012b42523ee1ee"><div class="ttname"><a href="../../d7/ddb/problem__23_2sol1_8c.html#a337e545af040d754dc012b42523ee1ee">MAX_N</a></div><div class="ttdeci">unsigned long MAX_N</div><div class="ttdef"><b>Definition:</b> sol1.c:13</div></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="ttdef"><b>Definition:</b> sol1.c:21</div></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="ttdef"><b>Definition:</b> sol1.c:69</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="../../d7/ddb/problem__23_2sol1_8c.html">sol1.c</a></li>
|
||
|
|
<li class="footer">Generated on Sun Jun 28 2020 15:07:07 for Algorithms_in_C by
|
||
|
|
<a href="http://www.doxygen.org/index.html">
|
||
|
|
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||
|
|
</ul>
|
||
|
|
</div>
|
||
|
|
</body>
|
||
|
|
</html>
|