dfs
superxtong
浮点猫
展开
-
FZU 2107F - Hua Rong Dao
F - Hua Rong Dao Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeFZU 2107 Description Cao Cao was hunted down by thousands of enemy soldiers when he原创 2016-06-03 15:05:00 · 378 阅读 · 0 评论 -
USACO-Zero Sum
Consider the sequence of digits from 1 through N (where N=9) in increasing order: 1 2 3 … N.Now insert either a +' for addition or a-’ for subtraction or a ` ’ [blank] to run the digits together betwee原创 2016-06-10 01:03:26 · 291 阅读 · 0 评论 -
USACO-Controlling Companies
Some companies are partial owners of other companies because they have acquired part of their total shares of stock. For example, Ford at one point owned 12% of Mazda. It is said that a company A contr原创 2016-06-12 13:50:19 · 696 阅读 · 0 评论 -
C. NP-Hard Problem
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.Suppose the graph G is given. Subset A of its vertices is called a vert原创 2016-07-23 01:11:14 · 520 阅读 · 0 评论