搜索
RookieZQF
尽自己最大努力才能不后悔
展开
-
Optimal Programs
DescriptionAs you know, writing programs is often far from being easy. Things become even harder if your programs have to be as fast as possible. And sometimes there is reason for them to be. Many l翻译 2015-11-04 07:50:46 · 413 阅读 · 0 评论 -
Anagrams by Stack
DescriptionHow 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 ]翻译 2015-11-05 08:57:53 · 326 阅读 · 0 评论 -
Additive equations
Description We all understand that an integer set is a collection of distinct integers. Now the question is: given an integer set, can you find all its addtive equations? To explain what anad翻译 2015-11-13 15:22:13 · 324 阅读 · 0 评论 -
FatMouse and JavaBean II
DescriptionSo this is the second version of FatMouse and his favorite food, JavaBean -- boy he just cannot have enough of it, can he? Again FatMouse was lucky enough to find a map of another storeho翻译 2015-11-16 10:43:11 · 350 阅读 · 0 评论 -
整数因子分解问题
题目描述大于1 的正整数n可以分解为:n=x1*x2*…*xm。例如,当n=12 时,共有8 种不同的分解式:12=12;12=6*2;12=4*3;12=3*4;12=3*2*2;12=2*6;12=2*3*2;12=2*2*3。对于给定的正整数n,编程计算n共有多少种不同的分解式。输入每组测试数据的第一行有1 个正整数n(翻译 2015-11-20 07:59:21 · 3864 阅读 · 3 评论 -
Free Candies
DescriptionLittle Bob is playing a game. He wants to win some candies in it - as many as possible.There are 4 piles, each pile contains N candies. Bob is given a basket which can hold at most 5翻译 2015-11-16 21:30:48 · 540 阅读 · 0 评论 -
Skip Letter Code
DescriptionRomeo and Juliet are college students in the city of Verona and are in love with each other. Unfortunately, both their families are not very glad with this fact. They are trying to prev翻译 2015-11-19 21:04:12 · 523 阅读 · 0 评论 -
POJ 3321 Apple Tree
DescriptionThere is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.翻译 2016-01-23 18:45:58 · 332 阅读 · 0 评论 -
ZOJ Paint the Grid Reloaded
DescriptionLeo has a grid with N rows and M columns. All cells are painted with either black or white initially.Two cells A and B are called connected if they share an edge and they are in the s翻译 2016-02-29 18:57:09 · 304 阅读 · 0 评论