GrinlexGH
/ diophantine-equation.c
Created
June 16, 2025 18:21
Computes GCD and solves the linear Diophantine equation ax + by = c with Bézout coefficients.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <assert.h> | |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| int iabs(int a) { return (a < 0) ? -a : a; } | |
| int eu_mod(int a, int b) { | |
| int r; | |
| assert(b != 0); | |
| r = a % b; |