inline void GCD(int a, int b)
{
while (b != 0)
{
int c = a % b;
a = b;
b = c;
}
return a;
}
inline void GCD(int a, int b)
{
while((a%=b) && (b%=a));
return a+b;
}
#include<algorithm>
#include<cmath>
using namespace std;
int gcd_1(int a,int b)//遞迴,我最習慣的,time:849
{
if(b==0)return a;
return gcd_1(b,a%b);
}
int gcd_2(int a,int b)//迴圈,time:1130
{
//注意:需要<algorithm>,<cmath>
while(b)swap(a%=b,b);
return abs(a);
}
int gcd_3(int a,int b)//迴圈,time:848
{
while((a%=b)&&(b%=a));
return a+b;
}
int main(){}
歡迎光臨 竹園論壇 (http://forum.tfcis.org/) | Powered by Discuz! X3.2 |