轉載http://www.mzry1992.com/blog/miao/uestc-summer-team-training-1.html有两队车（长度5000）要合成一队，每次只能...
(詳全文)
發表時間：2012-09-03 09:16:46 | 回應：0
Problem EBase Equality
Input:
standard
input
Output: standard output
Time Limit: 1 second
Numerou...
(詳全文)
發表時間：2012-09-02 13:43:19 | 回應：0
Ecosystem
There are various food chains in any ecosystem, hawk, mouse and corn to name
one. Mice fee...
(詳全文)
發表時間：2012-09-02 12:54:04 | 回應：0
Problem H
Integer Sequences from Addition of Terms
We consider sequences formed from the
addit...
(詳全文)
發表時間：2012-09-02 12:31:40 | 回應：0
Auto-mobile Charting & Manufacturing (ACM) is a company that
specializes in manufacturing automobile s...
(詳全文)
發表時間：2012-09-02 12:17:05 | 回應：0
Problem D: Blocks
Donald wishes to send a gift to his new nephew, Fooey. Donald is a bit
of a traditionalis...
(詳全文)
發表時間：2012-09-02 12:08:24 | 回應：0
好像跟 UVa 最鄰近點對問題一樣, 測資都不夠嚴謹, O(n*m) + cut 就可以通過了,而且速度還不差。#include <stdio.h&...
(詳全文)
發表時間：2012-09-01 22:19:49 | 回應：0
字串處理題, 窮舉映射對象, 然後 dfs 即可#include <stdio.h>#include <string.h>#include <map>#i...
(詳全文)
發表時間：2012-09-01 19:04:51 | 回應：0
數學解, 採用排容原理對每個點, 都可以挑 2 個邊做一個角, 因此 C(n-1, 2) * n 個角,對每個點, 不可能構成的角個數是 ...
(詳全文)
發表時間：2012-09-01 18:10:31 | 回應：1
窮舉兩個, 令一個直接 Greedy#include <stdio.h>int main() { int t, i, j; scanf("%d", &t); while(t--) {...
(詳全文)
發表時間：2012-09-01 16:07:25 | 回應：0
Boggle Blitz
In the game of Boggle, you are presented with an
table of letters. The object is to find ...
(詳全文)
發表時間：2012-09-01 10:17:43 | 回應：0
Stacking Boxes
Background
Some concepts in Mathematics and Computer Science are simple in one or
two di...
(詳全文)
發表時間：2012-08-31 16:52:41 | 回應：0
Problem E: Test
A vocational preference test, unlike an aptitude test, seeks
to identify careers that the ca...
(詳全文)
發表時間：2012-08-29 13:07:10 | 回應：0
Trust groups
The personnel department of Association of Cookie Monsters (ACM) has noticed that the
...
(詳全文)
發表時間：2012-08-28 19:19:15 | 回應：0
Come and Go
In a certain city there are N intersections connected by one-way and two-way streets. It
is ...
(詳全文)
發表時間：2012-08-28 12:24:07 | 回應：0
