mirror of
https://github.com/TheAlgorithms/C
synced 2024-12-12 14:47:08 +03:00
280 lines
17 KiB
HTML
280 lines
17 KiB
HTML
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
||
|
<head>
|
||
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
||
|
<meta name="generator" content="Doxygen 1.8.20"/>
|
||
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||
|
<title>Algorithms_in_C: project_euler/problem_5/sol3.c File Reference</title>
|
||
|
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||
|
<script type="text/javascript" src="../../jquery.js"></script>
|
||
|
<script type="text/javascript" src="../../dynsections.js"></script>
|
||
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||
|
<script type="text/javascript" src="../../resize.js"></script>
|
||
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||
|
<script type="text/javascript" src="../../navtree.js"></script>
|
||
|
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||
|
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||
|
<script type="text/javascript" src="../../search/search.js"></script>
|
||
|
<script type="text/x-mathjax-config">
|
||
|
MathJax.Hub.Config({
|
||
|
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||
|
jax: ["input/TeX","output/HTML-CSS"],
|
||
|
});
|
||
|
</script>
|
||
|
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||
|
</head>
|
||
|
<body>
|
||
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||
|
<div id="titlearea">
|
||
|
<table cellspacing="0" cellpadding="0">
|
||
|
<tbody>
|
||
|
<tr style="height: 56px;">
|
||
|
<td id="projectalign" style="padding-left: 0.5em;">
|
||
|
<div id="projectname">Algorithms_in_C
|
||
|
 <span id="projectnumber">1.0.0</span>
