书名: Harry Potter 1 – Harry Potter and the Sorcerer’s Stone 作者:J.K. Rowling 单词数:7.8万 不重复单词数:6000(我怎么感觉不止6000?) 首万词不重复单词数:1800 蓝思值:880 阅读时间:2015年3月16日 – 4月11日(4月4日完成全书,又把前6章精读了一遍) 在看完了上一本英文书<尼罗河上的惨案>后,孩子强烈要求我读<哈利波特>,因为她已经把全套7本的中文版都读完了,她说如果遇到不明白的…

Stealing Harry Potter's Precious Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Problem Description Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in…

假设你是harry potter,在grid的左上角,你现在要走到右下角,grid中有正数也有负数,遇到正数表示你的strength增加那么多,遇到负数表示strength减少那么多,在任何时刻如果你的strength小于等于0,那么你就挂了.在一开始你有一定的初始的strength,现在问这个初始的strength最少是多少,才能保证你能够找到一条路走到右下角.每一步只能向右或者向下. http://www.mitbbs.com/article_t1/JobHunting/32611137_0…

Names appearing in "Harry Potter" 1.Harry Potter ①Harry is from Henry. ②Harry is related to Old High German Heri, which means army. James Potter and Lily Evans 2.Hermione Granger Hands up if you had been pronouncing Hermione's name wrong when yo…

题目链接:hdu 4771 Stealing Harry Potter's Precious 题目大意:在一个N*M的银行里,贼的位置在'@',如今给出n个宝物的位置.如今贼要将全部的宝物拿到手.问最短的路径,不须要考虑离开. 解题思路:由于宝物最多才4个,加上贼的位置,枚举两两位置,用bfs求两点距离,假设存在两点间不能到达,那么肯定是不能取全然部的宝物. 然后枚举取宝物的顺序.维护ans最小. #include <cstdio> #include <cstring> #incl…

注意--你可能会爆内存-- 假设一个直接爆搜索词-- 队列存储器元件被减少到-- #include<iostream> #include<map> #include<string> #include<cstring> #include<cstdio> #include<cstdlib> #include<cmath> #include<queue> #include<vector> #include…

称号:Harry Potter and the Prisoner of Azkaban 作者:J.K. Rowling 篇幅: 448页 蓝思值:880L 用时:    11天 工具:  有道词典 [透析成果] 这是我读完的第4本英文原著.用词典查了151个单词.速度有明显提升.查询的生词数也降低了. 以下是全部单词: 1, indulge  [ɪn'dʌldʒ] vt. 满足:纵容:使高兴.使沉迷于-; vi. 沉溺:满足:放任 2, indulge in  [] vt. 沉湎于,沉溺于 3,…

Harry Potter and the Hide Story Problem Description iSea is tired of writing the story of Harry Potter, so, lucky you, solving the following problem is enough.   Input The first line contains a single integer T, indicating the number of test cases. E…

Harry Potter and the Hide Story Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2193    Accepted Submission(s): 530 Problem Description iSea is tired of writing the story of Harry Potter, so,…

Harry Potter and J.K.Rowling http://acm.hdu.edu.cn/showproblem.php?pid=3982 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1094    Accepted Submission(s): 357 Problem Description In July 31st,…