- 博客(6)
- 资源 (5)
- 收藏
- 关注
RSS订阅原创 Codeforces 449C - Jzzhu and Apples / 450E - Jzzhu and Apples
先是官方题解：Firstly, we should notice that 1 and the primes larger thanN / 2 can not be matched anyway, so we ignore these numbers.Let's consider each prime P where 2 P ≤ N / 2. For each prime P, w
2014-07-23 11:52:13
720
原创 Codeforces 449B - Jzzhu and Cities / 450D - Jzzhu and Cities
官方题解如下：We consider a train route (1, v) as an undirected deletable edge(1, v).Let dist(u) be the shortest path between1 and u. We add all of the edges(u, v) weighted w where dist(u) + w
2014-07-20 13:51:17
826
原创 poj1704 Georgia and Bob
Georgia and Bob decide to play a self-invented game. They draw a row of grids on paper, number the grids from left to right by 1, 2, 3, ..., and place N chessmen on different grids, as shown in the fo
2014-05-21 19:34:30
932
C语言实现TCP/IP协议通信和UDP协议通信（代码+报告）
2015-07-27
shell命令解释器C语言实现（代码+实验报告）
2015-07-27
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人