空巷挽清风

括号匹配运用简单栈的知识，先进先出的思想#include<iostream>#include<cstdio>#include<stack> //定义栈的头文件#include<algorithm>#include<cstring>using namespace std;int main(){ char str[10002];

Kirinriki Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 3009 Accepted Submission(s): 441Problem DescriptionWe define the distance of

Is Derek lying?Derek and Alfia are good friends.Derek is Chinese,and Alfia is Austrian.This summer holiday,they both participate in the summer camp of Borussia Dortmund.During the summer camp,there wil

Time To Get Up                                                           Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)

大数阶乘时间限制：3000 ms | 内存限制：65535 KB 难度：3描述 我们都知道如何计算一个数的阶乘，可是，如果这个数很大呢，我们该如何去计算它并输出它？输入 输入一个整数m (050样例输出30414093201713378043612608166064768844377641568960512000000000000解析： 大数类一般都是运用数组来储存数的每一位；代码：

HDU-Balala Power! Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 5512 Accepted Submission(s): 1398Problem DescriptionTalented Mr.Tan

How to Type（字符大小写转换）Pirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After testing for several days, she finds that if she typ

回文字符串判断回文字符串的最大长度； 析： 回文字符串是指以一个字母为中心或者以两个相同的字母为中心两边对称的字符串；#include<iostream>#include<cstdio>#include<cstring>using namespace std;char str[1000];int i;int palindrome(int x){ if(str[i-x]==st

How to Type（字符大小写转换）Pirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After testing for several days, she finds that if she

What Are You Talking About Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others) Total Submission(s): 24944 Accepted Submission(s): 8417Problem DescriptionIgna