其他

1、當Server來不及處理時，能緩衝多大資料？[Server]procedure TFormServer.UDPServer_MainUDPRead(Sender: TObject;  AData: TStream; ABinding: TIdSocketHandle);begin  ShowMessage('Hold');end;[Client]procedure TForm2.Button1Click(Sender: TObject);var 

// How Many Fibs? （斐波那契計數）// PC/UVa IDs: 110601/10183, Popularity: B, Success rate: average Level: 1// Verdict: Accepted// Submission Date: 2011-05-30// UVa Run Time: 0.012s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net////

// How Many Pieces of Land? （土地分割）// PC/UVa IDs: 110602/10213, Popularity: B, Success rate: average Level: 2// Verdict: Accepted// Submission Date: 2011-06-01// UVa Run Time: 0.888s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net//// 一個圓被圓上 n

// Counting （數數）// PC/UVa IDs: 110603/10198, Popularity: B, Success rate: high Level: 2// Verdict: Accepted// Submission Date: 2011-06-02// UVa Run Time: 0.032s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net//// 假設 F（n） 表示使用 1，2，3，4 構建的和為 n

// Expressions （括號運算式）// PC/UVa IDs: 110604/10157, Popularity: C, Success rate: average Level: 2// Verdict: Accepted// Submission Date: 2011-06-03// UVa Run Time: 0.668s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net//// 如何得到相應的遞推關係？翻看了 Catalan

// LC-Display （液晶顯示屏）// PC/UVa IDs: 110104/706, Popularity: A, Success rate: average Level: 1// Verdict: Accepted // Submission Date: 2011-04-09// UVa Run Time: 0.012s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net#include <iostream>#include

// Servicing Stations （服務站）// PC/UVa IDs: 110804/10160, Popularity: B, Success rate: low Level: 3// Verdict: Accepted // Submission Date: 2011-08-10// UVa Run Time: 0.056s// 著作權（C）2011，邱秋。metaphysis # yeah dot net//// 該題目的實質是求圖的最小支配集頂點個數。求圖的最小支配集問題是

// Tug of War （拔河）// PC/UVa IDs: 110805/10032, Popularity: B, Success rate: low Level: 2// Verdict: UVa Online Judge - Wrong answer, Programming-Challenges - Solved// Submission Date: 2011-08-09// Programming-Challenges Run Time: 0.020s//// 著作權（C）201

// Factovisors （階乘與整除）// PC/UVa IDs: 110704/10139, Popularity: A, Success rate: average Level: 2// Verdict: Accepted// Submission Date: 2011-06-11// UVa Run Time: 0.312s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net//// 思路比較簡單，計算數 m 和數 2 - n 的 GCD，若

// Garden of Eden （伊甸園）// PC/UVa IDs: 110806/10001, Popularity: B, Success rate: average Level: 2// Verdict: Accepted// Submission Date: 2011-08-11// UVa Run Time: 0.660s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net////

// Summation of Four Primes （四素數之和）// PC/UVa IDs: 110705/10168, Popularity: A, Success rate: average Level: 2// Verdict: Accepted// Submission Date: 2011-06-11// UVa Run Time: 0.128s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net////

// Complete Tree Labeling （完全樹標號）// PC/UVa IDs: 110605/10247, Popularity: C, Success rate: average Level: 2// Verdict: Accepted// Submission Date: 2011-06-06// UVa Run Time: 0.172s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net//// 如何得到遞推關係？設

// Graphical Editor （圖形化編輯器）// PC/UVa IDs: 110105/10267, Popularity: B, Success rate: low Level: 1// Verdict: Accepted// Submission Date: 2011-05-16// UVa Run Time: 0.060s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net#include <iostream>#include &

// Reverse and Add （反轉相加）// PC/UVa IDs: 110502/10018, Popularity: A, Success rate: low Level: 1// Verdict: Accepted// Submission Date: 2011-05-27// UVa Run Time: 0.028s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net//// 利用動態數組來儲存數位每一位，逆序存放。#include <

// Colour Hash （色彩繽紛遊戲）// PC/UVa IDs: 110807/704, Popularity: B, Success rate: average Level: 3// Verdict: Accepted// Submission Date: 2011-08-28// UVa Run Time: 0.048s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net//// 若從給定狀態進行單向搜尋，由於狀態較多，容易

// A Multiplication Game （乘法遊戲）// PC/UVa IDs: 110505/847, Popularity: A, Success rate: high Level: 3// Verdict: Accepted// Submission Date: 2011-05-29// UVa Run Time: 0.012s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net//// 假設最終數為 162，為了防止對方得到大於等於

// Ones （僅由 1 組成的數）// PC/UVa IDs: 110504/10127, Popularity: A, Success rate: high Level: 2// Verdict: Accepted// Submission Date: 2011-05-29// UVa Run Time: 0.008s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net//// 利用求模運算。(x * y + 1) mod n = ((x mod n)

// Polynomial Coefficients （多項式係數）// PC/UVa IDs: 110506/10105, Popularity: B, Success rate: high Level: 1// Verdict: Accepted// Submission Date: 2011-05-29// UVa Run Time: 0.024s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net//// 多項式定理的應用。多元多項式 （a + b +

// Carmichael Numbers （Carmichael 數）// PC/UVa IDs: 110702/10006, Popularity: A, Success rate: average Level: 2// Verdict: Accepted// Submission Date: 2011-06-10// UVa Run Time: 0.336s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net//// 此題關鍵是應用求模公式 x^y

// Euclid Problem （歐幾裡德問題）// PC/UVa IDs: 110703/10104, Popularity: A, Success rate: average Level: 1// Verdict: Accepted// Submission Date: 2011-06-10// UVa Run Time: 0.684s//// 著作權（C）2011，邱秋。metaphysis # yeah dot net//// 根據 Euclid 求 GCD 的過程，可以找到兩個數