Last active
November 9, 2024 05:15
-
-
Save ghost355/f11dcaebcc0f21c39dad0087dcc35d0b to your computer and use it in GitHub Desktop.
Revisions
-
ghost355 revised this gist
Nov 9, 2024 . 1 changed file with 1 addition and 1 deletion.There are no files selected for viewing
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 charactersOriginal file line number Diff line number Diff line change @@ -1,6 +1,6 @@ #include<stdlib.h> int nod(int x, int y) { int a = abs(x); int b = abs(y); if (b > a) { -
ghost355 revised this gist
Nov 9, 2024 . 1 changed file with 2 additions and 0 deletions.There are no files selected for viewing
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 charactersOriginal file line number Diff line number Diff line change @@ -2,10 +2,12 @@ int nod(int x, int y) { int a = abs(X); int b = abs(y); if (b > a) { int temp = b; a = b; b = temp; } return b==0 ? a : nod(b, a%b); } -
ghost355 revised this gist
Nov 9, 2024 . 1 changed file with 4 additions and 3 deletions.There are no files selected for viewing
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 charactersOriginal file line number Diff line number Diff line change @@ -1,6 +1,7 @@ #include<stdlib.h> int nod(int x, int y) { int a = abs(X); int b = abs(y); if (b > a) { int temp = b; a = b; -
ghost355 revised this gist
Nov 9, 2024 . 1 changed file with 2 additions and 0 deletions.There are no files selected for viewing
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 charactersOriginal file line number Diff line number Diff line change @@ -1,4 +1,6 @@ int nod(int a, int b) { a = mod(a); b = mod(b); if (b > a) { int temp = b; a = b; -
ghost355 revised this gist
Nov 9, 2024 . 1 changed file with 6 additions and 1 deletion.There are no files selected for viewing
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 charactersOriginal file line number Diff line number Diff line change @@ -1,3 +1,8 @@ int nod(int a, int b) { if (b > a) { int temp = b; a = b; b = temp; } return b==0 ? a : nod(b, a%b); } -
ghost355 created this gist
Nov 9, 2024 .There are no files selected for viewing
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 charactersOriginal file line number Diff line number Diff line change @@ -0,0 +1,3 @@ int nod(int a, int b) { return b==0 ? a : nod(b, a%b); }