代码

#include<bits/stdc++.h>
using namespace std;

long long gcd(long long x, long long y) {
  int cnt = 0;
  long long tmp;
  int jx,jy;
  while(x!=y) {
    tmp=min(x,y); x=max(x,y); y=tmp;
    jx=x&1, jy=y&1;
    if(!jx) x>>=1;
    if(!jy) y>>=1;
    if(jx&&jy) x-=y;
    if(!jx&& !jy) ++cnt;
  }
  return x;
}

long long gcdd(long long x, long long y) {
  return !y ? x : gcdd(y, x%y);
}

int main() {
  /*
    两个斐波那契数
    99194853094755490
    160500643816367070
  */
  double st = clock();
  for(int i=1;i<=1000000;++i) {
    long long x = gcd(99194853094755490ll, 160500643816367070ll);
  }
  double ed = clock();
  cout << '\n' << ed-st;
  return 0;
}

评测结果