摘要: 1.vector 题目:https://vjudge.net/contest/310193#problem/A 代码: 数据结构核心vector<int> pile[maxn] 每一个木块堆的高度不确定,所以用vector来保存比较合适,而木块堆的个数不超过n,所以用一个数组来存储就可以。 2.se 阅读全文
posted @ 2019-07-21 18:24 ふるやれいRX-7 阅读(159) 评论(0) 推荐(0) 编辑
摘要: 1.埃式筛素数 2.GCD函数 阅读全文
posted @ 2019-06-09 19:51 ふるやれいRX-7 阅读(160) 评论(0) 推荐(0) 编辑
摘要: 题目:LightOJ :: Problem 1214 - Large Division Given two integers, a and b, you should check whether a is divisible by b or not. We know that an integer 阅读全文
posted @ 2019-06-09 18:31 ふるやれいRX-7 阅读(241) 评论(0) 推荐(0) 编辑
摘要: 题目:LightOJ:1341 - Aladdin and the Flying Carpet(因子个数) It's said that Aladdin had to solve seven mysteries before getting the Magical Lamp which summon 阅读全文
posted @ 2019-06-03 19:56 ふるやれいRX-7 阅读(264) 评论(0) 推荐(0) 编辑
摘要: 题目:LightOJ 1370 - Bi-shoe and Phi-shoe (欧拉函数思想) Bamboo Pole-vault is a massively popular sport in Xzhiland. And Master Phi-shoe is a very popular coac 阅读全文
posted @ 2019-06-03 19:37 ふるやれいRX-7 阅读(427) 评论(0) 推荐(0) 编辑