2019年1月15日
牛客练习赛B题 筱玛的排列（找递推规律）
摘要： 链接：https://ac.nowcoder.com/acm/contest/342/B来源：牛客网 筱玛的排列 筱玛的排列 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 524288K，其他语言1048576K 64bit IO Format: %lld 时间限制：C/C++ 1 阅读全文
posted @ 2019-01-15 20:10 茄子Min 阅读(345) 评论(0) 推荐(0) 编辑
牛客练习赛 A题 筱玛的快乐
摘要： 链接：https://ac.nowcoder.com/acm/contest/342/A来源：牛客网 筱玛的快乐 筱玛的快乐 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 524288K，其他语言1048576K 64bit IO Format: %lld 题目描述 筱玛是个快乐的 阅读全文
posted @ 2019-01-15 17:20 茄子Min 阅读(247) 评论(0) 推荐(0) 编辑
Success Rate CodeForces - 807C （数学+二分）
摘要： You are an experienced Codeforces user. Today you found out that during your activity on Codeforces you have made y submissions, out of which x have b 阅读全文
posted @ 2019-01-15 15:39 茄子Min 阅读(418) 评论(0) 推荐(0) 编辑
2019年1月12日
Division and Union CodeForces - 1101C （排序后处理）
摘要： There are nn segments [li,ri][li,ri] for 1≤i≤n1≤i≤n. You should divide all segments into two non-empty groups in such way that there is no pair of seg 阅读全文
posted @ 2019-01-12 13:51 茄子Min 阅读(926) 评论(2) 推荐(0) 编辑
Accordion CodeForces - 1101B （实现）
摘要： An accordion is a string (yes, in the real world accordions are musical instruments, but let's forget about it for a while) which can be represented a 阅读全文
posted @ 2019-01-12 13:35 茄子Min 阅读(418) 评论(0) 推荐(0) 编辑
Minimum Integer CodeForces - 1101A （思维+公式）
摘要： You are given qq queries in the following form: Given three integers lili, riri and didi, find minimum positive integer xixi such that it is divisible 阅读全文
posted @ 2019-01-12 13:25 茄子Min 阅读(563) 评论(0) 推荐(0) 编辑
2019年1月11日
The Golden Age CodeForces - 813B （数学+枚举）
摘要： Unlucky year in Berland is such a year that its number n can be represented as n = xa + yb, where a and b are non-negative integer numbers. For exampl 阅读全文
posted @ 2019-01-11 21:01 茄子Min 阅读(323) 评论(0) 推荐(0) 编辑
The Contest CodeForces - 813A (思维)
摘要： Pasha is participating in a contest on one well-known website. This time he wants to win the contest and will do anything to get to the first place! T 阅读全文
posted @ 2019-01-11 17:39 茄子Min 阅读(267) 评论(0) 推荐(0) 编辑
Integer Sequence Dividing CodeForces - 1102A (规律)
摘要： You are given an integer sequence 1,2,…,n1,2,…,n. You have to divide it into two sets AAand BB in such a way that each element belongs to exactly one  阅读全文
posted @ 2019-01-11 12:30 茄子Min 阅读(681) 评论(0) 推荐(0) 编辑
Balanced Ternary String CodeForces - 1102D （贪心+思维）
摘要： You are given a string ss consisting of exactly nn characters, and each character is either '0', '1' or '2'. Such strings are called ternary strings. 阅读全文
posted @ 2019-01-11 00:11 茄子Min 阅读(530) 评论(0) 推荐(0) 编辑