YDDDD

2019年12月23日

Codeforces Round #609 (Div. 2) C. Long Beautiful Integer

摘要：链接： https://codeforces.com/contest/1269/problem/C 题意： You are given an integer x of n digits a1,a2,…,an, which make up its decimal notation in order f 阅读全文

posted @ 2019-12-23 10:53 YDDDD 阅读(314) 评论(0) 推荐(0) 编辑

Codeforces Round #609 (Div. 2) B. Modulo Equality

摘要：链接： https://codeforces.com/contest/1269/problem/B 题意： You are given a positive integer m and two integer sequence: a=[a1,a2,…,an] and b=[b1,b2,…,bn]. 阅读全文

posted @ 2019-12-23 10:51 YDDDD 阅读(269) 评论(0) 推荐(0) 编辑

Codeforces Round #609 (Div. 2) A. Equation

摘要：链接： https://codeforces.com/contest/1269/problem/A 题意： Let's call a positive integer composite if it has at least one divisor other than 1 and itself. 阅读全文

posted @ 2019-12-23 10:47 YDDDD 阅读(259) 评论(0) 推荐(0) 编辑

2019年12月21日

Educational Codeforces Round 78 (Rated for Div. 2) D. Segment Tree

摘要：链接： https://codeforces.com/contest/1278/problem/D 题意： As the name of the task implies, you are asked to do some work with segments and trees. Recall t 阅读全文

posted @ 2019-12-21 11:18 YDDDD 阅读(300) 评论(1) 推荐(0) 编辑

Educational Codeforces Round 78 (Rated for Div. 2) C. Berry Jam

摘要：链接： https://codeforces.com/contest/1278/problem/C 题意： Karlsson has recently discovered a huge stock of berry jam jars in the basement of the house. Mo 阅读全文

posted @ 2019-12-21 11:16 YDDDD 阅读(165) 评论(0) 推荐(0) 编辑

Educational Codeforces Round 78 (Rated for Div. 2) B. A and B

摘要：链接： https://codeforces.com/contest/1278/problem/B 题意： You are given two integers a and b. You can perform a sequence of operations: during the first o 阅读全文

posted @ 2019-12-21 11:15 YDDDD 阅读(290) 评论(0) 推荐(0) 编辑

Educational Codeforces Round 78 (Rated for Div. 2) A. Shuffle Hashing

摘要：链接： https://codeforces.com/contest/1278/problem/A 题意： Polycarp has built his own web service. Being a modern web service it includes login feature. An 阅读全文

posted @ 2019-12-21 11:11 YDDDD 阅读(338) 评论(0) 推荐(0) 编辑

2019年12月18日

HDU-1848-Fibonacci again and again(SG函数，博弈）

摘要：链接： http://acm.hdu.edu.cn/showproblem.php?pid=1848 题意：任何一个大学生对菲波那契数列(Fibonacci numbers)应该都不会陌生，它是这样定义的： F(1)=1; F(2)=2; F(n)=F(n 1)+F(n 2)(n =3); 所以，阅读全文

posted @ 2019-12-18 23:31 YDDDD 阅读(265) 评论(0) 推荐(0) 编辑

2019年12月17日

Codeforces Round #603 (Div. 2) E. Editor（线段树）

摘要：链接： https://codeforces.com/contest/1263/problem/E 题意： The development of a text editor is a hard problem. You need to implement an extra module for br 阅读全文

posted @ 2019-12-17 12:48 YDDDD 阅读(148) 评论(0) 推荐(0) 编辑

Codeforces Round #603 (Div. 2) D. Secret Passwords（并查集）

摘要：链接： https://codeforces.com/contest/1263/problem/D 题意： One unknown hacker wants to get the admin's password of AtForces testing system, to get problems 阅读全文

posted @ 2019-12-17 12:46 YDDDD 阅读(201) 评论(0) 推荐(0) 编辑

精神病患者

公告