01 2015 档案
摘要:问题 H: Planar map时间限制:1 Sec内存限制:128 MB提交:24解决:22[提交][状态][讨论版]题目描述Tigherhasworkforalongtimeinafamouscompany.Onedaysheisgivenaplanarmap(lookatthefollowin...
阅读全文
摘要:问题 I: Kid and Ants时间限制:1 Sec内存限制:128 MB提交:42解决:33[提交][状态][讨论版]题目描述Kidlikesinterestquestion,althoughhedon’tlikeantssomuch.Assumethereisainfinitelongsti...
阅读全文
摘要:问题 G: a interesting game时间限制:1 Sec内存限制:128 MB提交:29解决:10[提交][状态][讨论版]题目描述Oneday,Kidisinclass.ButKidthinkwhattheteacherteachingissoboring,sohedecidetopl...
阅读全文
摘要:Challenge of WisdomTime Limit:2 Seconds Memory Limit:32768 KBBackground"Then, I want to know whether you're a wise boy!"Problem"I have a great deal of...
阅读全文
SPOJ 5152 Brute-force Algorithm EXTREME && HDU 3221 Brute-force Algorithm 快速幂,快速求斐波那契数列,欧拉函数,同余 难度:1
摘要:5152. Brute-force Algorithm EXTREMEProblem code: BFALGPlease clickhereto download a PDF version of the contest problems. The problem is problem B in t...
阅读全文
摘要:#include #include #include #include #include #include #include using namespace std;class insertSort{public: insertSort(int * a,int size){ th...
阅读全文
摘要:7.1 int[][] triArray{ {1}, {1,2}, {1,2,3},};7.2 array[2].length8.1 Unified Modeling Language:UMLUML class diagramCircle_____________radius:double_____...
阅读全文
摘要:第六章 一维数组1数组初始化语法 array initializer2for each loop3off-by-one error 通常是在循环中该使用<的地方使用了<=4复制数组:1.for 2.System.arraycopy 3.clone5arraycopy(sourceArray, src...
阅读全文