#include<iostream>
#include<algorithm>
using namespace std;
int continuous_integer(int m, int n){
//连续整数
int t =min(m, n);
int Max =max(m, n);
int Min =min(m, n);while(Max%t !=0){
// 必须先用大数与t取余
t--;}while(Min%t !=0){
t--;}return t;}
int main(){
int m, n;while(cin >> m >> n){
cout <<"最大公约数是: "<<continuous_integer(m, n)<< endl;}system("pause");return0;}//计数版
int main(){
int m, n;while(cin >> m >> n){
double start, end;
start =clock();
cout <<"最大公约数是: "<<continuous_integer(m, n)<< endl;
end =clock();
cout <<" 花费时间是 :"<<(end - start)/CLK_TCK<<"秒"<< endl;}system("pause");return0;}//计时版
int main(){
int m, n;while(cin >> m >> n){
time_t start, end;
start =time(NULL)
Gcd的三个解法 并用计数法1和计时法2测算时间gratest common divisor算法一 连续整数#include&amp;amp;lt;iostream&amp;amp;gt;#include&amp;amp;lt;algorithm&amp;amp;gt;using namespace std;int continuous_integer(int m, int n) { int t = min(m, n); int Max ...