- 博客(5)
- 收藏
- 关注
原创 Codeforces Round #708 (Div. 2) C1、C2 k-LCM
文章目录题意一、C1. k-LCM (easy version)二、C2. k-LCM (hard version)题意给出两个数n,k,要求找到k个数,使k个数的最小公倍数LCM(a1,a2,a3,……ak)<=n2LCM (a_1,a_2,a_3,……a_k)<= {n \over 2}LCM(a1,a2,a3,……ak)<=2n,easy题中k恒定为3。一、C1. k-LCM (easy version)因为两道题有一定的关联,是从k最小为3,逐渐推广k为任意数
2021-03-19 20:18:54
203
原创 Codeforces Round #707 (Div. 2) C. Going Home
题目 : https://codeforces.com/contest/1501/problem/C一、题意 题目就是在一个给定整数序列中(无序)求是否存在满足axa_xax+aya_yay=aza_zaz+awa_waw的四个互不不相同下标x,y,z,w。二、题解首先序列长度N的最大规模为2e5,那么根据排列组合Cn2C_{n}^{2}Cn2 ,即(n−1)∗n2{(n-1)*n \over 2}2(n−1)∗n对组合,从这(n−1)∗n2{(n-1)*n \over 2}2(n−.
2021-03-15 11:21:05
99
原创 Pavel and Triangles(贪心)
提示:文章写完后,目录可以自动生成,如何生成可参考右边的帮助文档文章目录题目描述一、pandas是什么?二、使用步骤1.引入库2.读入数据总结题目描述Pavel and TrianglesPavel has several sticks with lengths equal to powers of two.He has sticks of length , sticks of length , …, sticks of length .Pavel wants to make the
2020-12-30 00:30:54
188
原创 HDU Forest Program(dfs找环)
HDU Forest Program题目:The kingdom of Z is fighting against desertification these years since there are plenty of deserts in its wide and huge territory. The deserts are too arid to have rainfall or human habitation, and the only creatures that can live ins
2020-12-17 22:46:37
218
原创 云麓谷高级作业
提示:文章写完后,目录可以自动生成,如何生成可参考右边的帮助文档文章目录前言一、构建html骨架二、使用css添加样式1、盒子模型2.flex布局3、难点总结前言从零开始写云麓谷高级作业,之前面试的时候压根没写(我也不知道我怎么混进去的),要实现的效果如下 ![在这里插入图片描述](https://img-blog.csdnimg.cn/20201027002145881.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,s
2020-10-27 01:31:11
301
1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人