{"id":2322,"date":"2023-05-15T20:15:20","date_gmt":"2023-05-15T11:15:20","guid":{"rendered":"http:\/\/attacktube.com\/?p=2322"},"modified":"2023-05-31T21:05:41","modified_gmt":"2023-05-31T12:05:41","slug":"%e3%80%90c%e8%a8%80%e8%aa%9e%e3%80%91%e3%83%a6%e3%83%bc%e3%82%af%e3%83%aa%e3%83%83%e3%83%89%e3%81%ae%e4%ba%92%e9%99%a4%e6%b3%95","status":"publish","type":"post","link":"https:\/\/attacktube.com\/?p=2322","title":{"rendered":"\u3010C\u8a00\u8a9e\u3011\u30e6\u30fc\u30af\u30ea\u30c3\u30c9\u306e\u4e92\u9664\u6cd5(\u57fa\u672c\u60c5\u5831\u6280\u8853\u8005\u8a66\u9a13 \u5e73\u621031\u5e74\u5ea6 \u6625 \u5348\u524d \u554f7)"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\">C\u8a00\u8a9e\u3067\u30e6\u30fc\u30af\u30ea\u30c3\u30c9\u306e\u4e92\u9664\u6cd5\u3067\u6700\u5927\u516c\u7d04\u6570\u3092\u6c42\u3081\u308b\u30d7\u30ed\u30b0\u30e9\u30e0\u3092\u4f5c\u308b\u3002<br>\u30e6\u30fc\u30af\u30ea\u30c3\u30c9\u306e\u4e92\u9664\u6cd5\u306f\u82f1\u8a9e\u3067\u306f\u300cEuclidean algorithm\u300d\u3068\u8868\u8a18\u3055\u308c\u308b\u3002<br>\u6700\u5927\u516c\u7d04\u6570\u306f\u82f1\u8a9e\u3067\u306f\u300cG.C.D(Greatest Common Divisor)\u300d\u3042\u308b\u3044\u306f\u3001\u300cG.C.M (Greatest Common Measure)\u300d\u3067\u3042\u308b\u3002<br><br>\u74b0\u5883<br>windows10(64bit)<br>Borland C++ 5.5.1 for Win32<br><br>\u6b21\u306e\u30b3\u30fc\u30c9\u3092Euclidean.c\u3068\u3059\u308b\u3002<\/p>\n\n\n\n<!--more-->\n\n\n\n<pre><code>\n#include &lt;stdio.h&gt;\n\n\/\/G.C.D(Greatest Common Divisor) \u6700\u5927\u516c\u7d04\u6570\nint gcd(int a, int b) {\n\n\tprintf(&quot;a = %d, b = %d\\n&quot;, a, b);\n\n\treturn (b == 0) ? a : gcd(b, a % b);\n\n}\n\nint main() {\n\n\tint num1, num2, result;\n\n\tprintf(&quot;\u6700\u5927\u516c\u7d04\u6570\u3092\u6c42\u3081\u308b2\u3064\u306e\u6b63\u306e\u6574\u6570\u3092\u5165\u529b\u3057\u3066\u304f\u3060\u3055\u3044:\\n&quot;);\n\tscanf(&quot;%d %d&quot;, &amp;num1, &amp;num2);\n\n\tresult = gcd(num1, num2);\n\tprintf(&quot;\u6700\u5927\u516c\u7d04\u6570\u306f %d \u3067\u3059\\n&quot;, result);\n\n\treturn 0;\n\n}\n<\/code><\/pre>\n\n\n\n<br>\n<script async=\"\" src=\"https:\/\/pagead2.googlesyndication.com\/pagead\/js\/adsbygoogle.js?client=ca-pub-3461056110605997\" crossorigin=\"anonymous\"><\/script>\n<ins class=\"adsbygoogle\" style=\"display:block; text-align:center;\" data-ad-layout=\"in-article\" data-ad-format=\"fluid\" data-ad-client=\"ca-pub-3461056110605997\" data-ad-slot=\"3137443461\"><\/ins>\n<script>\n     (adsbygoogle = window.adsbygoogle || []).push({});\n<\/script>\n<br>\n\n\n\n<p class=\"wp-block-paragraph\">\u30b3\u30f3\u30d1\u30a4\u30eb\u3057\u3066\u5b9f\u884c\u3059\u308b\u3002<\/p>\n\n\n\n<pre><code>\nc:\\coco_c&gt;bcc32 Euclidean.c\nBorland C++ 5.5.1 for Win32 Copyright (c) 1993, 2000 Borland\nEuclidean.c:\nTurbo Incremental Link 5.00 Copyright (c) 1997, 2000 Borland\n\nc:\\coco_c&gt;Euclidean.exe\n\u6700\u5927\u516c\u7d04\u6570\u3092\u6c42\u3081\u308b2\u3064\u306e\u6b63\u306e\u6574\u6570\u3092\u5165\u529b\u3057\u3066\u304f\u3060\u3055\u3044:\n876\n204\na = 876, b = 204\na = 204, b = 60\na = 60, b = 24\na = 24, b = 12\na = 12, b = 0\n\u6700\u5927\u516c\u7d04\u6570\u306f 12 \u3067\u3059\n\nc:\\coco_c&gt;\n<\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\">\u6b63\u306e\u6574\u6570\u3092\u5165\u529b\u3057\u306a\u304b\u3063\u305f\u5834\u5408\u306f\u3001\u518d\u5165\u529b\u3059\u308b\u3088\u3046\u306b\u4fee\u6b63\u3059\u308b\u3002<\/p>\n\n\n\n<pre><code>\n#include &lt;stdio.h&gt;\n\n\/\/G.C.D(Greatest Common Divisor) \u6700\u5927\u516c\u7d04\u6570\nint gcd(int a, int b) {\n\n   printf(&quot;a = %d, b = %d\\n&quot;, a, b);\n\n    return (b == 0) ? a : gcd(b, a % b);\n\n}\n\nint main() {\n\n    int num1, num2, result;\n\t\n    printf(&quot;\u6700\u5927\u516c\u7d04\u6570\u3092\u6c42\u3081\u308b2\u3064\u306e\u6b63\u306e\u6574\u6570\u3092\u5165\u529b\u3057\u3066\u304f\u3060\u3055\u3044:\\n&quot;);\n\t\n    while (1) {\n        scanf(&quot;%d %d&quot;, &amp;num1, &amp;num2);\n\n        if (num1 &gt; 0 &amp;&amp; num2 &gt; 0) {\n            result = gcd(num1, num2);\n            printf(&quot;\u6700\u5927\u516c\u7d04\u6570\u306f %d \u3067\u3059\\n&quot;, result);\n            break;\n        } else {\n            printf(&quot;\u6b63\u306e\u6574\u6570\u3092\u5165\u529b\u3057\u3066\u304f\u3060\u3055\u3044\\n&quot;);\n        }\n    }\n\n\treturn 0;\n}\n<\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\">\u30b3\u30f3\u30d1\u30a4\u30eb\u3057\u3066\u5b9f\u884c\u3059\u308b\u3002<\/p>\n\n\n\n<pre><code>\nc:\\coco_c&gt;bcc32 Euclidean.c\nBorland C++ 5.5.1 for Win32 Copyright (c) 1993, 2000 Borland\nEuclidean.c:\nTurbo Incremental Link 5.00 Copyright (c) 1997, 2000 Borland\n\nc:\\coco_c&gt;Euclidean.exe\n\u6700\u5927\u516c\u7d04\u6570\u3092\u6c42\u3081\u308b2\u3064\u306e\u6b63\u306e\u6574\u6570\u3092\u5165\u529b\u3057\u3066\u304f\u3060\u3055\u3044:\n-876\n204\n\u6b63\u306e\u6574\u6570\u3092\u5165\u529b\u3057\u3066\u304f\u3060\u3055\u3044\n876\n204\na = 876, b = 204\na = 204, b = 60\na = 60, b = 24\na = 24, b = 12\na = 12, b = 0\n\u6700\u5927\u516c\u7d04\u6570\u306f 12 \u3067\u3059\n\nc:\\coco_c&gt;\n<\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\">\u30e6\u30fc\u30af\u30ea\u30c3\u30c9\u306e\u4e92\u9664\u6cd5\u3092\u5272\u308a\u7b97\u3067\u306f\u306a\u304f\u3001\u5f15\u304d\u7b97\u306b\u3059\u308b\u3068\u6b21\u306e\u3088\u3046\u306b\u306a\u308b\u3002<br>\u3053\u306e\u30e6\u30fc\u30af\u30ea\u30c3\u30c9\u306e\u4e92\u9664\u6cd5\u3067\u306e\u5f15\u304d\u7b97\u306e\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u306f\u3001\u57fa\u672c\u60c5\u5831\u6280\u8853\u8005\u8a66\u9a13 \u5e73\u621031\u5e74\u5ea6 \u6625 \u5348\u524d \u554f7\u3067\u51fa\u984c\u3055\u308c\u305f\u3002\u305d\u308c\u3092C\u8a00\u8a9e\u3067\u5b9f\u88c5\u3057\u3066\u307f\u305f\u3002<\/p>\n\n\n\n<pre><code>\n#include &lt;stdio.h&gt;\n\n\/\/G.C.D(Greatest Common Divisor) \u6700\u5927\u516c\u7d04\u6570\nint gcd(int a, int b) {\n    \n    printf(&quot;a = %d, b = %d\\n&quot;, a, b);\n\t\n    if(a &lt; b){\n       b = b - a;\n       return gcd(a, b);\n    }else if(a &gt; b){\n       a = a - b;\n       return gcd(a, b);\n    }else{\n       \/\/a-b = 0\u306e\u5834\u5408\n       return a;\n    }\n    \n}\n\nint main() {\n\n    int num1, num2, result;\n\t\n    printf(&quot;\u6700\u5927\u516c\u7d04\u6570\u3092\u6c42\u3081\u308b2\u3064\u306e\u6b63\u306e\u6574\u6570\u3092\u5165\u529b\u3057\u3066\u304f\u3060\u3055\u3044:\\n&quot;);\n\t\n    while (1) {\n        scanf(&quot;%d %d&quot;, &amp;num1, &amp;num2);\n\n        if (num1 &gt; 0 &amp;&amp; num2 &gt; 0) {\n            result = gcd(num1, num2);\n            printf(&quot;\u6700\u5927\u516c\u7d04\u6570\u306f %d \u3067\u3059\\n&quot;, result);\n            break;\n        } else {\n            printf(&quot;\u6b63\u306e\u6574\u6570\u3092\u5165\u529b\u3057\u3066\u304f\u3060\u3055\u3044\\n&quot;);\n        }\n        \n    }\n\n\treturn 0;\n}\n<\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\">\u30b3\u30f3\u30d1\u30a4\u30eb\u3057\u3066\u5b9f\u884c\u3059\u308b\u3002<\/p>\n\n\n\n<pre><code>\nc:\\coco_c&gt;bcc32 Euclidean.c\nBorland C++ 5.5.1 for Win32 Copyright (c) 1993, 2000 Borland\nEuclidean.c:\nTurbo Incremental Link 5.00 Copyright (c) 1997, 2000 Borland\n\nc:\\coco_c&gt;Euclidean.exe\n\u6700\u5927\u516c\u7d04\u6570\u3092\u6c42\u3081\u308b2\u3064\u306e\u6b63\u306e\u6574\u6570\u3092\u5165\u529b\u3057\u3066\u304f\u3060\u3055\u3044:\n876\n204\na = 876, b = 204\na = 672, b = 204\na = 468, b = 204\na = 264, b = 204\na = 60, b = 204\na = 60, b = 144\na = 60, b = 84\na = 60, b = 24\na = 36, b = 24\na = 12, b = 24\na = 12, b = 12\n\u6700\u5927\u516c\u7d04\u6570\u306f 12 \u3067\u3059\n\nc:\\coco_c&gt;\n\n\n<\/code><\/pre>\n\n\n\n<script type=\"text\/javascript\">\njQuery(function($){\n$(\".jp-video\").hide();\n});\n<\/script>\n","protected":false},"excerpt":{"rendered":"<p>C\u8a00\u8a9e\u3067\u30e6\u30fc\u30af\u30ea\u30c3\u30c9\u306e\u4e92\u9664\u6cd5\u3067\u6700\u5927\u516c\u7d04\u6570\u3092\u6c42\u3081\u308b\u30d7\u30ed\u30b0\u30e9\u30e0\u3092\u4f5c\u308b\u3002\u30e6\u30fc\u30af\u30ea\u30c3\u30c9\u306e\u4e92\u9664\u6cd5\u306f\u82f1\u8a9e\u3067\u306f\u300cEuclidean algorithm\u300d\u3068\u8868\u8a18\u3055\u308c\u308b\u3002\u6700\u5927\u516c\u7d04\u6570\u306f\u82f1\u8a9e\u3067\u306f\u300cG.C.D(Greatest Common D [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[10],"tags":[],"class_list":["post-2322","post","type-post","status-publish","format-standard","hentry","category-c"],"jetpack_featured_media_url":"","jetpack-related-posts":[],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/attacktube.com\/index.php?rest_route=\/wp\/v2\/posts\/2322","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/attacktube.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/attacktube.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/attacktube.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/attacktube.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2322"}],"version-history":[{"count":18,"href":"https:\/\/attacktube.com\/index.php?rest_route=\/wp\/v2\/posts\/2322\/revisions"}],"predecessor-version":[{"id":2676,"href":"https:\/\/attacktube.com\/index.php?rest_route=\/wp\/v2\/posts\/2322\/revisions\/2676"}],"wp:attachment":[{"href":"https:\/\/attacktube.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2322"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/attacktube.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2322"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/attacktube.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2322"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}