![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
文章平均质量分 92
xujiangang_mmi
这个作者很懒,什么都没留下…
展开
-
UVa Problem 114 - Simulation Wizardry
[cpp] view plaincopyprint?// UVa Problem 114 - Simulation Wizardry // Verdict: Accepted // Submission Date: 2011-12-02 // UVa Run Time: 0.084s // // 版权所有(C)2011,邱秋。metaphysis #转载 2012-12-13 19:53:11 · 475 阅读 · 0 评论 -
把一元兑换成1分、2分、5分的硬币,有几种换法?
用1分2分5分硬币凑成1元共有多少种方法?这是一种直接的解法。基本想法是按1五分硬币的个救将所有凑法分类。假定五分硬币有20个,则没有二分硬币,因此只有一种凑法。假定五分硬币有19个,币值为5×19=95分, 因此要使总币值不超过1元=100分,所取二分硬币的币值不能超过5分。很明显,二分硬币的个数可以为0个,1个,或2个,这样就有三种不同的凑法。如此继续下去,可以看出不同的凑法共有1翻译 2013-01-25 19:22:35 · 7609 阅读 · 0 评论 -
正则表达式
表 1. 字符类字符含义举例.匹配任意一个字符abc.可以匹配abcd、abc9等[]匹配括号中的任意一个字符[abc]d可以匹配ad、bd或cd-在[]括号内表示字符范围[0-9a-fA-F]可以匹配一位十六进制数字^位于[]括号内的开头,匹配除括号中的字符之外的任意一个字符[^x翻译 2013-01-25 19:23:39 · 350 阅读 · 0 评论 -
UVa Problem 119 - Greedy Gift Givers
[cpp] view plaincopyprint?// UVa Problem 119 - Greedy Gift Givers // Verdict: Accepted // Submission Date: 2011-11-26 // UVa Run Time: 0.012s // // 版权所有(C)2011,邱秋。metaphysis # y转载 2012-12-13 19:50:24 · 323 阅读 · 0 评论 -
UVa Problem 100 The 3n+1 problem (3n+1 问题)
[cpp] view plaincopyprint?// The 3n+1 problem (3n+1 问题) // PC/UVa IDs: 110101/100, Popularity: A, Success rate: low Level: 1 // Verdict: Accepted // Submission Date: 2011-05-22 //转载 2012-12-13 20:03:56 · 979 阅读 · 0 评论 -
UVa Problem 10189 Minesweeper (扫雷)
[cpp] view plaincopyprint?// Minesweeper (扫雷) // PC/UVa IDs: 110102/10189, Popularity: A, Success rate: high Level: 1 // Verdict: Accepted // Submission Date: 2011-04-09 // UVa Ru转载 2012-12-13 20:03:17 · 299 阅读 · 0 评论 -
UVa Problem 10137 The Trip (旅行)
[cpp] view plaincopyprint?// The Trip (旅行) // PC/UVa IDs: 110103/10137, Popularity: B, Success rate: average Level: 1 // Verdict: Accepted // Submission Date: 2011-04-09 // UVa Run转载 2012-12-13 20:02:43 · 353 阅读 · 0 评论 -
UVa Problem 706 LC-Display (液晶显示屏)
[cpp] view plaincopyprint?// LC-Display (液晶显示屏) // PC/UVa IDs: 110104/706, Popularity: A, Success rate: average Level: 1 // Verdict: Accepted // Submission Date: 2011-04-09 // UVa转载 2012-12-13 20:02:05 · 424 阅读 · 0 评论 -
UVa Problem 10033 Interpreter (解释器)
[cpp] view plaincopyprint?// Interpreter (解释器) // PC/UVa IDs: 110106/10033, Popularity: B, Success rate: low Level: 2 // Verdict: Accepted // Submission Date: 2011-04-09 // UVa Run转载 2012-12-13 20:00:30 · 318 阅读 · 0 评论 -
UVa Problem 10165 - Stone Game
[cpp] view plaincopyprint?// UVa Problem 10165 - Stone Game // Verdict: Accepted // Submission Date: 2011-11-17 // UVa Run Time: 0.020s // // 版权所有(C)2011,邱秋。metaphysis # yeah do转载 2012-12-13 19:55:48 · 392 阅读 · 0 评论 -
UVa Problem 110 - Meta-Loopless Sorts
[cpp] view plaincopyprint?// UVa Problem 110 - Meta-Loopless Sorts // Verdict: Accepted // Submission Date: 2011-11-25 // UVa Run Time: 0.196s // // 版权所有(C)2011,邱秋。metaphysis #转载 2012-12-13 19:54:44 · 202 阅读 · 0 评论 -
UVa Problem 115 - Climbing Trees
// UVa Problem 115 - Climbing Trees // Verdict: Accepted // Submission Date: 2011-11-27 // UVa Run Time: 0.008s // // 版权所有(C)2011,邱秋。metaphysis # yeah dot net // // [解题方法] // 模转载 2012-12-13 19:51:43 · 383 阅读 · 0 评论 -
UVa Problem 10267 Graphical Editor (图形化编辑器)
[cpp] view plaincopyprint?// Graphical Editor (图形化编辑器) // PC/UVa IDs: 110105/10267, Popularity: B, Success rate: low Level: 1 // Verdict: Accepted // Submission Date: 2011-05-16 //转载 2012-12-13 20:01:25 · 290 阅读 · 0 评论 -
UVa Problem 10196 Check the Check (将军)
[cpp] view plaincopyprint?// Check the Check (将军) // PC/UVa IDs: 110107/10196, Popularity: B, Success rate: average Level: 1 // Verdict: Accepted // Submission Date: 2011-05-22 //转载 2012-12-13 19:59:46 · 369 阅读 · 0 评论 -
UVa Problem 10142 Australian Voting (澳大利亚投票)
[cpp] view plaincopyprint?// Australian Voting (澳大利亚投票) // PC/UVa IDs: 110108/10142, Popularity: B, Success rate: low Level: 1 // Verdict: Accepted // Submission Date: 2011-05-22 /转载 2012-12-13 19:58:54 · 355 阅读 · 0 评论 -
UVa Problem 101 - The Blocks Problem
[cpp] view plaincopyprint?// UVa Problem 101 - The Blocks Problem // Verdict: Accepted // Submission Date: 2011-10-16 // UVa Run Time: 0.020s // // 版权所有(C)2011,邱秋。metaphysis # y转载 2012-12-13 19:58:08 · 299 阅读 · 0 评论 -
UVa Problem 102 - Ecological Bin Packing
[cpp] view plaincopyprint?// UVa Problem 102 - Ecological Bin Packing // Verdict: Accepted // Submission Date: 2011-10-16 // UVa Run Time: 0.164s // // 版权所有(C)2011,邱秋。metaphysis转载 2012-12-13 19:57:20 · 262 阅读 · 0 评论 -
实现itoa函数的源代码
char *my_itoa(int num,char *str,int radix){ const char table[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"; char *ptr = str; bool negative = false; if(num == 0){ //num=0 *ptr++='0'; *转载 2013-04-18 09:23:17 · 1595 阅读 · 1 评论