hdu 1047 (big integer sum, fgets or scanf, make you func return useful infos) 分类： hdoj 2015-06-18 08:21 39人阅读评论(0) 收藏

【hdu 1047 (big integer sum, fgets or scanf, make you func return useful infos) 分类： hdoj 2015-06-18 08:21 39人阅读评论(0) 收藏】的更多相关文章

hdu 1047 (big integer sum, fgets or scanf, make you func return useful infos) 分类： hdoj 2015-06-18 08:21 39人阅读评论(0) 收藏

errors made, boundary conditions, <= vs < , decreasing vs increasing , ++, –, '0'/'1' vs 0/1 prototype of sum, return the starting position of c-style string containing the sum, just like sprintf return number of characters successfully read. p1=sum…

hdu 1030 Delta-wave (C++, 0ms, explanatory comments.) 分类： hdoj 2015-06-15 12:21 45人阅读评论(0) 收藏

problem description http://acm.hdu.edu.cn/showproblem.php?pid=1030 #include <cstdio> #include <cmath> #include <algorithm> int calPathLength(int x, int y) { //path length from 1 (1st line, lower) to a number in ith line is only differ by…

Hdu 1506 Largest Rectangle in a Histogram 分类： Brush Mode 2014-10-28 19:16 93人阅读评论(0) 收藏

Largest Rectangle in a Histogram Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11706 Accepted Submission(s): 3219 Problem Description A histogram is a polygon composed of a sequence of rec…

HDU 1532 Drainage Ditches 分类： Brush Mode 2014-07-31 10:38 82人阅读评论(0) 收藏

Drainage Ditches Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8861 Accepted Submission(s): 4141 Problem Description Every time it rains on Farmer John's fields, a pond forms over Bessie's…

Hdu 1507 Uncle Tom's Inherited Land* 分类： Brush Mode 2014-07-30 09:28 112人阅读评论(0) 收藏

Uncle Tom's Inherited Land* Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1869 Accepted Submission(s): 777 Special Judge Problem Description Your old uncle Tom inherited a piece of land fr…

hdu 1034 (preprocess optimization, property of division to avoid if, decreasing order process) 分类： hdoj 2015-06-16 13:32 39人阅读评论(0) 收藏

IMO, version 1 better than version 2, version 2 better than version 3. make some preprocess to make you code simple and efficient. Here divide the input by 2, so you don't have to do dividsion on each loop. version 1 is best thanks to http://www.cnbl…