上一页 1 ··· 3 4 5 6 7 8 9 10 下一页
摘要: "https://codeforces.com/contest/1239/problem/A" discription given a $n m$ field in which every grid can be painted black and white. count the number o 阅读全文
posted @ 2020-03-21 22:47 xlinsist 阅读(30067) 评论(0) 推荐(0)
摘要: https://codeforces.com/contest/1237/problem/F key to come up with solution is that we need to realize the importance of iterating two kinds of dominos 阅读全文
posted @ 2020-03-21 21:16 xlinsist 阅读(170) 评论(0) 推荐(0)
摘要: "https://codeforces.com/contest/1324/problem/F" description you are given a tree, in which the vertices are all printed either black or white. , find 阅读全文
posted @ 2020-03-17 23:11 xlinsist 阅读(101) 评论(0) 推荐(0)
摘要: writing 阅读全文
posted @ 2020-03-16 22:39 xlinsist 阅读(110) 评论(0) 推荐(0)
摘要: "https://codeforces.com/problemset/problem/1307/E" first insight consideration of orders is needless 不需要考虑牛吃草的顺序.首先,如果能确定合法的顺序,则不同种类的牛相互之间一定不会冲突,因为他们最 阅读全文
posted @ 2020-03-16 12:47 xlinsist 阅读(201) 评论(0) 推荐(0)
摘要: 觉得这篇论文写得真好,真正做到行文流畅内容详实,对我来说如同教科书般,于是将一些细节放了出来,多少有点收获吧。这还只是行文部分,什么时候有能力剖析他的内容,理解他的核心理念,我也算达到初步入门实践的境界了(笑) 摆线推进器的无人监测船系统研究 ——浙江大学 研究背景与意义 第一段大背景,有浩瀚性 从 阅读全文
posted @ 2020-03-15 22:57 xlinsist 阅读(330) 评论(0) 推荐(0)
摘要: int add(int a,int b) { int c=(a+b); if (c>=mod) c-=mod; return c; } int mul(int a,int b) { ll c=1ll*a*b; return c-c/mod*mod; } int fpow(int x,int powe 阅读全文
posted @ 2020-03-14 23:11 xlinsist 阅读(179) 评论(0) 推荐(0)
摘要: https://blog.csdn.net/xiaoguyin_/article/details/79798362?depth_1 utm_source=distribute.pc_relevant.none task&utm_source=distribute.pc_relevant.none t 阅读全文
posted @ 2020-03-12 10:54 xlinsist 阅读(91) 评论(0) 推荐(0)
摘要: 阅读全文
posted @ 2020-03-09 23:29 xlinsist 阅读(114) 评论(0) 推荐(0)
摘要: delay 阅读全文
posted @ 2020-03-09 17:24 xlinsist 阅读(216) 评论(0) 推荐(0)
上一页 1 ··· 3 4 5 6 7 8 9 10 下一页