From 2d5fc9c45bd3f7a1128096317acee6b93dce1ec9 Mon Sep 17 00:00:00 2001 From: Hyder Date: Fri, 1 Aug 2025 12:34:54 +0300 Subject: Im organizing things like a pro XD --- GCD/GCD.c | 23 +++++++++++++++++++++++ GCD/README.md | 5 +++++ 2 files changed, 28 insertions(+) create mode 100644 GCD/GCD.c create mode 100644 GCD/README.md (limited to 'GCD') diff --git a/GCD/GCD.c b/GCD/GCD.c new file mode 100644 index 0000000..2f857f8 --- /dev/null +++ b/GCD/GCD.c @@ -0,0 +1,23 @@ +# include + +int GreatestCommonDivisor(int INPUT_ONE, int INPUT_TWO) { + int DIVISOR; + for (int i = 1; i < INPUT_ONE || i < INPUT_TWO;++i) { + if (INPUT_ONE % i == 0 && INPUT_TWO % i == 0) { + DIVISOR = i; + } + } + return DIVISOR; +} + + +int main() { + int INPUT_ONE; + int INPUT_TWO; + printf("Give me a TWO numbers to find GCD\n"); + while (scanf("%d %d", &INPUT_ONE, &INPUT_TWO) != EOF) { + int RESULT = GreatestCommonDivisor(INPUT_ONE, INPUT_TWO); + printf("%d\n\n", RESULT); + } + return 0; +} \ No newline at end of file diff --git a/GCD/README.md b/GCD/README.md new file mode 100644 index 0000000..d72b73f --- /dev/null +++ b/GCD/README.md @@ -0,0 +1,5 @@ +# GCD calculator + +**Im just writing a readme markdown file to see how this works** + +## This is a simple program written in C to calculate the Greatest Common Divisor of two positive integers its a part of some random exercises im trying to solve. \ No newline at end of file -- cgit v1.2.3