{"height":"190","width":"100%","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fpythonjp.ikitai.net%2Fentry%2F2026%2F01%2F05%2F030149\" title=\"\u3010\u52d5\u753b\u89e3\u8aac\u3011ITPEC April 2025 FE (Fundamental IT Engineer) Subject B Q3| Step-by-Step Explanation - IT\u30a8\u30f3\u30b8\u30cb\u30a2\u304c\u4ed5\u4e8b\u306b\u5bfe\u3057\u3066\u601d\u3046\u3053\u3068\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","author_name":"tedd707","version":"1.0","categories":[],"url":"https://pythonjp.ikitai.net/entry/2026/01/05/030149","blog_url":"https://pythonjp.ikitai.net/","title":"\u3010\u52d5\u753b\u89e3\u8aac\u3011ITPEC April 2025 FE (Fundamental IT Engineer) Subject B Q3| Step-by-Step Explanation","type":"rich","image_url":null,"provider_url":"https://hatena.blog","blog_title":"IT\u30a8\u30f3\u30b8\u30cb\u30a2\u304c\u4ed5\u4e8b\u306b\u5bfe\u3057\u3066\u601d\u3046\u3053\u3068","published":"2026-01-05 03:01:49","author_url":"https://blog.hatena.ne.jp/tedd707/","description":"[https://www.youtube.com/watch?v=zIEXhLZjqLE:embed:cite] The program computes the greatest common divisor using the subtraction-based Euclidean algorithm. When GCD(98, 56) is called, it assigns the input values to two working variables, m and n, and then repeatedly reduces the larger one by subtract\u2026"}