~~河*涌--湖的博客

欧几里得：是求两个数的最大公约数：int gcd(int a, int b){ if(b==0) return a; return gcd(b, a%b);}扩展欧几里得：已知a,b求解二元一次方程ax+by=gcd(a,b)的一组解（x，y）；int exgcd(int a,int b,int &x,int &y){ ...

 #include <stdio.h>#include <string.h>#include <stdlib.h> int main(){ int n, m, a, b, c; while(~scanf("%d%d", &m, &n)) { a = m; b = n; ...

#include<iostream>#include<time.h>int main(){ clock_t start_time=clock(); { //被测试代码 } clock_t end_time=clock(); cout<< "Running time is: "<<stat...