10 2016 档案
摘要：这道题是水题，发现平移某些边，答案就是圆心的凸包+一个圆的周长。 不要忽视精度误差！
阅读全文
摘要：因为论文的题解写得太好了，直接贴。
阅读全文
摘要：There are n circles on a infinitely large table.With every two circle, either one contains another or isolates from the other.They are never crossed n
阅读全文
摘要：Description 在平面直角坐标系中给定N个圆。已知这些圆两两没有交点，即两圆的关系只存在相离和包含。求这些圆的异或面 积并。异或面积并为：当一片区域在奇数个圆内则计算其面积，当一片区域在偶数个圆内则不考虑。 在平面直角坐标系中给定N个圆。已知这些圆两两没有交点，即两圆的关系只存在相离和包含。
阅读全文
摘要：Description G系共有n位同学，M门必修课。这N位同学的编号为0到N-1的整数，其中B神的编号为0号。这M门必修课编号为0到M- 1的整数。一位同学在必修课上可以获得的分数是1到Ui中的一个整数。如果在每门课上A获得的成绩均小于等于B获 得的成绩，则称A被B碾压。在B神的说法中，G系共有K
阅读全文
摘要：Description 上帝说，不要圆，要方，于是便有了这道题。由于我们应该方，而且最好能够尽量方，所以上帝派我们来找正方形 上帝把我们派到了一个有N行M列的方格图上，图上一共有(N+1)×(M+1)个格点，我们需要做的就是找出这些格点形 成了多少个正方形（换句话说，正方形的四个顶点都是格点）。但是
阅读全文
摘要：Sample Input 12 2 8 9 12 6 1 1 5 1 4 8 10 6 10 1 2 3 5 6 7 8 9 10 11 1 3 2 3 3 4 4 5 4 6 4 7 7 8 8 9 9 10 10 11 11 12 Sample Output 10 这道题考虑树形DP，dp[x]
阅读全文
摘要：我想了想，发现可以证明burnside定理。 置换：n个元素1,2,…,n之间的一个置换表示1被1到n中的某个数a1取代，2被1到n中的某个数a2取代，直到n被1到n中的某个数an取代，且a1,a2,…,an互不相同。 置换群：置换群的元素是置换，运算是置换的连接。例如： 可以验证置换群满足群的四个
阅读全文
摘要：There are a lot of trees in an area. A peasant wants to buy a rope to surround all these trees. So at first he must know the minimal required length o
阅读全文
摘要：Yue Fei's Battle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 760 Accepted Submission(s): 26
阅读全文
摘要：Have you ever played DOTA? If so, you may know the hero, Invoker. As one of the few intelligence carries, Invoker has 10 powerful abilities. One of th
阅读全文
摘要：Yong Zheng's Death Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 224 Accepted Submission(s)
阅读全文
摘要：Matt’s friend K.Bro is an ACMer.Yesterday, K.Bro learnt an algorithm: Bubble sort. Bubble sort will compare each pair of adjacent items and swap them
阅读全文
摘要：As we all know, Matt is an outstanding contestant in ACM-ICPC. Graph problems are his favorite.Once, he came up with a simple algorithm for finding th
阅读全文
摘要：Matt is a big fan of logo design. Recently he falls in love with logo made up by rings. The following figures are some famous examples you may know.A
阅读全文
摘要：Matt has N friends. They are playing a game together.Each of Matt’s friends has a magic number. In the game, Matt selects some (could be zero) of his
阅读全文
摘要：Matt, a famous adventurer who once defeated a pack of dire wolves alone, found a lost court. Matt finds that there are N fluorescent lights which seem
阅读全文
摘要：Matt loves letter L.A point set P is (a, b)-L if and only if there exists x, y satisfying:P = {(x, y), (x + 1, y), . . . , (x + a, y), (x, y + 1), . .
阅读全文
摘要：Dire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, Dire Wolves appear to originate from Draenor.
阅读全文
摘要：Matt is playing a naive computer game with his deeply loved pure girl. The playground is a rectangle with walls around. Two balls are put in different
阅读全文
摘要：Description In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous region
阅读全文
摘要：Description There is a curious man called Matt. One day, Matt's best friend Ted is wandering on the non-negative half of the number line. Matt finds i
阅读全文
摘要：GRE Words Once More! Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 205 Accepted Submission(s)
阅读全文
摘要：Fox Ciel is playing a card game with her friend Jiro. Jiro has n cards, each one has two attributes: position (Attack or Defense) and strength. Fox Ci
阅读全文
摘要：Andrew and Jerry are playing a game with Harry as the scorekeeper. The game consists of three rounds. In each round, Andrew and Jerry draw randomly wi
阅读全文
摘要：Fox Ciel is participating in a party in Prime Kingdom. There are n foxes there (include Fox Ciel). The i-th fox is ai years old. They will have dinner
阅读全文
摘要：Emuskald considers himself a master of flow algorithms. Now he has completed his most ingenious program yet — it calculates the maximum flow in an und
阅读全文
摘要：A gourmet came into the banquet hall, where the cooks suggested n dishes for guests. The gourmet knows the schedule: when each of the dishes will be s
阅读全文
摘要：In the country there are n cities and m bidirectional roads between them. Each city has an army. Army of the i-th city consists of ai soldiers. Now so
阅读全文
摘要：You have written on a piece of paper an array of n positive integers a[1], a[2], ..., a[n] and m good pairs of integers (i1, j1), (i2, j2), ..., (im,
阅读全文
