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" / >
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" / >
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/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" >
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"],
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;" >
2021-10-26 03:34:27 +08:00
< div id = "projectname" > Algorithms_in_C< span id = "projectnumber" >   1.0.0< / span >
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 -->
2021-10-26 03:34:27 +08:00
<!-- Generated by Doxygen 1.9.2 -->
2020-06-28 23:07:29 +08:00
< script type = "text/javascript" >
2021-10-26 03:34:27 +08:00
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699& dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
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" >
2021-10-26 03:34:27 +08:00
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699& dn=expat.txt MIT */
2020-06-28 23:07:29 +08:00
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
2021-10-26 03:34:27 +08:00
/* @license-end */
< / script >
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" >
2021-10-26 03:34:27 +08:00
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699& dn=expat.txt MIT */
2020-06-28 23:07:29 +08:00
$(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 >
2021-10-26 03:34:27 +08:00
< div class = "headertitle" > < div class = "title" > sol2.c File Reference< / div > < / div >
2020-06-28 23:07:29 +08:00
< / div > <!-- header -->
< div class = "contents" >
2021-10-26 03:34:27 +08:00
< p > < a href = "https://projecteuler.net/problem=23" target = "_blank" > Problem 23< / a > solution - optimization using look-up array
2020-06-28 23:07:29 +08:00
< 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" >
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 >
2020-06-28 23:07:29 +08:00
Functions< / h2 > < / td > < / tr >
2020-07-17 04:36:47 +08:00
< 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 N)< / td > < / tr >
2020-06-28 23:07:29 +08:00
< tr class = "separator:a1aca7f530f82b27100262adba9e7556b" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2021-10-26 03:34:27 +08:00
< 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 N)< / td > < / tr >
< tr class = "memdesc:a34f4ad85151e3a43368ae67f42347f56" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Is the given number an abundant number (1) or not (0) < a href = "../../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56" > More...< / a > < br / > < / td > < / tr >
2020-06-28 23:07:29 +08:00
< tr class = "separator:a34f4ad85151e3a43368ae67f42347f56" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2021-10-26 03:34:27 +08:00
< 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 N)< / td > < / tr >
< tr class = "memdesc:ac5d600bf3077f4188afc4c5cd2c40eaf" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Find the next abundant number after N and not including N. < a href = "../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf" > More...< / a > < br / > < / td > < / tr >
2020-06-28 23:07:29 +08:00
< tr class = "separator:ac5d600bf3077f4188afc4c5cd2c40eaf" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2020-07-17 04:36:47 +08:00
< 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 N)< / td > < / tr >
2020-06-29 04:40:24 +08:00
< tr class = "memdesc:a3ab61b5a1c4f2288625d160aa0ea8478" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > check if a given number can be represented as a sum of two abundant numbers. < a href = "../../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478" > More...< / a > < br / > < / td > < / tr >
2020-06-28 23:07:29 +08:00
< tr class = "separator:a3ab61b5a1c4f2288625d160aa0ea8478" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
2021-10-26 03:34:27 +08:00
< 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 = "memdesc:a3c04138a5bfe5d72780bb7e82a18e627" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > Main function. < a href = "../../d4/dbd/problem__23_2sol2_8c.html#a3c04138a5bfe5d72780bb7e82a18e627" > More...< / a > < br / > < / td > < / tr >
2020-06-28 23:07:29 +08:00
< tr class = "separator:a3c04138a5bfe5d72780bb7e82a18e627" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
< / table > < table class = "memberdecls" >
2021-10-26 03:34:27 +08:00
< tr class = "heading" > < td colspan = "2" > < h2 class = "groupheader" > < a id = "var-members" name = "var-members" > < / a >
2020-06-28 23:07:29 +08:00
Variables< / h2 > < / 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 >
2020-06-29 04:40:24 +08:00
< tr class = "memdesc:af920a16d6ef69dd604b283f427892e06" > < td class = "mdescLeft" >   < / td > < td class = "mdescRight" > This is the global array to be used to store a flag to identify if a particular number is abundant (1) or not (0). < a href = "../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06" > More...< / a > < br / > < / td > < / tr >
2020-06-28 23:07:29 +08:00
< tr class = "separator:af920a16d6ef69dd604b283f427892e06" > < td class = "memSeparator" colspan = "2" >   < / td > < / tr >
< / table >
< a name = "details" id = "details" > < / a > < h2 class = "groupheader" > Detailed Description< / h2 >
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 - optimization using look-up array < / p >
< dl class = "section author" > < dt > Author< / dt > < dd > < a href = "https://github.com/kvedala" target = "_blank" > Krishna Vedala< / a > < / dd > < / dl >
2020-06-28 23:07:29 +08:00
< p > Optimization applied - compute & store abundant numbers once into a look-up array. < / p >
< / div > < h2 class = "groupheader" > Function Documentation< / h2 >
2021-10-26 03:34:27 +08:00
< a id = "ac5d600bf3077f4188afc4c5cd2c40eaf" name = "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 id = "l00071" name = "l00071" > < / a > < span class = "lineno" > 71< / span > {< / div >
< div class = "line" > < a id = "l00072" name = "l00072" > < / a > < span class = "lineno" > 72< / span > < span class = "keywordtype" > unsigned< / span > < span class = "keywordtype" > long< / span > i;< / div >
< div class = "line" > < a id = "l00073" 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 id = "l00074" name = "l00074" > < / a > < span class = "lineno" > 74< / span > < span class = "keywordflow" > for< / span > (i = N + 1; !< a class = "code hl_function" href = "../../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56" > is_abundant< / a > (i); ++i)< / div >
< div class = "line" > < a id = "l00075" name = "l00075" > < / a > < span class = "lineno" > 75< / span > {< / div >
< div class = "line" > < a id = "l00076" name = "l00076" > < / a > < span class = "lineno" > 76< / span > ;< / div >
< div class = "line" > < a id = "l00077" name = "l00077" > < / a > < span class = "lineno" > 77< / span > }< / div >
< div class = "line" > < a id = "l00078" name = "l00078" > < / a > < span class = "lineno" > 78< / span > < span class = "keywordflow" > return< / span > i;< / div >
< div class = "line" > < a id = "l00079" name = "l00079" > < / a > < span class = "lineno" > 79< / span > }< / 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 = "ttdoc" > Is the given number an abundant number (1) or not (0)< / div > < div class = "ttdef" > < b > Definition:< / b > sol2.c:59< / div > < / div >
< / div > <!-- fragment --> < div class = "dynheader" >
Here is the call graph for this function:< / div >
< div class = "dyncontent" >
2021-12-10 01:57:52 +08:00
< 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 >
2021-10-26 03:34:27 +08:00
< / div >
< / div >
< / div >
< / div >
< a id = "a1aca7f530f82b27100262adba9e7556b" name = "a1aca7f530f82b27100262adba9e7556b" > < / a >
2020-06-28 23:07:29 +08:00
< 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 >
2021-10-26 03:34:27 +08:00
< div class = "fragment" > < div class = "line" > < a id = "l00032" name = "l00032" > < / a > < span class = "lineno" > 32< / span > {< / div >
< div class = "line" > < a id = "l00033" name = "l00033" > < / a > < span class = "lineno" > 33< / span > < span class = "keywordtype" > unsigned< / span > < span class = "keywordtype" > long< / span > sum = 1;< / div >
< div class = "line" > < a id = "l00034" name = "l00034" > < / a > < span class = "lineno" > 34< / span > < span class = "keywordtype" > char< / span > ret = 0;< / 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 > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > unsigned< / span > < span class = "keywordtype" > long< / span > i = 2; i * i < = N; i++)< / div >
< div class = "line" > < a id = "l00037" name = "l00037" > < / a > < span class = "lineno" > 37< / span > {< / div >
< div class = "line" > < a id = "l00038" name = "l00038" > < / a > < span class = "lineno" > 38< / span > < span class = "keywordflow" > if< / span > (N % i == 0)< / div >
< div class = "line" > < a id = "l00039" name = "l00039" > < / a > < span class = "lineno" > 39< / span > {< / div >
< div class = "line" > < a id = "l00040" name = "l00040" > < / a > < span class = "lineno" > 40< / span > sum += i;< / div >
< div class = "line" > < a id = "l00041" name = "l00041" > < / a > < span class = "lineno" > 41< / span > < span class = "keywordtype" > unsigned< / span > < span class = "keywordtype" > long< / span > tmp = N / i;< / div >
< div class = "line" > < a id = "l00042" name = "l00042" > < / a > < span class = "lineno" > 42< / span > < span class = "keywordflow" > if< / span > (tmp != i)< / div >
< div class = "line" > < a id = "l00043" name = "l00043" > < / a > < span class = "lineno" > 43< / span > {< / div >
< div class = "line" > < a id = "l00044" name = "l00044" > < / a > < span class = "lineno" > 44< / span > sum += tmp;< / div >
< div class = "line" > < a id = "l00045" name = "l00045" > < / a > < span class = "lineno" > 45< / span > }< / div >
< div class = "line" > < a id = "l00046" name = "l00046" > < / a > < span class = "lineno" > 46< / span > }< / div >
< div class = "line" > < a id = "l00047" name = "l00047" > < / a > < span class = "lineno" > 47< / span > }< / div >
< 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 > ret = sum == N ? 0 : (sum > N ? 1 : -1);< / div >
< div class = "line" > < a id = "l00050" name = "l00050" > < / a > < span class = "lineno" > 50< / span > < span class = "preprocessor" > #ifdef DEBUG< / span > < / div >
< div class = "line" > < a id = "l00051" name = "l00051" > < / a > < span class = "lineno" > 51< / span > printf(< span class = "stringliteral" > " %5lu: %5lu : %d\n" < / span > , N, sum, ret);< / div >
< div class = "line" > < a id = "l00052" name = "l00052" > < / a > < span class = "lineno" > 52< / span > < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < a id = "l00053" name = "l00053" > < / a > < span class = "lineno" > 53< / span > < span class = "keywordflow" > return< / span > ret;< / div >
< div class = "line" > < a id = "l00054" name = "l00054" > < / a > < span class = "lineno" > 54< / span > }< / div >
2020-06-28 23:07:29 +08:00
< / div > <!-- fragment -->
< / div >
< / div >
2021-10-26 03:34:27 +08:00
< a id = "a34f4ad85151e3a43368ae67f42347f56" name = "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 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 > < span class = "comment" > // return abundant_flags[N > > 3] & (1 < < N % 8) ? 1 : 0;< / span > < / div >
< div class = "line" > < a id = "l00062" name = "l00062" > < / a > < span class = "lineno" > 62< / span > < span class = "keywordflow" > return< / span > < a class = "code hl_variable" href = "../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06" > abundant_flags< / a > [N > > 3] & (1 < < (N & 7))< / div >
< div class = "line" > < a id = "l00063" name = "l00063" > < / a > < span class = "lineno" > 63< / span > ? 1< / div >
< div class = "line" > < a id = "l00064" name = "l00064" > < / a > < span class = "lineno" > 64< / span > : 0; < span class = "comment" > /* optimized modulo operation */< / span > < / div >
< div class = "line" > < a id = "l00065" name = "l00065" > < / a > < span class = "lineno" > 65< / span > }< / 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 = "ttdoc" > This is the global array to be used to store a flag to identify if a particular number is abundant (1...< / div > < div class = "ttdef" > < b > Definition:< / b > sol2.c:24< / div > < / div >
< / div > <!-- fragment -->
< / div >
< / div >
< a id = "a3ab61b5a1c4f2288625d160aa0ea8478" name = "a3ab61b5a1c4f2288625d160aa0ea8478" > < / a >
2020-06-28 23:07:29 +08:00
< 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" >
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 >
2020-06-28 23:07:29 +08:00
< dd >
0 - if not < / dd > < / dl >
2021-10-26 03:34:27 +08:00
< div class = "fragment" > < div class = "line" > < a id = "l00088" name = "l00088" > < / a > < span class = "lineno" > 88< / span > {< / div >
< div class = "line" > < a id = "l00089" name = "l00089" > < / a > < span class = "lineno" > 89< / span > < span class = "comment" > /* optimized logic:< / span > < / div >
< div class = "line" > < a id = "l00090" name = "l00090" > < / a > < span class = "lineno" > 90< / span > < span class = "comment" > * i + j = N where both i and j should be abundant< / span > < / div >
< div class = "line" > < a id = "l00091" name = "l00091" > < / a > < span class = "lineno" > 91< / 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 = "l00092" name = "l00092" > < / a > < span class = "lineno" > 92< / span > < span class = "comment" > */< / span > < / div >
< div class = "line" > < a id = "l00093" name = "l00093" > < / a > < span class = "lineno" > 93< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > unsigned< / span > < span class = "keywordtype" > long< / span > i = < a class = "code hl_function" href = "../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf" > get_next_abundant< / a > (1); i < = (N > > 1);< / div >
< div class = "line" > < a id = "l00094" name = "l00094" > < / a > < span class = "lineno" > 94< / span > i = < a class = "code hl_function" href = "../../d4/dbd/problem__23_2sol2_8c.html#ac5d600bf3077f4188afc4c5cd2c40eaf" > get_next_abundant< / a > (i))< / 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 = "keywordflow" > if< / span > (< a class = "code hl_function" href = "../../d4/dbd/problem__23_2sol2_8c.html#a34f4ad85151e3a43368ae67f42347f56" > is_abundant< / a > (N - i))< / div >
< div class = "line" > < a id = "l00097" name = "l00097" > < / a > < span class = "lineno" > 97< / span > {< / div >
< div class = "line" > < a id = "l00098" name = "l00098" > < / a > < span class = "lineno" > 98< / span > < span class = "preprocessor" > #ifdef DEBUG< / span > < / div >
< div class = "line" > < a id = "l00099" name = "l00099" > < / a > < span class = "lineno" > 99< / span > printf(< span class = "stringliteral" > " \t%4lu + %4lu = %4lu\n" < / span > , i, N - i, N);< / div >
< div class = "line" > < a id = "l00100" name = "l00100" > < / a > < span class = "lineno" > 100< / span > < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < a id = "l00101" name = "l00101" > < / a > < span class = "lineno" > 101< / span > < span class = "keywordflow" > return< / span > 1;< / div >
< div class = "line" > < a id = "l00102" name = "l00102" > < / a > < span class = "lineno" > 102< / span > }< / div >
< div class = "line" > < a id = "l00103" name = "l00103" > < / a > < span class = "lineno" > 103< / span > }< / div >
< div class = "line" > < a id = "l00104" name = "l00104" > < / a > < span class = "lineno" > 104< / span > < span class = "keywordflow" > return< / span > 0;< / div >
< div class = "line" > < a id = "l00105" name = "l00105" > < / a > < span class = "lineno" > 105< / span > }< / div >
2021-02-06 03:52:57 +08:00
< 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 = "ttdoc" > Find the next abundant number after N and not including N.< / div > < div class = "ttdef" > < b > Definition:< / b > sol2.c:70< / div > < / div >
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" >
2021-12-10 01:57:52 +08:00
< 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 >
2021-10-26 03:34:27 +08:00
< / div >
< / div >
< / div >
< / div >
< a id = "a3c04138a5bfe5d72780bb7e82a18e627" name = "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 id = "l00109" name = "l00109" > < / a > < span class = "lineno" > 109< / span > {< / div >
< div class = "line" > < a id = "l00110" name = "l00110" > < / a > < span class = "lineno" > 110< / span > < span class = "keywordtype" > long< / span > MAX_N = 28123; < span class = "comment" > /* Limit of numbers to check */< / span > < / div >
< div class = "line" > < a id = "l00111" name = "l00111" > < / a > < span class = "lineno" > 111< / span > < / div >
< div class = "line" > < a id = "l00112" name = "l00112" > < / a > < span class = "lineno" > 112< / span > < span class = "keywordtype" > unsigned< / span > < span class = "keywordtype" > long< / span > sum = 0;< / div >
< div class = "line" > < a id = "l00113" name = "l00113" > < / a > < span class = "lineno" > 113< / span > < span class = "keywordflow" > if< / span > (argc == 2)< / div >
< div class = "line" > < a id = "l00114" name = "l00114" > < / a > < span class = "lineno" > 114< / span > {< / div >
< div class = "line" > < a id = "l00115" name = "l00115" > < / a > < span class = "lineno" > 115< / span > MAX_N = strtoul(argv[1], NULL, 10);< / div >
< div class = "line" > < a id = "l00116" name = "l00116" > < / a > < span class = "lineno" > 116< / span > }< / div >
< div class = "line" > < a id = "l00117" name = "l00117" > < / a > < span class = "lineno" > 117< / span > < / div >
< div class = "line" > < a id = "l00118" name = "l00118" > < / a > < span class = "lineno" > 118< / span > < span class = "comment" > /* byte array to store flags to identify abundant numbers< / span > < / div >
< div class = "line" > < a id = "l00119" name = "l00119" > < / a > < span class = "lineno" > 119< / span > < span class = "comment" > * the flags are identified by bits< / span > < / div >
< div class = "line" > < a id = "l00120" name = "l00120" > < / a > < span class = "lineno" > 120< / span > < span class = "comment" > */< / span > < / div >
< div class = "line" > < a id = "l00121" name = "l00121" > < / a > < span class = "lineno" > 121< / span > < a class = "code hl_variable" href = "../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06" > abundant_flags< / a > = (< span class = "keywordtype" > char< / span > *)< a class = "code hl_define" href = "../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b" > calloc< / a > (MAX_N > > 3, 1);< / div >
< div class = "line" > < a id = "l00122" name = "l00122" > < / a > < span class = "lineno" > 122< / span > < span class = "keywordflow" > if< / span > (!< a class = "code hl_variable" href = "../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06" > abundant_flags< / a > )< / 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 > perror(< span class = "stringliteral" > " Unable to allocate memoey!" < / span > );< / div >
< div class = "line" > < a id = "l00125" name = "l00125" > < / a > < span class = "lineno" > 125< / span > < span class = "keywordflow" > return< / span > -1;< / 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 > < / div >
< div class = "line" > < a id = "l00128" name = "l00128" > < / a > < span class = "lineno" > 128< / span > < span class = "preprocessor" > #ifdef _OPENMP< / span > < / div >
< div class = "line" > < a id = "l00129" name = "l00129" > < / a > < span class = "lineno" > 129< / span > printf(< span class = "stringliteral" > " Using OpenMP parallleization with %d threads\n" < / span > ,< / div >
< div class = "line" > < a id = "l00130" name = "l00130" > < / a > < span class = "lineno" > 130< / span > omp_get_max_threads());< / div >
< div class = "line" > < a id = "l00131" name = "l00131" > < / a > < span class = "lineno" > 131< / span > < span class = "preprocessor" > #else< / span > < / div >
< div class = "line" > < a id = "l00132" name = "l00132" > < / a > < span class = "lineno" > 132< / span > printf(< span class = "stringliteral" > " Not using parallleization!\n" < / span > );< / div >
< div class = "line" > < a id = "l00133" name = "l00133" > < / a > < span class = "lineno" > 133< / span > < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < a id = "l00134" name = "l00134" > < / a > < span class = "lineno" > 134< / span > < / div >
< div class = "line" > < a id = "l00135" name = "l00135" > < / a > < span class = "lineno" > 135< / span > clock_t start_time = clock();< / 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 = "comment" > /* Loop to set abundant flags */< / span > < / div >
< div class = "line" > < a id = "l00138" name = "l00138" > < / a > < span class = "lineno" > 138< / span > < span class = "keywordtype" > long< / span > N;< / div >
< div class = "line" > < a id = "l00139" name = "l00139" > < / a > < span class = "lineno" > 139< / span > < span class = "preprocessor" > #ifdef _OPENMP< / span > < / div >
< div class = "line" > < a id = "l00140" name = "l00140" > < / a > < span class = "lineno" > 140< / span > < span class = "preprocessor" > #pragma omp for schedule(runtime)< / span > < / div >
< div class = "line" > < a id = "l00141" name = "l00141" > < / a > < span class = "lineno" > 141< / span > < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < a id = "l00142" name = "l00142" > < / a > < span class = "lineno" > 142< / span > < span class = "keywordflow" > for< / span > (N = 1; N < = MAX_N; N++)< / div >
< div class = "line" > < a id = "l00143" name = "l00143" > < / a > < span class = "lineno" > 143< / span > {< / div >
< div class = "line" > < a id = "l00144" name = "l00144" > < / a > < span class = "lineno" > 144< / span > < span class = "keywordtype" > char< / span > ret = < a class = "code hl_function" href = "../../d4/dbd/problem__23_2sol2_8c.html#a1aca7f530f82b27100262adba9e7556b" > get_perfect_number< / a > (N);< / div >
< div class = "line" > < a id = "l00145" name = "l00145" > < / a > < span class = "lineno" > 145< / span > < span class = "keywordflow" > if< / span > (ret == 1)< / div >
< div class = "line" > < a id = "l00146" name = "l00146" > < / a > < span class = "lineno" > 146< / span > {< / div >
< div class = "line" > < a id = "l00147" name = "l00147" > < / a > < span class = "lineno" > 147< / span > < span class = "comment" > // int byte_offset = N % 8, index = N > > 3;< / span > < / div >
< div class = "line" > < a id = "l00148" name = "l00148" > < / a > < span class = "lineno" > 148< / span > < span class = "keywordtype" > int< / span > byte_offset = N & 7, index = N > > 3;< / div >
< div class = "line" > < a id = "l00149" name = "l00149" > < / a > < span class = "lineno" > 149< / span > < span class = "preprocessor" > #ifdef _OPENMP< / span > < / div >
< div class = "line" > < a id = "l00150" name = "l00150" > < / a > < span class = "lineno" > 150< / span > < span class = "preprocessor" > #pragma omp critical< / span > < / div >
< div class = "line" > < a id = "l00151" name = "l00151" > < / a > < span class = "lineno" > 151< / span > < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < a id = "l00152" name = "l00152" > < / a > < span class = "lineno" > 152< / span > < a class = "code hl_variable" href = "../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06" > abundant_flags< / a > [index] |= ret < < byte_offset;< / div >
< div class = "line" > < a id = "l00153" name = "l00153" > < / a > < span class = "lineno" > 153< / span > }< / div >
< div class = "line" > < a id = "l00154" name = "l00154" > < / a > < span class = "lineno" > 154< / span > < span class = "comment" > // if (i % 100 == 0)< / span > < / div >
< div class = "line" > < a id = "l00155" name = "l00155" > < / a > < span class = "lineno" > 155< / span > < span class = "comment" > // printf(" ... %5lu: %8lu\r" , i, sum);< / span > < / div >
< div class = "line" > < a id = "l00156" name = "l00156" > < / a > < span class = "lineno" > 156< / span > }< / div >
< div class = "line" > < a id = "l00157" name = "l00157" > < / a > < span class = "lineno" > 157< / span > < / div >
< div class = "line" > < a id = "l00158" name = "l00158" > < / a > < span class = "lineno" > 158< / span > clock_t end_time = clock();< / div >
< div class = "line" > < a id = "l00159" name = "l00159" > < / a > < span class = "lineno" > 159< / span > < span class = "keywordtype" > double< / span > t1 = 1e3 * (end_time - start_time) / CLOCKS_PER_SEC;< / div >
< div class = "line" > < a id = "l00160" name = "l00160" > < / a > < span class = "lineno" > 160< / span > printf(< span class = "stringliteral" > " Time taken to get abundant numbers: %.4g ms\n" < / span > , t1);< / div >
< div class = "line" > < a id = "l00161" name = "l00161" > < / a > < span class = "lineno" > 161< / span > < / div >
< div class = "line" > < a id = "l00162" name = "l00162" > < / a > < span class = "lineno" > 162< / span > clock_t t2 = 0;< / div >
< div class = "line" > < a id = "l00163" name = "l00163" > < / a > < span class = "lineno" > 163< / span > < span class = "keywordtype" > long< / span > i;< / div >
< div class = "line" > < a id = "l00164" name = "l00164" > < / a > < span class = "lineno" > 164< / span > < span class = "preprocessor" > #ifdef _OPENMP< / span > < / div >
< div class = "line" > < a id = "l00165" name = "l00165" > < / a > < span class = "lineno" > 165< / span > < span class = "preprocessor" > #pragma omp parallel for schedule(runtime) reduction(+ : sum)< / span > < / div >
< div class = "line" > < a id = "l00166" name = "l00166" > < / a > < span class = "lineno" > 166< / span > < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < a id = "l00167" name = "l00167" > < / a > < span class = "lineno" > 167< / span > < span class = "keywordflow" > for< / span > (i = 1; i < MAX_N; i++)< / div >
< div class = "line" > < a id = "l00168" name = "l00168" > < / a > < span class = "lineno" > 168< / span > {< / div >
< div class = "line" > < a id = "l00169" name = "l00169" > < / a > < span class = "lineno" > 169< / span > clock_t start_time1 = clock();< / div >
< div class = "line" > < a id = "l00170" name = "l00170" > < / a > < span class = "lineno" > 170< / span > < span class = "keywordflow" > if< / span > (!< a class = "code hl_function" href = "../../d4/dbd/problem__23_2sol2_8c.html#a3ab61b5a1c4f2288625d160aa0ea8478" > is_sum_of_abundant< / a > (i))< / div >
< div class = "line" > < a id = "l00171" name = "l00171" > < / a > < span class = "lineno" > 171< / span > {< / div >
< div class = "line" > < a id = "l00172" name = "l00172" > < / a > < span class = "lineno" > 172< / span > < span class = "comment" > // #ifdef _OPENMP< / span > < / div >
< div class = "line" > < a id = "l00173" name = "l00173" > < / a > < span class = "lineno" > 173< / span > < span class = "comment" > // #pragma omp critical< / span > < / div >
< div class = "line" > < a id = "l00174" name = "l00174" > < / a > < span class = "lineno" > 174< / span > < span class = "comment" > // #endif< / span > < / div >
< div class = "line" > < a id = "l00175" name = "l00175" > < / a > < span class = "lineno" > 175< / span > sum += i;< / div >
< div class = "line" > < a id = "l00176" name = "l00176" > < / a > < span class = "lineno" > 176< / span > }< / div >
< div class = "line" > < a id = "l00177" name = "l00177" > < / a > < span class = "lineno" > 177< / span > clock_t end_time1 = clock();< / div >
< div class = "line" > < a id = "l00178" name = "l00178" > < / a > < span class = "lineno" > 178< / span > < span class = "preprocessor" > #ifdef _OPENMP< / span > < / div >
< div class = "line" > < a id = "l00179" name = "l00179" > < / a > < span class = "lineno" > 179< / span > < span class = "preprocessor" > #pragma omp critical< / span > < / div >
< div class = "line" > < a id = "l00180" name = "l00180" > < / a > < span class = "lineno" > 180< / span > < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < a id = "l00181" name = "l00181" > < / a > < span class = "lineno" > 181< / span > t2 += end_time1 - start_time1;< / div >
< div class = "line" > < a id = "l00182" name = "l00182" > < / a > < span class = "lineno" > 182< / span > < / div >
< div class = "line" > < a id = "l00183" name = "l00183" > < / a > < span class = "lineno" > 183< / span > printf(< span class = "stringliteral" > " ... %5lu: %8lu\r" < / span > , i, sum);< / div >
< div class = "line" > < a id = "l00184" name = "l00184" > < / a > < span class = "lineno" > 184< / span > < span class = "keywordflow" > if< / span > (i % 100 == 0)< / div >
< div class = "line" > < a id = "l00185" name = "l00185" > < / a > < span class = "lineno" > 185< / span > {< / div >
< div class = "line" > < a id = "l00186" name = "l00186" > < / a > < span class = "lineno" > 186< / span > fflush(stdout);< / div >
< div class = "line" > < a id = "l00187" name = "l00187" > < / a > < span class = "lineno" > 187< / span > }< / div >
< div class = "line" > < a id = "l00188" name = "l00188" > < / a > < span class = "lineno" > 188< / span > }< / div >
< div class = "line" > < a id = "l00189" name = "l00189" > < / a > < span class = "lineno" > 189< / span > < / div >
< div class = "line" > < a id = "l00190" name = "l00190" > < / a > < span class = "lineno" > 190< / span > < span class = "preprocessor" > #ifdef DEBUG< / span > < / div >
< div class = "line" > < a id = "l00191" name = "l00191" > < / a > < span class = "lineno" > 191< / span > putchar(< span class = "charliteral" > ' \n' < / span > );< / div >
< div class = "line" > < a id = "l00192" name = "l00192" > < / a > < span class = "lineno" > 192< / span > < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < a id = "l00193" name = "l00193" > < / a > < span class = "lineno" > 193< / span > < span class = "keywordtype" > double< / span > t22 = 1e3 * t2 / CLOCKS_PER_SEC;< / div >
< div class = "line" > < a id = "l00194" name = "l00194" > < / a > < span class = "lineno" > 194< / span > printf(< span class = "stringliteral" > " Time taken for final sum: %.4g ms\nTotal Time taken: %.4g ms\n" < / span > ,< / div >
< div class = "line" > < a id = "l00195" name = "l00195" > < / a > < span class = "lineno" > 195< / span > t22, t1 + t22);< / div >
< div class = "line" > < a id = "l00196" name = "l00196" > < / a > < span class = "lineno" > 196< / span > printf(< span class = "stringliteral" > " Memory used: %lu bytes\n" < / span > , MAX_N > > 3);< / div >
< div class = "line" > < a id = "l00197" name = "l00197" > < / a > < span class = "lineno" > 197< / span > printf(< / div >
< div class = "line" > < a id = "l00198" name = "l00198" > < / a > < span class = "lineno" > 198< / span > < span class = "stringliteral" > " Sum of numbers that cannot be represented as sum of two abundant " < / span > < / div >
< div class = "line" > < a id = "l00199" name = "l00199" > < / a > < span class = "lineno" > 199< / span > < span class = "stringliteral" > " numbers : %lu\n" < / span > ,< / div >
< div class = "line" > < a id = "l00200" name = "l00200" > < / a > < span class = "lineno" > 200< / span > sum);< / div >
< div class = "line" > < a id = "l00201" name = "l00201" > < / a > < span class = "lineno" > 201< / span > < / div >
< div class = "line" > < a id = "l00202" name = "l00202" > < / a > < span class = "lineno" > 202< / span > < a class = "code hl_define" href = "../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768" > free< / a > (< a class = "code hl_variable" href = "../../d4/dbd/problem__23_2sol2_8c.html#af920a16d6ef69dd604b283f427892e06" > abundant_flags< / a > );< / div >
< div class = "line" > < a id = "l00203" name = "l00203" > < / a > < span class = "lineno" > 203< / span > < / div >
< div class = "line" > < a id = "l00204" name = "l00204" > < / a > < span class = "lineno" > 204< / span > < span class = "keywordflow" > return< / span > 0;< / div >
< div class = "line" > < a id = "l00205" name = "l00205" > < / a > < span class = "lineno" > 205< / span > }< / div >
< div class = "ttc" id = "amalloc__dbg_8h_html_a9cc854374299a1dd933bf62029761768" > < div class = "ttname" > < a href = "../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768" > free< / a > < / div > < div class = "ttdeci" > #define free(ptr)< / div > < div class = "ttdoc" > This macro replace the standard free function with free_dbg.< / div > < div class = "ttdef" > < b > Definition:< / b > malloc_dbg.h:26< / div > < / div >
< div class = "ttc" id = "amalloc__dbg_8h_html_afdddaa949a93c1ef559a638e98f9c21b" > < div class = "ttname" > < a href = "../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b" > calloc< / a > < / div > < div class = "ttdeci" > #define calloc(elemCount, elemSize)< / div > < div class = "ttdoc" > This macro replace the standard calloc function with calloc_dbg.< / div > < div class = "ttdef" > < b > Definition:< / b > malloc_dbg.h:22< / div > < / div >
< 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:31< / 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 = "ttdoc" > check if a given number can be represented as a sum of two abundant numbers.< / div > < div class = "ttdef" > < b > Definition:< / b > sol2.c:87< / div > < / div >
< / div > <!-- fragment --> < div class = "dynheader" >
Here is the call graph for this function:< / div >
< div class = "dyncontent" >
2021-12-10 01:57:52 +08:00
< 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 >
2020-06-28 23:07:29 +08:00
< / div >
< / div >
< / div >
< / div >
< h2 class = "groupheader" > Variable Documentation< / h2 >
2021-10-26 03:34:27 +08:00
< a id = "af920a16d6ef69dd604b283f427892e06" name = "af920a16d6ef69dd604b283f427892e06" > < / a >
2020-06-28 23:07:29 +08:00
< 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" >
2020-06-29 04:40:24 +08:00
< 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). < / p >
2021-10-26 03:34:27 +08:00
< p > 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 >
2020-06-28 23:07:29 +08:00
< / 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 = "../../d4/dbd/problem__23_2sol2_8c.html" > sol2.c< / a > < / li >
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 >
2020-06-28 23:07:29 +08:00
< / ul >
< / div >
< / body >
< / html >
