原创 hdu 1081 to be max
Problem Description Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguou
原创 hdu 1046 Gridland
Problem Description For years, computer scientists have been trying to find efficient solutions to different computin
原创 hdu 1050 Asia 2001, Taejon (South Korea)
Problem Description The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is
原创 hdu 1044 Collect More Jewels
Problem Description It is written in the Book of The Lady: After the Creation, the cruel god Moloch rebelled against
原创 hdu1082 Matrix Chain Multiplication
Problem Description Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to
原创 hdu 1060 leftmost digit
鏈接:http://acm.hdu.edu.cn/showproblem.php?pid=1060 思路:nlogn的第一位小數位取出來,再求10的密就是我們要的結果了,不解釋,就是這麼叼。 Problem Description
原创 OpenGL學習筆記:(2)iOS下GLES環境配置
1,OpenGL 與 OpenGLES(GLES) 在OpenGL學習筆記:(1)中已經講清楚了OpenGL是什麼以及一些想關的基礎知識,此小節主要講GLES和OpenGL的關係,從一種角度上講,OpenGL(4.3及後續版本)是GLES
原创 hdu 1063 Exponentiatio(East Central North America 1988)
Problem Description Problems involving the computation of exact values of very large magnitude and precision are comm
原创 POJ月賽題目Matrix Power Series
描述 Given a n × n matrix A anda positive integer k, find the sum S = A + A2 + A3 +… + Ak. 輸入 The input contains exactly