自定义博客皮肤VIP专享

*博客头图：

点击选择上传的图片

格式为PNG、JPG，宽度*高度大于1920*100像素，不超过2MB，主视觉建议放在右侧，请参照线上博客头图

请上传大于1920*100像素的图片！

博客底图：

点击选择上传的图片

图片格式为PNG、JPG，不超过1MB，可上下左右平铺至整个背景

栏目图：

点击选择上传的图片

图片格式为PNG、JPG，图片宽度*高度为300*38像素，不超过0.5MB

主标题颜色：

RGB颜色，例如：#AFAFAF

Hover：

RGB颜色，例如：#AFAFAF

副标题颜色：

RGB颜色，例如：#AFAFAF

预览取消提交

自定义博客皮肤

上一步保存

solego’s blog

solego

博客等级

码龄7年

390
原创

428
点赞

476
收藏

345
粉丝

关注

私信

分类专栏

最新评论

【偶然一题】CF1979C. Earning on Bets | 思维 | 绕证明绕出来了
bgmaster: 大佬，这个样例跑出来虽然是对的，但是为什么b[i]的和不等于sum 1 2 6 6
关于浏览器打开时自动打开部分网页（浏览器被劫持）的解决办法
zszg: 感谢已解决
Codeforces 1220 D - Alex and Julian
WhiteGrass99: Below is the english translation for the same
Codeforces 1220 D - Alex and Julian
WhiteGrass99: We want to find conditions under which the graph is a bipartite graph, meaning it contains no odd cycles. Therefore, the case of one odd and one even doesn't hold. We aim for both to be odd. To minimize the number of deletions, we express all numbers in B as 2^k * v, where v is an odd number. Only when the exponents k are equal for two numbers, b/gcd(a,b) and a/gcd(a,b) will both be odd. Hence, the retained elements are those with the highest exponents, ranging from 2^0 to 2^63.
Codeforces 1220 D - Alex and Julian
WhiteGrass99: roperty of Bipartite Graph: A graph is bipartite if and only if it does not contain an odd cycle. Utilizing this property, we first consider connecting integers that meet the condition, i.e., when the absolute difference between two integers is in B. For two points a and b existing in B, they can be seen as starting from 0 and advancing forward by a and b steps respectively each time. Therefore, their first meeting point occurs at the least common multiple (LCM) of a and b. At this meeting point, after a has moved b/gcd(a,b) times and b has moved a/gcd(a,b) times, to ensure the absence of an odd cycle, we need the sum of these steps to be divisible by 2. Hence, the problem can be reduced to two cases: Both b/gcd(a,b) and a/gcd(a,b) are odd. One is odd and the other is even. It's impossible for both to be even since if they were both even, it means their denominators can be further divided by 2, contradicting the property of gcd.

技术栈开发

关注

闲置26

关注数：文章数：2 文章阅读量：1236 文章收藏量：2

作者: solego

这个作者很懒，什么都没留下…

展开

专栏收录文章

solego’s blog

技术栈开发

作者: solego

使用matplotlib.pyplot报错

python安装和使用过程中的一些问题