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">
2022-09-08 08:17:03 +08:00
< html xmlns = "http://www.w3.org/1999/xhtml" lang = "en-US" >
2020-06-28 23:07:29 +08:00
< 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" / >
2022-09-08 08:17:03 +08:00
< meta name = "generator" content = "Doxygen 1.9.5" / >
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" >
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 >
2022-01-15 04:11:27 +08:00
< tr id = "projectrow" >
< td id = "projectalign" >
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 -->
2022-09-08 08:17:03 +08:00
<!-- Generated by Doxygen 1.9.5 -->
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 */
2022-09-08 08:17:03 +08:00
var searchBox = new SearchBox("searchBox", "../../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('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" >
2022-09-08 08:17:03 +08:00
< div id = "MSearchResults" >
< div class = "SRPage" >
< div id = "SRIndex" >
< div id = "SRResults" > < / div >
< div class = "SRStatus" id = "Loading" > Loading...< / div >
< div class = "SRStatus" id = "Searching" > Searching...< / div >
< div class = "SRStatus" id = "NoMatches" > No Matches< / div >
< / div >
< / div >
< / div >
2020-06-28 23:07:29 +08:00
< / div >
< div class = "header" >
< div class = "summary" >
2020-07-17 04:36:47 +08:00
< a href = "#func-members" > Functions< / a > < / div >
2021-10-26 03:34:27 +08:00
< div class = "headertitle" > < div class = "title" > sol1.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
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 sol1.c:< / div >
< div class = "dyncontent" >
2022-10-22 18:09:42 +08:00
< div class = "center" > < iframe scrolling = "no" frameborder = "0" src = "../../d4/d89/problem__23_2sol1_8c__incl.svg" width = "243" height = "124" > < 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 > < 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 >
2021-10-26 03:34:27 +08:00
< 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 N)< / td > < / tr >
< tr class = "memdesc:a1aca7f530f82b27100262adba9e7556b" > < td class = "mdescLeft" >   < / 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 >
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: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 N)< / td > < / tr >
< tr class = "memdesc:a4f128410e6582fe26488e2316cc96e17" > < td class = "mdescLeft" >   < / 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 >
2020-06-28 23:07:29 +08:00
< tr class = "separator:a4f128410e6582fe26488e2316cc96e17" > < 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 = "../../d7/ddb/problem__23_2sol1_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 = "../../d7/ddb/problem__23_2sol1_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 = "../../d7/ddb/problem__23_2sol1_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 = "../../d7/ddb/problem__23_2sol1_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 = "../../d7/ddb/problem__23_2sol1_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 = "../../d7/ddb/problem__23_2sol1_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 >
< 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 < / 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
< / div > < h2 class = "groupheader" > Function Documentation< / h2 >
2021-10-26 03:34:27 +08:00
< a id = "ac5d600bf3077f4188afc4c5cd2c40eaf" name = "ac5d600bf3077f4188afc4c5cd2c40eaf" > < / a >
2022-09-08 08:17:03 +08:00
< h2 class = "memtitle" > < span class = "permalink" > < a href = "#ac5d600bf3077f4188afc4c5cd2c40eaf" > ◆   < / a > < / span > get_next_abundant()< / h2 >
2021-10-26 03:34:27 +08:00
< 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 >
2022-01-15 04:11:27 +08:00
< div class = "fragment" > < div class = "line" > < span class = "lineno" > 56< / span > {< / div >
< div class = "line" > < span class = "lineno" > 57< / span > < span class = "keywordtype" > unsigned< / span > < span class = "keywordtype" > long< / span > i;< / div >
< div class = "line" > < 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" > < span class = "lineno" > 59< / span > {< / div >
< div class = "line" > < span class = "lineno" > 60< / span > ;< / div >
< div class = "line" > < span class = "lineno" > 61< / span > }< / div >
< div class = "line" > < span class = "lineno" > 62< / span > < span class = "keywordflow" > return< / span > i;< / div >
< div class = "line" > < span class = "lineno" > 63< / span > }< / div >
2021-10-26 03:34:27 +08:00
< 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" >
2022-09-08 08:17:03 +08:00
< div class = "center" > < iframe scrolling = "no" frameborder = "0" src = "../../d7/ddb/problem__23_2sol1_8c_ac5d600bf3077f4188afc4c5cd2c40eaf_cgraph.svg" width = "468" height = "36" > < 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 >
2022-09-08 08:17:03 +08:00
< h2 class = "memtitle" > < span class = "permalink" > < a href = "#a1aca7f530f82b27100262adba9e7556b" > ◆   < / a > < / span > get_perfect_number()< / h2 >
2021-10-26 03:34:27 +08:00
< 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 >
2022-01-15 04:11:27 +08:00
< div class = "fragment" > < div class = "line" > < span class = "lineno" > 20< / span > {< / div >
< div class = "line" > < span class = "lineno" > 21< / span > < span class = "keywordtype" > unsigned< / span > < span class = "keywordtype" > long< / span > sum = 1;< / div >
< div class = "line" > < span class = "lineno" > 22< / span > < span class = "keywordtype" > char< / span > ret = 0;< / div >
< div class = "line" > < span class = "lineno" > 23< / span > < / div >
< div class = "line" > < span class = "lineno" > 24< / 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" > < span class = "lineno" > 25< / span > {< / div >
< div class = "line" > < span class = "lineno" > 26< / span > < span class = "keywordflow" > if< / span > (N % i == 0)< / div >
< div class = "line" > < span class = "lineno" > 27< / span > {< / div >
< div class = "line" > < span class = "lineno" > 28< / span > sum += i;< / div >
< div class = "line" > < span class = "lineno" > 29< / span > < span class = "keywordtype" > unsigned< / span > < span class = "keywordtype" > long< / span > tmp = N / i;< / div >
< div class = "line" > < span class = "lineno" > 30< / span > < span class = "keywordflow" > if< / span > (tmp != i)< / div >
< div class = "line" > < span class = "lineno" > 31< / span > {< / div >
< div class = "line" > < span class = "lineno" > 32< / span > sum += tmp;< / div >
< div class = "line" > < span class = "lineno" > 33< / span > }< / div >
< div class = "line" > < span class = "lineno" > 34< / span > }< / div >
< div class = "line" > < span class = "lineno" > 35< / span > }< / div >
< div class = "line" > < span class = "lineno" > 36< / span > < / div >
< div class = "line" > < span class = "lineno" > 37< / span > ret = sum == N ? 0 : (sum > N ? 1 : -1);< / div >
< div class = "line" > < span class = "lineno" > 38< / span > < span class = "comment" > // #ifdef DEBUG< / span > < / div >
< div class = "line" > < span class = "lineno" > 39< / span > < span class = "comment" > // printf(" %5lu: %5lu : %d\n" , N, sum, ret);< / span > < / div >
< div class = "line" > < span class = "lineno" > 40< / span > < span class = "comment" > // #endif< / span > < / div >
< div class = "line" > < span class = "lineno" > 41< / span > < span class = "keywordflow" > return< / span > ret;< / div >
< div class = "line" > < span class = "lineno" > 42< / span > }< / div >
2021-10-26 03:34:27 +08:00
< / div > <!-- fragment -->
< / div >
< / div >
< a id = "a4f128410e6582fe26488e2316cc96e17" name = "a4f128410e6582fe26488e2316cc96e17" > < / a >
2022-09-08 08:17:03 +08:00
< h2 class = "memtitle" > < span class = "permalink" > < a href = "#a4f128410e6582fe26488e2316cc96e17" > ◆   < / a > < / span > is_abundant()< / h2 >
2021-10-26 03:34:27 +08:00
< 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 >
2022-01-15 04:11:27 +08:00
< div class = "fragment" > < div class = "line" > < span class = "lineno" > 48< / span > {< / div >
< div class = "line" > < 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" > < span class = "lineno" > 50< / span > }< / div >
2021-10-26 03:34:27 +08:00
< 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" >
2022-09-08 08:17:03 +08:00
< div class = "center" > < iframe scrolling = "no" frameborder = "0" src = "../../d7/ddb/problem__23_2sol1_8c_a4f128410e6582fe26488e2316cc96e17_cgraph.svg" width = "288" height = "36" > < 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 = "a3ab61b5a1c4f2288625d160aa0ea8478" name = "a3ab61b5a1c4f2288625d160aa0ea8478" > < / a >
2022-09-08 08:17:03 +08:00
< h2 class = "memtitle" > < span class = "permalink" > < a href = "#a3ab61b5a1c4f2288625d160aa0ea8478" > ◆   < / a > < / span > is_sum_of_abundant()< / h2 >
2020-06-28 23:07:29 +08:00
< 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 >
2022-01-15 04:11:27 +08:00
< div class = "fragment" > < div class = "line" > < span class = "lineno" > 72< / span > {< / div >
< div class = "line" > < span class = "lineno" > 73< / span > < span class = "comment" > /* optimized logic:< / span > < / div >
< div class = "line" > < span class = "lineno" > 74< / span > < span class = "comment" > * i + j = N where both i and j should be abundant< / span > < / div >
< div class = "line" > < 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" > < span class = "lineno" > 76< / span > < span class = "comment" > */< / span > < / div >
< div class = "line" > < 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 < = (N > > 1);< / div >
< div class = "line" > < 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" > < span class = "lineno" > 79< / span > {< / div >
< div class = "line" > < 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" > < span class = "lineno" > 81< / span > {< / div >
< div class = "line" > < span class = "lineno" > 82< / span > < span class = "preprocessor" > #ifdef DEBUG< / span > < / div >
< div class = "line" > < span class = "lineno" > 83< / span > printf(< span class = "stringliteral" > " \t%4lu + %4lu = %4lu\n" < / span > , i, N - i, N);< / div >
< div class = "line" > < span class = "lineno" > 84< / span > < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < span class = "lineno" > 85< / span > < span class = "keywordflow" > return< / span > 1;< / div >
< div class = "line" > < span class = "lineno" > 86< / span > }< / div >
< div class = "line" > < span class = "lineno" > 87< / span > }< / div >
< div class = "line" > < span class = "lineno" > 88< / span > < span class = "keywordflow" > return< / span > 0;< / div >
< div class = "line" > < span class = "lineno" > 89< / span > }< / div >
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 >
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" >
2022-09-08 08:17:03 +08:00
< div class = "center" > < iframe scrolling = "no" frameborder = "0" src = "../../d7/ddb/problem__23_2sol1_8c_a3ab61b5a1c4f2288625d160aa0ea8478_cgraph.svg" width = "659" height = "62" > < 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 >
2022-09-08 08:17:03 +08:00
< h2 class = "memtitle" > < span class = "permalink" > < a href = "#a3c04138a5bfe5d72780bb7e82a18e627" > ◆   < / a > < / span > main()< / h2 >
2021-10-26 03:34:27 +08:00
< 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 >
2022-01-15 04:11:27 +08:00
< div class = "fragment" > < div class = "line" > < span class = "lineno" > 93< / span > {< / div >
< div class = "line" > < 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" > < span class = "lineno" > 95< / span > < / div >
< div class = "line" > < span class = "lineno" > 96< / span > < span class = "keywordtype" > unsigned< / span > < span class = "keywordtype" > long< / span > sum = 0;< / div >
< div class = "line" > < span class = "lineno" > 97< / span > < span class = "keywordflow" > if< / span > (argc == 2)< / div >
< div class = "line" > < span class = "lineno" > 98< / span > {< / div >
< div class = "line" > < span class = "lineno" > 99< / span > MAX_N = strtoul(argv[1], NULL, 10);< / div >
< div class = "line" > < span class = "lineno" > 100< / span > }< / div >
< div class = "line" > < span class = "lineno" > 101< / span > < / div >
< div class = "line" > < span class = "lineno" > 102< / span > < span class = "preprocessor" > #ifdef _OPENMP< / span > < / div >
< div class = "line" > < span class = "lineno" > 103< / span > printf(< span class = "stringliteral" > " Using OpenMP parallleization with %d threads\n" < / span > ,< / div >
< div class = "line" > < span class = "lineno" > 104< / span > omp_get_max_threads());< / div >
< div class = "line" > < span class = "lineno" > 105< / span > < span class = "preprocessor" > #else< / span > < / div >
< div class = "line" > < span class = "lineno" > 106< / span > printf(< span class = "stringliteral" > " Not using parallleization!\n" < / span > );< / div >
< div class = "line" > < span class = "lineno" > 107< / span > < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < span class = "lineno" > 108< / span > < / div >
< div class = "line" > < span class = "lineno" > 109< / span > < span class = "keywordtype" > double< / span > total_duration = 0.f;< / div >
< div class = "line" > < span class = "lineno" > 110< / span > < span class = "keywordtype" > long< / span > i;< / div >
< div class = "line" > < span class = "lineno" > 111< / span > < span class = "preprocessor" > #ifdef _OPENMP< / span > < / div >
< div class = "line" > < span class = "lineno" > 112< / span > < span class = "preprocessor" > #pragma omp parallel for reduction(+ : sum) schedule(runtime)< / span > < / div >
< div class = "line" > < span class = "lineno" > 113< / span > < span class = "preprocessor" > #endif< / span > < / div >
< div class = "line" > < span class = "lineno" > 114< / span > < span class = "keywordflow" > for< / span > (i = 1; i < = MAX_N; i++)< / div >
< div class = "line" > < span class = "lineno" > 115< / span > {< / div >
< div class = "line" > < span class = "lineno" > 116< / span > clock_t start_time = clock();< / div >
< div class = "line" > < 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" > < span class = "lineno" > 118< / span > {< / div >
< div class = "line" > < span class = "lineno" > 119< / span > sum += i;< / div >
< div class = "line" > < span class = "lineno" > 120< / span > }< / div >
< div class = "line" > < span class = "lineno" > 121< / span > clock_t end_time = clock();< / div >
< div class = "line" > < span class = "lineno" > 122< / span > total_duration += (double)(end_time - start_time) / CLOCKS_PER_SEC;< / div >
< div class = "line" > < span class = "lineno" > 123< / span > < / div >
< div class = "line" > < span class = "lineno" > 124< / span > printf(< span class = "stringliteral" > " ... %5lu: %8lu\r" < / span > , i, sum);< / div >
< div class = "line" > < span class = "lineno" > 125< / span > < span class = "keywordflow" > if< / span > (i % 100 == 0)< / div >
< div class = "line" > < span class = "lineno" > 126< / span > {< / div >
< div class = "line" > < span class = "lineno" > 127< / span > fflush(stdout);< / div >
< div class = "line" > < span class = "lineno" > 128< / span > }< / div >
< div class = "line" > < span class = "lineno" > 129< / span > }< / div >
< div class = "line" > < span class = "lineno" > 130< / span > < / div >
< div class = "line" > < span class = "lineno" > 131< / span > printf(< span class = "stringliteral" > " Time taken: %.4g s\n" < / span > , total_duration);< / div >
< div class = "line" > < span class = "lineno" > 132< / span > printf(< / div >
< div class = "line" > < span class = "lineno" > 133< / span > < span class = "stringliteral" > " Sum of numbers that cannot be represented as sum of two abundant " < / span > < / div >
< div class = "line" > < span class = "lineno" > 134< / span > < span class = "stringliteral" > " numbers : %lu\n" < / span > ,< / div >
< div class = "line" > < span class = "lineno" > 135< / span > sum);< / div >
< div class = "line" > < span class = "lineno" > 136< / span > < / div >
< div class = "line" > < span class = "lineno" > 137< / span > < span class = "keywordflow" > return< / span > 0;< / div >
< div class = "line" > < span class = "lineno" > 138< / span > }< / div >
2021-10-26 03:34:27 +08:00
< 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 >
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 >
2022-09-08 08:17:03 +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.5 < / li >
2020-06-28 23:07:29 +08:00
< / ul >
< / div >
< / body >
< / html >
