摘要:
1.冒泡排序已知一组无序数据a[1]、a[2]、……a[n],需将其按升序排列。首先比较a[1]与a[2]的值,若a[1]大于a[2]则交换两者的值,否则不变。再比较a[2]与a[3]的值,若a[2]大于a[3]则交换两者的值,否则不变。再比较a[3]与a[4],以此类推,最后比较a[n-1]与a[... 阅读全文
摘要:
B. DZY Loves Stringstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDZY loves collecting special ... 阅读全文
摘要:
FatMouse' TradeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 49098 Accepted Submission(s)... 阅读全文