标签:
辗转相除法:
当a % b=0 时gcd(a,b)=b,否则
gcd(a,b)=gcd(b,a%b)
原理:(来源于百度)
1 #include<iostream> 2 #include<cstdio> 3 using namespace std; 4 int gcd(int a,int b){ 5 if (b==0) return a; 6 else return gcd(b,a%b); 7 } 8 int main(){ 9 int a,b; 10 cin>>a>>b; 11 cout<<gcd(a,b); 12 return 0; 13 }
思考下面代码的输出结果
1 #include<iostream> 2 #include<cstdio> 3 using namespace std; 4 int gcd(int a,int b){ 5 if (b==0) return a; 6 else return gcd(b,a%b); 7 cout<<a<<" "<< b<<endl; 8 } 9 int main(){ 10 int a,b; 11 cin>>a>>b; 12 cout<<gcd(a,b); 13 return 0; 14 }
这样呢
1 #include<iostream> 2 #include<cstdio> 3 using namespace std; 4 int gcd(int a,int b){ 5 if (b==0) return a; 6 else { 7 cout<<a<<" "<<b<<endl; 8 return gcd(b,a%b);} 9 } 10 int main(){ 11 int a,b; 12 cin>>a>>b; 13 cout<<gcd(a,b); 14 return 0; 15 }
标签:
原文地址:http://www.cnblogs.com/ssfzmfy/p/4641112.html