|
||
|
</div>
|
||
|
<div id="projectbrief">Set of algorithms implemented in C.</div>
|
||
|
</td>
|
||
|
</tr>
|
||
|
</tbody>
|
||
|
</table>
|
||
|
</div>
|
||
|
<!-- end header part -->
|
||
|
<!-- Generated by Doxygen 1.8.20 -->
|
||
|
<script type="text/javascript">
|
||
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||
|
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||
|
/* @license-end */
|
||
|
</script>
|
||
|
<script type="text/javascript" src="../../menudata.js"></script>
|
||
|
<script type="text/javascript" src="../../menu.js"></script>
|
||
|
<script type="text/javascript">
|
||
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||
|
$(function() {
|
||
|
initMenu('../../',true,false,'search.php','Search');
|
||
|
$(document).ready(function() { init_search(); });
|
||
|
});
|
||
|
/* @license-end */</script>
|
||
|
<div id="main-nav"></div>
|
||
|
</div><!-- top -->
|
||
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||
|
<div id="nav-tree">
|
||
|
<div id="nav-tree-contents">
|
||
|
<div id="nav-sync" class="sync"></div>
|
||
|
</div>
|
||
|
</div>
|
||
|
<div id="splitbar" style="-moz-user-select:none;"
|
||
|
class="ui-resizable-handle">
|
||
|
</div>
|
||
|
</div>
|
||
|
<script type="text/javascript">
|
||
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||
|
$(document).ready(function(){initNavTree('d5/d7c/problem__5_2sol3_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">sol3.c File Reference</div> </div>
|
||
|
</div><!--header-->
|
||
|
<div class="contents">
|
||
|
|
||
|
<p><a href="https://projecteuler.net/problem=5">Problem 5</a> solution (Fastest).
|
||
|
<a href="#details">More...</a></p>
|
||
|
<div class="textblock"><code>#include <stdio.h></code><br />
|
||
|
</div><div class="textblock"><div class="dynheader">
|
||
|
Include dependency graph for sol3.c:</div>
|
||
|
<div class="dyncontent">
|
||
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d9e/problem__5_2sol3_8c__incl.svg" width="158" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||
|
</div>
|
||
|
</div>
|
||
|
</div><table class="memberdecls">
|
||
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||
|
Functions</h2></td></tr>
|
||
|
<tr class="memitem:a59347107cbfdf48d51108e50280e760d"><td class="memItemLeft" align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d">gcd</a> (unsigned long a, unsigned long b)</td></tr>
|
||
|
<tr class="memdesc:a59347107cbfdf48d51108e50280e760d"><td class="mdescLeft"> </td><td class="mdescRight">Compute <a href="https://en.wikipedia.org/wiki/Greatest_common_divisor">Greatest Common Divisor (GCD)</a> of two numbers using Euclids algorithm. <a href="../../d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d">More...</a><br /></td></tr>
|
||
|
<tr class="separator:a59347107cbfdf48d51108e50280e760d"><td class="memSeparator" colspan="2"> </td></tr>
|
||
|
<tr class="memitem:ae9606f1867e9921867d6572f51377b4c"><td class="memItemLeft" align="right" valign="top">unsigned long </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c">lcm</a> (unsigned long a, unsigned long b)</td></tr>
|
||
|
<tr class="memdesc:ae9606f1867e9921867d6572f51377b4c"><td class="mdescLeft"> </td><td class="mdescRight">Compute <a href="https://en.wikipedia.org/wiki/Least_common_multiple">Least Common Multiple (LCM)</a> of two numbers. <a href="../../d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c">More...</a><br /></td></tr>
|
||
|
<tr class="separator:ae9606f1867e9921867d6572f51377b4c"><td class="memSeparator" colspan="2"> </td></tr>
|
||
|
<tr class="memitem:a840291bc02cba5474a4cb46a9b9566fe"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d7c/problem__5_2sol3_8c.html#a840291bc02cba5474a4cb46a9b9566fe">main</a> (void)</td></tr>
|
||
|
<tr class="memdesc:a840291bc02cba5474a4cb46a9b9566fe"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <a href="../../d5/d7c/problem__5_2sol3_8c.html#a840291bc02cba5474a4cb46a9b9566fe">More...</a><br /></td></tr>
|
||
|
<tr class="separator:a840291bc02cba5474a4cb46a9b9566fe"><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=5">Problem 5</a> solution (Fastest). </p>
|
||
|
<p>Solution is the LCM of all numbers between 1 and 20.</p>
|
||
|
<dl class="section see"><dt>See also</dt><dd>Slowest: <a class="el" href="../../dc/d32/problem__5_2sol1_8c.html" title="Problem 5 solution - Naive algorithm (slowest)">problem_5/sol1.c</a> </dd>
|
||
|
<dd>
|
||
|
Slower: <a class="el" href="../../d5/d3d/problem__5_2sol2_8c.html" title="Problem 5 solution - Naive algorithm (Improved over problem_5/sol1.c)">problem_5/sol2.c</a> </dd></dl>
|
||
|
</div><h2 class="groupheader">Function Documentation</h2>
|
||
|
<a id="a59347107cbfdf48d51108e50280e760d"></a>
|
||
|
<h2 class="memtitle"><span class="permalink"><a href="#a59347107cbfdf48d51108e50280e760d">◆ </a></span>gcd()</h2>
|
||
|
|
||
|
<div class="memitem">
|
||
|
<div class="memproto">
|
||
|
<table class="memname">
|
||
|
<tr>
|
||
|
<td class="memname">unsigned long gcd </td>
|
||
|
<td>(</td>
|
||
|
<td class="paramtype">unsigned long </td>
|
||
|
<td class="paramname"><em>a</em>, </td>
|
||
|
</tr>
|
||
|
<tr>
|
||
|
<td class="paramkey"></td>
|
||
|
<td></td>
|
||
|
<td class="paramtype">unsigned long </td>
|
||
|
<td class="paramname"><em>b</em> </td>
|
||
|
</tr>
|
||
|
<tr>
|
||
|
<td></td>
|
||
|
<td>)</td>
|
||
|
<td></td><td></td>
|
||
|
</tr>
|
||
|
</table>
|
||
|
</div><div class="memdoc">
|
||
|
|
||
|
<p>Compute <a href="https://en.wikipedia.org/wiki/Greatest_common_divisor">Greatest Common Divisor (GCD)</a> of two numbers using Euclids algorithm. </p>
|
||
|
<dl class="params"><dt>Parameters</dt><dd>
|
||
|
<table class="params">
|
||
|
<tr><td class="paramname">a</td><td>first number </td></tr>
|
||
|
<tr><td class="paramname">b</td><td>second number </td></tr>
|
||
|
</table>
|
||
|
</dd>
|
||
|
</dl>
|
||
|
<dl class="section return"><dt>Returns</dt><dd>GCD of <code>a</code> and <code>b</code> </dd></dl>
|
||
|
<div class="fragment"><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> {</div>
|
||
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> r;</div>
|
||
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  <span class="keywordflow">if</span> (a > b)</div>
|
||
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  {</div>
|
||
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> t = a;</div>
|
||
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  a = b;</div>
|
||
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  b = t;</div>
|
||
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  }</div>
|
||
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keywordflow">while</span> ((r = (a % b)))</div>
|
||
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  {</div>
|
||
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  a = b;</div>
|
||
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  b = r;</div>
|
||
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  }</div>
|
||
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keywordflow">return</span> b;</div>
|
||
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> }</div>
|
||
|
</div><!-- fragment -->
|
||
|
</div>
|
||
|
</div>
|
||
|
<a id="ae9606f1867e9921867d6572f51377b4c"></a>
|
||
|
<h2 class="memtitle"><span class="permalink"><a href="#ae9606f1867e9921867d6572f51377b4c">◆ </a></span>lcm()</h2>
|
||
|
|
||
|
<div class="memitem">
|
||
|
<div class="memproto">
|
||
|
<table class="memname">
|
||
|
<tr>
|
||
|
<td class="memname">unsigned long lcm </td>
|
||
|
<td>(</td>
|
||
|
<td class="paramtype">unsigned long </td>
|
||
|
<td class="paramname"><em>a</em>, </td>
|
||
|
</tr>
|
||
|
<tr>
|
||
|
<td class="paramkey"></td>
|
||
|
<td></td>
|
||
|
<td class="paramtype">unsigned long </td>
|
||
|
<td class="paramname"><em>b</em> </td>
|
||
|
</tr>
|
||
|
<tr>
|
||
|
<td></td>
|
||
|
<td>)</td>
|
||
|
<td></td><td></td>
|
||
|
</tr>
|
||
|
</table>
|
||
|
</div><div class="memdoc">
|
||
|
|
||
|
<p>Compute <a href="https://en.wikipedia.org/wiki/Least_common_multiple">Least Common Multiple (LCM)</a> of two numbers. </p>
|
||
|
<dl class="params"><dt>Parameters</dt><dd>
|
||
|
<table class="params">
|
||
|
<tr><td class="paramname">a</td><td>first number </td></tr>
|
||
|
<tr><td class="paramname">b</td><td>second number </td></tr>
|
||
|
</table>
|
||
|
</dd>
|
||
|
</dl>
|
||
|
<dl class="section return"><dt>Returns</dt><dd>LCM of <code>a</code> and <code>b</code> </dd></dl>
|
||
|
<div class="fragment"><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> {</div>
|
||
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> p = (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> long)a * b;</div>
|
||
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">return</span> p / <a class="code" href="../../d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d">gcd</a>(a, b);</div>
|
||
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> }</div>
|
||
|
</div><!-- fragment --><div class="dynheader">
|
||
|
Here is the call graph for this function:</div>
|
||
|
<div class="dyncontent">
|
||
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d7c/problem__5_2sol3_8c_ae9606f1867e9921867d6572f51377b4c_cgraph.svg" width="144" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||
|
</div>
|
||
|
</div>
|
||
|
|
||
|
</div>
|
||
|
</div>
|
||
|
<a id="a840291bc02cba5474a4cb46a9b9566fe"></a>
|
||
|
<h2 class="memtitle"><span class="permalink"><a href="#a840291bc02cba5474a4cb46a9b9566fe">◆ </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">void </td>
|
||
|
<td class="paramname"></td><td>)</td>
|
||
|
<td></td>
|
||
|
</tr>
|
||
|
</table>
|
||
|
</div><div class="memdoc">
|
||
|
|
||
|
<p>Main function. </p>
|
||
|
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||
|
<div class="fragment"><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> {</div>
|
||
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> ans = 1;</div>
|
||
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> i;</div>
|
||
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">for</span> (i = 1; i <= 20; i++)</div>
|
||
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  {</div>
|
||
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  ans = <a class="code" href="../../d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c">lcm</a>(ans, i);</div>
|
||
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  }</div>
|
||
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  printf(<span class="stringliteral">"%lu\n"</span>, ans);</div>
|
||
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">return</span> 0;</div>
|
||
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> }</div>
|
||
|
</div><!-- fragment --><div class="dynheader">
|
||
|
Here is the call graph for this function:</div>
|
||
|
<div class="dyncontent">
|
||
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d7c/problem__5_2sol3_8c_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg" width="243" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||
|
</div>
|
||
|
</div>
|
||
|
|
||
|
</div>
|
||
|
</div>
|
||
|
</div><!-- contents -->
|
||
|
</div><!-- doc-content -->
|
||
|
<div class="ttc" id="aproblem__5_2sol3_8c_html_ae9606f1867e9921867d6572f51377b4c"><div class="ttname"><a href="../../d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c">lcm</a></div><div class="ttdeci">unsigned long lcm(unsigned long a, unsigned long b)</div><div class="ttdoc">Compute Least Common Multiple (LCM) of two numbers.</div><div class="ttdef"><b>Definition:</b> sol3.c:41</div></div>
|
||
|
<div class="ttc" id="aproblem__5_2sol3_8c_html_a59347107cbfdf48d51108e50280e760d"><div class="ttname"><a href="../../d5/d7c/problem__5_2sol3_8c.html#a59347107cbfdf48d51108e50280e760d">gcd</a></div><div class="ttdeci">unsigned long gcd(unsigned long a, unsigned long b)</div><div class="ttdoc">Compute Greatest Common Divisor (GCD) of two numbers using Euclids algorithm.</div><div class="ttdef"><b>Definition:</b> sol3.c:18</div></div>
|
||
|
<!-- start footer part -->
|
||
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||
|
<ul>
|
||
|
<li class="navelem"><a class="el" href="../../dir_b3d331eabd4234f247030c297aaf021c.html">project_euler</a></li><li class="navelem"><a class="el" href="../../dir_607f15d36c772334f988bb9ef82d102c.html">problem_5</a></li><li class="navelem"><a class="el" href="../../d5/d7c/problem__5_2sol3_8c.html">sol3.c</a></li>
|
||
|
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </li>
|
||
|
</ul>
|
||
|
</div>
|
||
|
</body>
|
||
|
</html>
|