摘要:
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 816Appoint description:Description Abbott’s RevengeThe 1999 W... 阅读全文
摘要:
K - Ancient Messages Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 1103Appoint description:DescriptionIn or... 阅读全文
摘要:
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 10603Appoint description:DescriptionProblem DFillThere are th... 阅读全文
摘要:
DescriptionA quadtree is a representation format used to encode images. The fundamental idea behind the quadtree is that any image can be split into f... 阅读全文
摘要:
DescriptionEach year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the fall... 阅读全文
摘要:
G - Not so Mobile Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluDescriptionBefore being an ubiquous communications gadget, a mobile wa... 阅读全文
摘要:
DescriptionYou are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of ... 阅读全文
摘要:
问题描述 观察这个数列: 1 3 0 2 -1 1 -2 ... 这个数列中后一项总是比前一项增加2或者减少3。 栋栋对这种数列很好奇,他想知道长度为 n 和为 s 而且后一项总是比前一项增加a或者减少b的整数数列可能有多少种呢?输入格式 输入的第一行包含四个整数 n s a b,含义如前... 阅读全文
摘要:
给出N行英雄的比较,每一行包含两个英雄的名字,代表第一个英雄比第二个英雄更受欢迎。英雄的数目不超过16个。问有多少种可能的受欢迎程度的序列满足N行英雄的比较。由于只有英雄数目不超过16个,可以用二进制来解决。x的的位表示还有哪些点没有处理。在这些点中选择一个入度没零的点,求剩下的点可能排列的数目。 ... 阅读全文
摘要:
Maximum repetition substringTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7578Accepted: 2281DescriptionThe repetition number of a string is... 阅读全文