- 博客(6)
- 收藏
- 关注
RSS订阅原创 SGU 144. Meeting（概率）
Two of the three members of the winning team of one of the ACM regional contests are going to meet in order to train for the upcoming World Finals. They decided that they will meet sometime between X
2017-10-14 19:11:56
861
原创 SGU 143. Long Live the Queen（树形DP）
The Queen of Byteland is very loved by her people. In order to show her their love, the Bytelanders have decided to conquer a new country which will be named according to the queen's name. This new co
2017-10-14 18:22:04
908
原创 SGU 142. Keyword（暴力枚举）
Kevin has invented a new algorithm to crypt and decrypt messages, which he thinks is unbeatable. The algorithm uses a very large key-string, out of which a keyword is found out after applying the algo
2017-10-14 16:55:13
642
原创 SGU 134. Centroid（树的重心）
You are given an undirected connected graph, with N vertices and N-1 edges (a tree). You must find the centroid(s) of the tree. In order to define the centroid, some integer value will be assosciate
2017-10-13 16:50:01
1015
原创 SGU 125. Shtirlits（dfs）
There is a checkered field of size N x N cells (1 Ј N Ј 3). Each cell designates the territory of a state (i.e. N2 states). Each state has an army. Let A [i, j] be the number of soldiers in the stat
2017-10-10 20:06:03
844
原创 SGU 124. Broken line（射线法判断一个点是否在一个多边形内）
There is a closed broken line on a plane with sides parallel to coordinate axes, without self-crossings and self-contacts. The broken line consists of K segments. You have to determine, whether a give
2017-10-09 21:03:55
868
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人