migo_dab的博客

UVA - 789 思路：读取每行并处理每个单词（map自动按key排序） #include #include #include #include #include #include #include #include using namespace std; int main(void) { char key; int cln = 0; string

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=836&problem=3948&mosmsg=Submission+received+with+ID+17177113 http://blog.csdn.net/zyq522376829/a

UVA - 11520 思路：每个单元与其周围单元比较确定最小字母 #include #include #include #include #include #include using namespace std; const int MAXN = 10 + 5; char sq[MAXN][MAXN]; char fill(int row, int col