mirror of
https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git
synced 2023-10-11 15:56:24 +08:00
215 lines
13 KiB
HTML
215 lines
13 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=11"/>
|
|
<meta name="generator" content="Doxygen 1.9.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Algorithms_in_C: project_euler/problem_16/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 id="projectrow">
|
|
<td id="projectalign">
|
|
<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.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
|
|
/* @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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('d6/d88/problem__16_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> </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=16" target="_blank">Problem 16</a> solution
|
|
<a href="#details">More...</a></p>
|
|
<div class="textblock"><code>#include <math.h></code><br />
|
|
<code>#include <stdint.h></code><br />
|
|
<code>#include <stdio.h></code><br />
|
|
<code>#include <stdlib.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="../../dc/d52/problem__16_2sol1_8c__incl.svg" width="338" 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 id="func-members" name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d88/problem__16_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="../../d6/d88/problem__16_2sol1_8c.html#a3c04138a5bfe5d72780bb7e82a18e627">More...</a><br /></td></tr>
|
|
<tr class="separator:a3c04138a5bfe5d72780bb7e82a18e627"><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=16" target="_blank">Problem 16</a> solution </p>
|
|
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
|
|
</div><h2 class="groupheader">Function Documentation</h2>
|
|
<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"><span class="lineno"> 13</span>{</div>
|
|
<div class="line"><span class="lineno"> 14</span> <span class="keyword">const</span> <span class="keywordtype">double</span> tmp = log(10) / log(2); <span class="comment">/* required to get number of digits */</span></div>
|
|
<div class="line"><span class="lineno"> 15</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> MAX_NUM_DIGITS;</div>
|
|
<div class="line"><span class="lineno"> 16</span> uint8_t *digits =</div>
|
|
<div class="line"><span class="lineno"> 17</span> NULL; <span class="comment">/* array to store individual digits. index 0 = units place */</span></div>
|
|
<div class="line"><span class="lineno"> 18</span> <span class="keywordtype">int</span> N = 1000, sum = 0;</div>
|
|
<div class="line"><span class="lineno"> 19</span> </div>
|
|
<div class="line"><span class="lineno"> 20</span> <span class="keywordflow">if</span> (argc == 2)</div>
|
|
<div class="line"><span class="lineno"> 21</span> N = atoi(argv[1]);</div>
|
|
<div class="line"><span class="lineno"> 22</span> </div>
|
|
<div class="line"><span class="lineno"> 23</span> MAX_NUM_DIGITS = (N + tmp) / tmp;</div>
|
|
<div class="line"><span class="lineno"> 24</span> </div>
|
|
<div class="line"><span class="lineno"> 25</span> digits = <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a>(MAX_NUM_DIGITS, <span class="keyword">sizeof</span>(uint8_t));</div>
|
|
<div class="line"><span class="lineno"> 26</span> digits[0] = 1;</div>
|
|
<div class="line"><span class="lineno"> 27</span> </div>
|
|
<div class="line"><span class="lineno"> 28</span> <span class="keywordflow">if</span> (!digits)</div>
|
|
<div class="line"><span class="lineno"> 29</span> {</div>
|
|
<div class="line"><span class="lineno"> 30</span> perror(<span class="stringliteral">"Unable to allocate memory!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 31</span> <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><span class="lineno"> 32</span> }</div>
|
|
<div class="line"><span class="lineno"> 33</span> </div>
|
|
<div class="line"><span class="lineno"> 34</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++)</div>
|
|
<div class="line"><span class="lineno"> 35</span> {</div>
|
|
<div class="line"><span class="lineno"> 36</span> <span class="keywordtype">int</span> carry = 0;</div>
|
|
<div class="line"><span class="lineno"> 37</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < MAX_NUM_DIGITS; j++)</div>
|
|
<div class="line"><span class="lineno"> 38</span> {</div>
|
|
<div class="line"><span class="lineno"> 39</span> digits[j] = (digits[j] << 1) + carry; <span class="comment">/* digit * 2 + carry */</span></div>
|
|
<div class="line"><span class="lineno"> 40</span> <span class="comment">// printf("\t value: %d\t", digits[j]);</span></div>
|
|
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">if</span> (digits[j] > 9)</div>
|
|
<div class="line"><span class="lineno"> 42</span> {</div>
|
|
<div class="line"><span class="lineno"> 43</span> carry = 1;</div>
|
|
<div class="line"><span class="lineno"> 44</span> digits[j] -= 10;</div>
|
|
<div class="line"><span class="lineno"> 45</span> }</div>
|
|
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">else</span></div>
|
|
<div class="line"><span class="lineno"> 47</span> carry = 0;</div>
|
|
<div class="line"><span class="lineno"> 48</span> <span class="comment">// printf("carry: %d\t value: %d\n", carry, digits[j]);</span></div>
|
|
<div class="line"><span class="lineno"> 49</span> </div>
|
|
<div class="line"><span class="lineno"> 50</span> <span class="comment">/* accumulate sum for last multiplication */</span></div>
|
|
<div class="line"><span class="lineno"> 51</span> <span class="keywordflow">if</span> (i == N - 1)</div>
|
|
<div class="line"><span class="lineno"> 52</span> sum += digits[j];</div>
|
|
<div class="line"><span class="lineno"> 53</span> }</div>
|
|
<div class="line"><span class="lineno"> 54</span> }</div>
|
|
<div class="line"><span class="lineno"> 55</span> </div>
|
|
<div class="line"><span class="lineno"> 56</span> printf(<span class="stringliteral">"2^%d = "</span>, N);</div>
|
|
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = MAX_NUM_DIGITS - 1; i >= 0; i--) putchar(digits[i] + 0x30);</div>
|
|
<div class="line"><span class="lineno"> 58</span> printf(<span class="stringliteral">"\n\t Sum: %d\t Num. digits: %lu\n"</span>, sum, MAX_NUM_DIGITS);</div>
|
|
<div class="line"><span class="lineno"> 59</span> </div>
|
|
<div class="line"><span class="lineno"> 60</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(digits);</div>
|
|
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><span class="lineno"> 62</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><!-- fragment -->
|
|
</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_18cba55772148686552805a354a79093.html">problem_16</a></li><li class="navelem"><a class="el" href="../../d6/d88/problem__16_2sol1_8c.html">sol1.c</a></li>
|
|
<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.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|