醉酒、冰城外

DescriptionThis class is on graph theory. Mr. Kruskal teaches babies the concept of minimal spanning tree, and how to calculate the minimal spanning tree of a given graph.Now, it's time for an in-class quizz. Mr. Kruskal shows a special graphG:Gis a...

题目描述由于牛牛战队经常要外出比赛，因此在全国各地建立了很多训练基地，每一个基地都有一个坐标(x,y)。这周末，牛牛队又要出去比赛了，各个比赛的赛点都在x轴上。牛牛战队为了方便比赛，想找一个到达训练基地最大距离最小的地方作为比赛地。这个问题对于牛牛战队太简单了，它就交给了你，你来帮他算一下~输入描述输入数据第一行包含一个整数N(1≤N≤100 000)，表示牛牛战队训练基...

DescriptionAs we already know, base64 is a common binary-to-text encoding scheme. Here we define a special series of positional systems that represent numbers using a base (a.k.a. radix) of 2 to 62...

题目描述You are given four positive integers . And you know ​ for all .Given two positive integers n, and MOD, please calculate ​ modulo MOD.Does the problem look simple? Surprise! The value of n m...

DescriptionThe expression N!, reads as the factorial of N, denoting the product of the first N positive integers. If the factorial of N is written in hexadecimal without leading zeros, can you tell...