摘要： 原型：int isalpha（int ch） (另外的俩个函数格式和这个一样)用法：头文件加入#include <cctype>(C语言使用<ctype.h>功能：判断字符ch是否为英文字母，当ch为英文字母a-z或A-Z时，在标准c中相当于使用“isupper(ch)||islower(ch)”做测试，返回非零值(不一定是1)，否则返回零。#include<stdio.h>#include<ctype.h>//string.h不行 #include <conio.h>//getch()int main(){ char ch=' 阅读全文

摘要： RailsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 18846Accepted: 7515DescriptionThere is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possible to establish 阅读全文

摘要： ZipperTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 13041Accepted: 4560DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitrarily, but each must stay in it 阅读全文

摘要： Recaman's SequenceTime Limit: 3000MSMemory Limit: 60000KTotal Submissions: 18575Accepted: 7751DescriptionThe Recaman's sequence is defined by a0 = 0 ; for m > 0, am = am−1 − m if the rsulting am is positive and not already in the sequence, otherwise am = am−1 + m. The first few numbers in 阅读全文