![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM
Fisher4Collection
这个作者很懒,什么都没留下…
展开
-
HDU 1106 - Split String
Split String -->>Get the input string and split them to int array. -->>The point exsits in how to split the string properly. -->>And also C++ also allow us to use '+' to build a string. http原创 2015-07-27 12:58:19 · 414 阅读 · 0 评论 -
HDU 1070 - Select the cheapest product
Select the cheapest product -->>use vector> to record what we got dynamically. -->>sort by provide a customized method. http://acm.hdu.edu.cn/showproblem.php?pid=1070 #include #include #原创 2015-07-29 13:04:00 · 633 阅读 · 0 评论 -
Be cautious when using Map and Set in Java
HashMap and HashSet in Java http://acm.hust.edu.cn/vjudge/contest/view.action?cid=84400 Problem D from Ecust match import java.util.HashMap; import java.util.HashSet; import java.util.Scanner;原创 2015-07-31 14:00:35 · 460 阅读 · 0 评论 -
HDU 1020 - Encoding
HDU 1020 - Encoding Easy Problems -_-|| Input: AABBBCDDDD Output: 2A3BC4D To practice more and simple example of input and output, not exactly algorithm, just practice. .. *. -> Using s原创 2015-07-22 11:20:36 · 360 阅读 · 0 评论 -
Contest - Problem D
Using Brute Force if there is no limit for time. http://acm.hust.edu.cn/vjudge/contest/view.action?cid=85695 Problem - D import java.io.BufferedReader; import java.io.InputStreamReader;原创 2015-08-03 13:21:46 · 432 阅读 · 0 评论 -
HDU 1071 - The area
HDU 1020 - The area Easy Math Problems -_- Output the area of the shadow area. The consuming key point exsists in how to caculate a, b, c. kind of easy, as long as you just go ahead without原创 2015-07-22 11:22:59 · 664 阅读 · 0 评论 -
HDU 1039 - Check Words
Check Words: It should be filtered by: -->> It must contain at least one vowel. -->> It cannot contain three consecutive vowels or three consecutive consonants. -->> It cannot contain two cons原创 2015-07-24 14:05:20 · 341 阅读 · 0 评论 -
HDU 1012 - Calculate e
Calculate e #include #include using namespace std; int dfs(int a) { if(a == 0) return 1; if(a == 1) return 1; return a*dfs(a - 1); } int main() { double a[10]; cout << "n e" << end原创 2015-07-24 14:09:27 · 333 阅读 · 0 评论