摘要: 1. ll gcd(ll a, ll b) { while(b^=a^=b^=a%=b); return a; } 2. ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; //前面在判断b是否等于0 }// int gcd(int a, int b 阅读全文
posted @ 2022-06-22 18:07 Catherine_leah 阅读(79) 评论(0) 推荐(0) 编辑
/* */