码迷,mamicode.com
首页 >  
搜索关键字:uva 10617 again pali    ( 9112个结果
UVA Matrix Chain Multiplication
题目如下: Matrix Chain Multiplication Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which m...
分类:其他好文   时间:2014-05-10 04:40:36    阅读次数:318
UVA-1401-Remember the Word(Trie)
Neal is very curious about combinatorial problems, and now here comes a problem about words. Knowing that Ray has a photographic memory and this may not trouble him, Neal gives it to Jiejie. Since Ji...
分类:其他好文   时间:2014-05-10 03:48:22    阅读次数:352
UVA Parentheses Balance
题目如下: Parentheses Balance You are given a string consisting of parentheses () and []. A string of this type is said to be correct: (a)     if it is the empty string (b)     if A and B are ...
分类:其他好文   时间:2014-05-09 20:57:46    阅读次数:316
UVA ShellSort
题目如下: Problem D: ShellSort He made each turtle stand on another one's back And he piled them all up in a nine-turtle stack. And then Yertle climbed up. He sat down on the pile. What a wonderful v...
分类:其他好文   时间:2014-05-09 06:20:44    阅读次数:396
UVA 10025(数学)
The ? 1 ? 2 ? ... ? n = k problem  The problem Given the following formula, one can set operators '+' or '-' instead of each '?', in order to obtain a given k ? 1 ? 2 ? ... ? n =...
分类:其他好文   时间:2014-05-09 06:10:40    阅读次数:285
uva :185 - Roman Numerals(dfs)
题目:uva :185 - Roman Numerals 题目大意:给出一个字符串的等式,问这个字符串是否是罗马等式吗?有符合的阿拉伯等式吗?前者是就输出correct or incorrect ,后者就得分情况: ambiguous 能组成阿拉伯等式的字母组合大于等于2, valid 能组成阿拉伯等式的字母组合只有1种impossible 没有符合阿拉伯等式的字母组合。解...
分类:其他好文   时间:2014-05-09 06:06:02    阅读次数:329
uva 10020- Minimal coverage (贪心思想 简单区间覆盖)
题目大意:给出一个范围M,然后给出若干的区间,以0 0 终止, 要求用最少的区间将0 ~M 覆盖,输出最少个数以及方案。 解题思路:典型的区间覆盖问题,算法竞赛入门经典P154上有讲。 /*author: charkj_z */ /*time: 0.108s */ /*rank: 674 */ /*为什么不把没用的地方去掉? 因为去掉了我觉得不像我能写出来的*/ /*Ac code :...
分类:其他好文   时间:2014-05-09 02:26:29    阅读次数:275
uva575
/* * uva575 * Date:2014/5/7 * State: AC */ #include #include #include #include #include using namespace std; const int MAXN=34; char Arr[MAXN]; int main() { //cout << "Hello world!" << end...
分类:其他好文   时间:2014-05-09 02:25:56    阅读次数:269
ZOJ 3780 Paint the Grid Again(topsort)
ZOJ Problem Set - 3780 Paint the Grid Again Time Limit: 2 Seconds      Memory Limit: 65536 KB Leo has a grid with N × N cells. He wants to paint each cell with a specific color (either black ...
分类:其他好文   时间:2014-05-09 02:00:35    阅读次数:506
uva10879
/* * uva10879 * Date:2014/5/7 * State:AC */ #include #include using namespace std; int main() { //cout << "Hello world!" <>N; ...
分类:其他好文   时间:2014-05-09 00:30:58    阅读次数:287
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!