又见GCD:
#includeusing namespace std;int gcd(int a,int b){ while(a%b) { int r=a%b; a=b; b=r; } return b;}int main(){ int n,a,b,c,i,j; cin>>n; for (i=0;i >a>>b; c=2*b; while(gcd(a,c)!=b) { c+=b; } cout< <
本文共 392 字,大约阅读时间需要 1 分钟。
又见GCD:
#includeusing namespace std;int gcd(int a,int b){ while(a%b) { int r=a%b; a=b; b=r; } return b;}int main(){ int n,a,b,c,i,j; cin>>n; for (i=0;i >a>>b; c=2*b; while(gcd(a,c)!=b) { c+=b; } cout< <
转载于:https://blog.51cto.com/beyond316/1275623
转载地址:https://blog.csdn.net/weixin_34061042/article/details/93083319 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!