摘要： 进制转换，注意边界（WA 5次）。测试数据：26 27 52 160 Z FD结果： Z AA AZ FD 26 160# include <stdio.h># include <ctype.h># include <memory.h> char a[15];char s[15]; int main(){ int T, i, n; scanf("%d", &T); while (T--) { scanf("%s", a); if (isdigit(a[0])) { i = 0; n ... 阅读全文

摘要： 这道题的HINT彻底把我弄糊涂了，结果WA5次才发现是求最大子序列而不是连续子串：HINT子序列的定义：字符串S中从S[ i ]...S[ j ]的长度为K的字符(i<=j)，k<=j-i+1。# include <stdio.h># include <memory.h># define MAX(x, y) ((x)>(y) ? (x):(y))# define MAXN 1020int len1, len2;char s1[MAXN], s2[MAXN];short int f[MAXN][MAXN];int main(){ int i, j, ma 阅读全文