Maximum Covenant Algorithm

xiaoxiao2021-03-06  60

#include "stdio.h"

Unsigned int GCD (unsigned int m, unsigned int n) {

Unsigned int R;

While (n> 0)

{

REM = M% N;

M = n;

N = Rem;

}

Return M;

}

//test

int main ()

{

Printf ("GCD FOR 12 and 34:% D / N", GCD (12, 34));

Return 0;

}

转载请注明原文地址:https://www.9cbs.com/read-117225.html

New Post(0)