专题
文章平均质量分 77
专题
sdifv
热情但不谄媚
用功但不功利
善良但坚守观念
展开
-
E - 贪心
贪心题目描述FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean. The warehouse has N rooms. The i-th room contains J[i] pounds原创 2018-02-18 22:48:56 · 237 阅读 · 0 评论 -
E - 01背包
E - 01背包题目描述Bessie has gone to the mall’s jewelry store and spies a charm bracelet. Of course, she’d like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each char原创 2018-02-20 11:40:15 · 260 阅读 · 0 评论 -
I - 素数环 搜索
素数环 搜索题目描述A ring is compose of n circles as shown in diagram. Put natural number 1, 2, …, n into each circle separately, and the sum of numbers in two adjacent circles should be a prime. Note: the numb原创 2018-02-20 11:36:15 · 237 阅读 · 0 评论 -
Z - Bitset
Z - Bitset题目描述Give you a number on base ten,you should output it on base two.(0 < n < 1000)IutputFor each case there is a postive number n on base ten, end of file.OutputFor each case output a number o原创 2018-02-20 11:31:41 · 310 阅读 · 0 评论 -
Y - 栈
Y - 栈题目描述How can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert TROT to TORT: [ i i i i o o o o i o i i o o i o ] where i stands原创 2018-02-20 11:28:55 · 397 阅读 · 0 评论 -
X - 栈
X - 栈题目描述As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest al原创 2018-02-20 11:24:38 · 317 阅读 · 0 评论 -
W - stl 的 优先队列
stl 的 优先队列题目描述Because of the wrong status of the bicycle, Sempr begin to walk east to west every morning and walk back every evening. Walking may cause a little tired, so Sempr always play some games t原创 2018-02-20 11:15:47 · 273 阅读 · 0 评论 -
Q - 贪心
贪心题目描述When playing DotA with god-like rivals and pig-like team members, you have to face an embarrassing situation: All your teammates are killed, and you have to fight 1vN.There are two key attributes原创 2018-02-20 11:10:45 · 243 阅读 · 0 评论 -
P - 贪心
贪心题目描述Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework aft原创 2018-02-18 23:25:28 · 235 阅读 · 0 评论 -
O - Number Sequence
Number Sequence题目描述A single positive integer i is given. Write a program to find the digit located in the position i in the sequence of number groups S1S2…Sk. Each group Sk consists of a sequence of po原创 2018-02-18 23:19:55 · 554 阅读 · 0 评论 -
N - A + B Again
B Again题目描述There must be many A + B problems in our HDOJ , now a new one is coming. Give you two hexadecimal integers , your task is to calculate the sum of them,and print it in hexadecimal too. Ea原创 2018-02-18 23:12:29 · 320 阅读 · 0 评论 -
G - stl 的 优先队列
stl 的 优先队列题目描述In a speech contest, when a contestant finishes his speech, the judges will then grade his performance. The staff remove the highest grade and the lowest grade and compute the average of原创 2018-02-18 23:07:13 · 324 阅读 · 0 评论 -
F - 递推
递推题目描述我们看到过很多直线分割平面的题目,今天的这个题目稍微有些变化,我们要求的是n条折线分割平面的最大数目。比如,一条折线可以将平面分成两部分,两条折线最多可以将平面分成7部分,具体如下所示。 Iutput输入数据的第一行是一个整数C,表示测试实例的个数,然后是C 行数据,每行包含一个整数n(0Output对于每个测试实例,请输出平面的最大分割数,每个实例的输出占一行。 Sample Inpu原创 2018-02-18 22:54:22 · 218 阅读 · 0 评论 -
F - 最长公共子序列
F - 最长公共子序列题目描述A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, …, xm > another sequence Z = < z1, z2, …, zk > is a su原创 2018-02-20 11:44:09 · 306 阅读 · 0 评论