摘要: 链接: https://codeforces.com/contest/1265/problem/E 题意: Creatnx has n mirrors, numbered from 1 to n. Every day, Creatnx asks exactly one mirror "Am I be 阅读全文
posted @ 2019-12-07 13:28 YDDDD 阅读(343) 评论(0) 推荐(1) 编辑
摘要: 链接: https://codeforces.com/contest/1265/problem/D 题意: An integer sequence is called beautiful if the difference between any two consecutive numbers is 阅读全文
posted @ 2019-12-07 00:08 YDDDD 阅读(473) 评论(0) 推荐(0) 编辑
摘要: 链接: https://codeforces.com/contest/1265/problem/C 题意: So the Beautiful Regional Contest (BeRC) has come to an end! n students took part in the contest 阅读全文
posted @ 2019-12-07 00:04 YDDDD 阅读(238) 评论(0) 推荐(0) 编辑
摘要: 链接: https://codeforces.com/contest/1265/problem/B 题意: You are given a permutation p=[p1,p2,…,pn] of integers from 1 to n. Let's call the number m (1≤m 阅读全文
posted @ 2019-12-07 00:02 YDDDD 阅读(342) 评论(0) 推荐(0) 编辑
摘要: 链接: https://codeforces.com/contest/1265/problem/A 题意: A string is called beautiful if no two consecutive characters are equal. For example, "ababcb", 阅读全文
posted @ 2019-12-07 00:00 YDDDD 阅读(315) 评论(0) 推荐(0) 编辑