Probelms
文章平均质量分 62
CNnumen
If i want , i must try...
展开
-
Problem
<br /> C. Mahershalalhashbaz, Nebuchadnezzar, and Billy Bob Benjamin Go to the RegionalsTime Limit: 0.5 Seconds Memory Limit: 65536K<br /><br /><br />The Association for Computing Machinery (ACM) is considering new rules for its regional programming原创 2010-07-09 17:13:00 · 878 阅读 · 0 评论 -
ZOJ_1115
<br />#include <cstdlib>#include <iostream>#include <map>#include <sstream>using namespace std;char ch[10] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};int main(int argc, char *argv[]){ //freopen("input.txt", "rt", stdin); /原创 2010-07-27 00:04:00 · 1223 阅读 · 0 评论 -
ZOJ_2932
<br />#include <cstdlib>#include <iostream>#include <map>#include <string>using namespace std;char ch[7] = {' ', '!', '</p>, '%', '(', ')', '*'};string decode[7] = {"%20", "%21", "%24", "%25", "%28", "%29", "%2a"};const int MAX = 80;int mai原创 2010-07-26 23:39:00 · 735 阅读 · 0 评论 -
ZOJ_2886
<br />#include <cstdlib>#include <iostream>#include <string>#include <cstdio>using namespace std;int main(int argc, char *argv[]){ int caseCount; scanf("%d", &caseCount); while(caseCount-- > 0) { string input;原创 2010-07-26 16:49:00 · 711 阅读 · 0 评论 -
ZOJ_1241
<br />#include <cstdlib>#include <iostream>#include <cmath>#include <iomanip>using namespace std;inline void cal(int a, int b, int c, char ch){ float result = 0.0; if(c == -1) result = sqrt(a * a + b * b); else原创 2010-07-27 10:31:00 · 1131 阅读 · 0 评论 -
ZOJ_2497
<br />#include <cstdlib>#include <iostream>using namespace std;int main(int argc, char *argv[]){ //freopen("input.txt", "rt", stdin); // freopen("output.txt", "wt", stdout); int caseCount; cin >> caseCount; while原创 2010-07-26 17:28:00 · 685 阅读 · 0 评论 -
ZOJ_2487
<br />#include <cstdlib>#include <iostream>#include <string>using namespace std;int main(int argc, char *argv[]){ int caseCount; cin >> caseCount; while(caseCount-- > 0) { string input; cin >> input;原创 2010-07-26 15:07:00 · 639 阅读 · 0 评论 -
ZOJ_1240
<br />#include <cstdlib>#include <iostream>using namespace std;int main(int argc, char *argv[]){ int caseCount; cin >> caseCount; int index = 1; while(caseCount-- > 0) { string inputStr; cin >> input原创 2010-07-26 14:26:00 · 954 阅读 · 0 评论 -
ZOJ_2812
<br />#include <cstdlib>#include <iostream>using namespace std;const int MAX = 256;int main(int argc, char *argv[]){ //freopen("input.txt", "rt", stdin); //freopen("output.txt", "wt", stdout); char input[MAX] = {'/0'};原创 2010-07-26 00:08:00 · 1245 阅读 · 0 评论 -
求一个数组中第二大数...
<br />#include <cstdlib>#include <iostream>#include <ctime>#include <iterator>#include <vector>using namespace std;const int MIN = 0XFFFFFFFF;const int MAX_COUNT = 100;int getSecond(const vector<int> &vec){ int second = MIN; int原创 2010-07-21 17:27:00 · 1883 阅读 · 1 评论 -
数组逆序输出(递归)
<br />#include <cstdlib>#include <iostream>using namespace std;void output(int array[], int index){ if(index == 10) return; output(array, index + 1); cout << array[index] << " ";}int main(int argc, char *argv[]){原创 2010-07-22 11:08:00 · 3322 阅读 · 0 评论 -
数塔问题...
<br /> Problem Description(HDUOJ2084)在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的:<br /><br />有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少?<br /><br />已经告诉你了,这是个DP的题目,你能AC吗? <br /> Input输入数据首先包括一个整数C,表示测试实例的个数,每个测试实例的第一行是一个整数N(1 <= N <= 100),表示数塔的高度,接下来用N行数字表示数塔,原创 2010-07-13 19:44:00 · 8295 阅读 · 3 评论 -
Caterpillar Problem
<br /> A. CaterpillarTime Limit: 0.5 Seconds Memory Limit: 65536K<br /> <br /><br /><br />An undirected graph is called a caterpillar if it is connected, has no cycles, and there is a path in the graph where every node is either on this path or a nei原创 2010-07-09 17:34:00 · 869 阅读 · 0 评论 -
HDU_2222 关键字查找(AC自动机应用)...
<br /> Keywords Search<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 5353 Accepted Submission(s): 1781<br />Problem DescriptionIn the modern time, Search engine came into the life of e原创 2010-08-04 10:18:00 · 807 阅读 · 0 评论