本文分类:news发布日期:2026/2/2 14:42:12
打赏

相关文章

gcd和lcm

最大公约数 int gcd(int a,int b) {while(b!=0){int t=b;b=a%b;a=t;} return a; }最小公倍数 int lcm(int a,int b) {return (a/gcd(a,b))*b; }

[MCP-UI] Dynamic Sizing

Users expect iframes to fit their content perfectly, not waste space or require scrolling. The journal viewer should automatically adjust to show exactly whats needed. const height = document.documentE…

手机版浏览

扫一扫体验

微信公众账号

微信扫一扫加关注

返回
顶部