black_hole6 - 博客园

2019年5月16日

Educational Codeforces Round 65 (Rated for Div. 2)(ACD)B是交互题，不怎么会

摘要： A. Telephone Number A telephone number is a sequence of exactly 11 digits, where the first digit is 8. For example, the sequence 80011223388 is a tele 阅读全文

posted @ 2019-05-16 23:16 black_hole6 阅读(325) 评论(0) 推荐(0)

C. News Distribution(并查集)

摘要： In some social network, there are nn users communicating with each other in mm groups of friends. Let's analyze the process of distributing some news 阅读全文

posted @ 2019-05-16 20:28 black_hole6 阅读(321) 评论(0) 推荐(0)

Codeforces Round #560 (Div. 3)A-E

摘要： A. Remainder output standard output output standard output output You are given a huge decimal number consisting of nn digits. It is guaranteed that t 阅读全文

posted @ 2019-05-16 16:59 black_hole6 阅读(392) 评论(0) 推荐(0)

I - 乓 (BFS+邻接表)

摘要： USTC campus network is a huge network. There is a bi-directional link between every pair of computers in the network. One of the computers is the BBS 阅读全文

posted @ 2019-05-16 09:46 black_hole6 阅读(313) 评论(0) 推荐(0)

2019年5月15日

F - 丘（欧拉函数）

摘要： Chinese people think of '8' as the lucky digit. Bob also likes digit '8'. Moreover, Bob has his own lucky number L. Now he wants to construct his luck 阅读全文

posted @ 2019-05-15 23:04 black_hole6 阅读(305) 评论(0) 推荐(0)

Building（单调栈+凸包）

摘要： Problem Description Once upon a time Matt went to a small town. The town was so small and narrow that he can regard the town as a pivot. There were so 阅读全文

posted @ 2019-05-15 21:16 black_hole6 阅读(298) 评论(0) 推荐(0)

Almost All Divisors（求因子个数及思维）

摘要：恢复内容开始 We guessed some integer number xx. You are given a list of almost all its divisors. Almost all means that there are all divisors except 11and x 阅读全文

posted @ 2019-05-15 15:32 black_hole6 阅读(388) 评论(0) 推荐(0)

2019年5月14日

寻找唯一的萌妹（思维）

摘要： Description 又到了一年一度ACMer暑期留校集训的日子了，目前一共有2n+1个小萌新报名参加暑期集训，其中2n个是帅哥，只有1个萌妹子，这是多么的悲催！由于暑期训练强度大，坚持下来可不是一件容易的事情，DHG学长想到了一个巧妙的方法，两个人组成一队，两人互相鼓励，互相监督，直到集训顺利完阅读全文

posted @ 2019-05-14 16:29 black_hole6 阅读(144) 评论(0) 推荐(0)

2019年5月13日

质数和分解(完全背包)

摘要：题目描述任何大于 1 的自然数 n 都可以写成若干个大于等于 2 且小于等于 n 的质数之和表达式(包括只有一个数构成的和表达式的情况)，并且可能有不止一种质数和的形式。例如，9 的质数和表达式就有四种本质不同的形式： 9 = 2 + 5 + 2 = 2 + 3 + 2 + 2 = 3 + 3 + 阅读全文

posted @ 2019-05-13 21:53 black_hole6 阅读(643) 评论(0) 推荐(0)

CodeForces - 505B-Mr. Kitayuta's Colorful Graph(暴力)

摘要： Mr. Kitayuta has just bought an undirected graph consisting of n vertices and medges. The vertices of the graph are numbered from 1 to n. Each edge, n 阅读全文

posted @ 2019-05-13 20:09 black_hole6 阅读(232) 评论(0) 推荐(0)

博学善思

一起成长

公告