摘要：
题目描述 There are exactly nnn towns in Byteotia. Some towns are connected by bidirectional roads. There are no crossroads outside towns, though there may 阅读全文
摘要：
题目描述 幼儿园里有 NNN 个小朋友，lxhgww\text{lxhgww}lxhgww 老师现在想要给这些小朋友们分配糖果，要求每个小朋友都要分到糖果。 但是小朋友们也有嫉妒心，总是会提出一些要求，比如小明不希望小红分到的糖果比他的多，于是在分配糖果的时候，lxhgww\text{lxhgww} 阅读全文
摘要：
A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools t 阅读全文
摘要：
题目背景 缩点+DP 题目描述 给定一个 nnn 个点 mmm 条边有向图，每个点有一个权值，求一条路径，使路径经过的点权值之和最大。你只需要求出这个权值和。 允许多次经过一条边或者一个点，但是，重复经过的点，权值只计算一次。 输入格式 第一行两个正整数 n,mn,mn,m 第二行 nnn 个整数， 阅读全文
摘要：
Phoenix has decided to become a scientist! He is currently investigating the growth of bacteria. Initially, on day 11, there is one bacterium with mas 阅读全文
摘要：
Phoenix has a string ss consisting of lowercase Latin letters. He wants to distribute all the letters of his string into kk non-empty strings a1,a2,…, 阅读全文
摘要：
Phoenix loves beautiful arrays. An array is beautiful if all its subarrays of length kk have the same sum. A subarray of an array is any sequence of c 阅读全文
摘要：
Phoenix has nn coins with weights 21,22,…,2n21,22,…,2n. He knows that nn is even. He wants to split the coins into two piles such that each pile has e 阅读全文
摘要：
比赛链接：https://www.jisuanke.com/contest/8290?view=challenges A. You are playing a game in which a group of players take turns saying animal names. The a 阅读全文
摘要：
You are given an undirected unweighted graph consisting of nn vertices and mm edges (which represents the map of Bertown) and the array of prices pp o 阅读全文