mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-24 05:42:59 +08:00
Documentation for e3f0551f98
This commit is contained in:
github-actions
@@ -98,12 +98,13 @@ $(document).ready(function(){initNavTree('d5/df6/check__amicable__pair_8cpp.html
|
||||
|
||||
<div class="header">
|
||||
<div class="summary">
|
||||
<a href="#namespaces">Namespaces</a> |
|
||||
<a href="#func-members">Functions</a> </div>
|
||||
<div class="headertitle"><div class="title">check_amicable_pair.cpp File Reference</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>A C++ Program to check whether a pair of number is <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not.
|
||||
<p>A C++ Program to check whether a pair of numbers is an <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not.
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <cassert></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
@@ -113,68 +114,33 @@ Include dependency graph for check_amicable_pair.cpp:</div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d0c/check__amicable__pair_8cpp__incl.svg" width="171" height="126"><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="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
|
||||
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft"> </td><td class="mdescRight">for IO operations <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><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:ac656a51b4c3bd7d63b7dcc75dc3e5576"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576">sum_of_divisor</a> (int num)</td></tr>
|
||||
<tr class="separator:ac656a51b4c3bd7d63b7dcc75dc3e5576"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:afeb67e204ec7de02ad152c11df4d1e01"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a> (int x, int y)</td></tr>
|
||||
<tr class="separator:afeb67e204ec7de02ad152c11df4d1e01"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae1a3968e7947464bee7714f6d43b7002"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a> ()</td></tr>
|
||||
<tr class="separator:ae1a3968e7947464bee7714f6d43b7002"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:af05567415a9ea36c254b54e3d5a2152a"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">math::sum_of_divisor</a> (int num)</td></tr>
|
||||
<tr class="memdesc:af05567415a9ea36c254b54e3d5a2152a"><td class="mdescLeft"> </td><td class="mdescRight">Function to calculate the sum of all the proper divisor of an integer. <br /></td></tr>
|
||||
<tr class="separator:af05567415a9ea36c254b54e3d5a2152a"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a8e6eede206201db0d1dbb618fa969bec"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a> (int x, int y)</td></tr>
|
||||
<tr class="memdesc:a8e6eede206201db0d1dbb618fa969bec"><td class="mdescLeft"> </td><td class="mdescRight">Function to check whether the pair is amicable or not. <br /></td></tr>
|
||||
<tr class="separator:a8e6eede206201db0d1dbb618fa969bec"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
|
||||
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft"> </td><td class="mdescRight">Self-test implementations. <br /></td></tr>
|
||||
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <br /></td></tr>
|
||||
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><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 C++ Program to check whether a pair of number is <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not. </p>
|
||||
<p>Amicable Pair are two positive integers such that sum of the proper divisor of each number is equal to the other number. </p><dl class="section author"><dt>Author</dt><dd>iamnambiar </dd></dl>
|
||||
<div class="textblock"><p>A C++ Program to check whether a pair of numbers is an <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not. </p>
|
||||
<p>An Amicable Pair is two positive integers such that the sum of the proper divisor for each number is equal to the other number.</p>
|
||||
<dl class="section note"><dt>Note</dt><dd>Remember that a proper divisor is any positive whole number that divides into a selected number, apart from the selected number itself, and returns a positive integer. for example 1, 2 and 5 are all proper divisors of 10.</dd></dl>
|
||||
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/iamnambiar" target="_blank">iamnambiar</a> </dd></dl>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="afeb67e204ec7de02ad152c11df4d1e01" name="afeb67e204ec7de02ad152c11df4d1e01"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#afeb67e204ec7de02ad152c11df4d1e01">◆ </a></span>are_amicable()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool are_amicable </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>x</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>y</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Function to check whether the pair is amicable or not. </p><dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">x</td><td>First number. </td></tr>
|
||||
<tr><td class="paramname">y</td><td>Second number. </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if the pair is amicable </dd>
|
||||
<dd>
|
||||
<code>false</code> if the pair is not amicable </dd></dl>
|
||||
<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="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576">sum_of_divisor</a>(x) == y) && (<a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576">sum_of_divisor</a>(y) == x);</div>
|
||||
<div class="line"><span class="lineno"> 50</span>}</div>
|
||||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_ac656a51b4c3bd7d63b7dcc75dc3e5576"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576">sum_of_divisor</a></div><div class="ttdeci">int sum_of_divisor(int num)</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:21</div></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/df6/check__amicable__pair_8cpp_afeb67e204ec7de02ad152c11df4d1e01_cgraph.svg" width="267" height="36"><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="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
|
||||
@@ -190,97 +156,63 @@ Here is the call graph for this function:</div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Main Function </p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 68</span> {</div>
|
||||
<div class="line"><span class="lineno"> 69</span> <a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
|
||||
<div class="line"><span class="lineno"> 70</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Assertion Success."</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 72</span>}</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:56</div></div>
|
||||
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 81</span> {</div>
|
||||
<div class="line"><span class="lineno"> 82</span> <a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// perform self-tests implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 84</span>}</div>
|
||||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:67</div></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/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="483" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="536" height="86"><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="ac656a51b4c3bd7d63b7dcc75dc3e5576" name="ac656a51b4c3bd7d63b7dcc75dc3e5576"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ac656a51b4c3bd7d63b7dcc75dc3e5576">◆ </a></span>sum_of_divisor()</h2>
|
||||
<a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">◆ </a></span>tests()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">int sum_of_divisor </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>num</em></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Function to calculate the sum of all the proper divisor of an integer. </p><dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">num</td><td>First number. </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>Sum of the proper divisor of the number. </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 21</span> {</div>
|
||||
<div class="line"><span class="lineno"> 22</span> <span class="comment">// Variable to store the sum of all proper divisors.</span></div>
|
||||
<div class="line"><span class="lineno"> 23</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = 0;</div>
|
||||
<div class="line"><span class="lineno"> 24</span> <span class="comment">// Below loop condition helps to reduce Time complexity by a factor of</span></div>
|
||||
<div class="line"><span class="lineno"> 25</span> <span class="comment">// square root of the number.</span></div>
|
||||
<div class="line"><span class="lineno"> 26</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> div = 2; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">div</a> * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">div</a> <= num; ++<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">div</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 27</span> <span class="comment">// Check 'div' is divisor of 'num'.</span></div>
|
||||
<div class="line"><span class="lineno"> 28</span> <span class="keywordflow">if</span> (num % div == 0) {</div>
|
||||
<div class="line"><span class="lineno"> 29</span> <span class="comment">// If both divisor are same, add once to 'sum'</span></div>
|
||||
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">if</span> (div == (num / div)) {</div>
|
||||
<div class="line"><span class="lineno"> 31</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> += <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">div</a>;</div>
|
||||
<div class="line"><span class="lineno"> 32</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 33</span> <span class="comment">// If both divisor are not the same, add both to 'sum'.</span></div>
|
||||
<div class="line"><span class="lineno"> 34</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> += (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">div</a> + (num / <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">div</a>));</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> }</div>
|
||||
<div class="line"><span class="lineno"> 38</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> + 1;</div>
|
||||
<div class="line"><span class="lineno"> 39</span>}</div>
|
||||
<div class="ttc" id="adiv_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/div.html">std::div</a></div><div class="ttdeci">T div(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector< std::valarray< T > > &A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="ae1a3968e7947464bee7714f6d43b7002" name="ae1a3968e7947464bee7714f6d43b7002"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae1a3968e7947464bee7714f6d43b7002">◆ </a></span>test()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void test </td>
|
||||
<td class="memname">static void tests </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">static</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Function for testing the is_amicable() with all the test cases. </p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 56</span> {</div>
|
||||
<div class="line"><span class="lineno"> 57</span> <span class="comment">// are_amicable(220, 284) returns true.</span></div>
|
||||
<div class="line"><span class="lineno"> 58</span> assert(<a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a>(220, 284) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 59</span> <span class="comment">// are_amicable(6232, 6368) returns true.</span></div>
|
||||
<div class="line"><span class="lineno"> 60</span> assert(<a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a>(6368, 6232) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 61</span> <span class="comment">// are_amicable(458, 232) returns false.</span></div>
|
||||
<div class="line"><span class="lineno"> 62</span> assert(<a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a>(458, 232) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 63</span>}</div>
|
||||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_afeb67e204ec7de02ad152c11df4d1e01"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a></div><div class="ttdeci">bool are_amicable(int x, int y)</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:48</div></div>
|
||||
|
||||
<p>Self-test implementations. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 67</span> {</div>
|
||||
<div class="line"><span class="lineno"> 68</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(220, 284) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 69</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(6368, 6232) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 70</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(458, 232) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 71</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(17296, 18416) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 72</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(18416, 17296) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 73</span> </div>
|
||||
<div class="line"><span class="lineno"> 74</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"All tests have successfully passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 75</span>}</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacemath_html_a8e6eede206201db0d1dbb618fa969bec"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a></div><div class="ttdeci">bool are_amicable(int x, int y)</div><div class="ttdoc">Function to check whether the pair is amicable or not.</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:58</div></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/df6/check__amicable__pair_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg" width="358" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="439" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
|
||||
Reference in New Issue
Block a user