https://blog.csdn.net/acm_codezh-cnhttps://blog.csdn.net/https://blog.csdn.net/acm_code/article/details/46858779https://blog.csdn.net/acm_code/article/details/46858779acm_codeMon, 13 Jul 2015 09:56:01 +0800https://blog.csdn.net/acm_code/article/details/43273721https://blog.csdn.net/acm_code/article/details/43273721acm_codeThu, 29 Jan 2015 17:18:38 +0800https://blog.csdn.net/acm_code/article/details/43273417https://blog.csdn.net/acm_code/article/details/43273417acm_codeThu, 29 Jan 2015 17:00:28 +0800https://blog.csdn.net/acm_code/article/details/43273003https://blog.csdn.net/acm_code/article/details/43273003acm_codeThu, 29 Jan 2015 16:36:43 +0800https://blog.csdn.net/acm_code/article/details/43272385https://blog.csdn.net/acm_code/article/details/43272385acm_codeThu, 29 Jan 2015 16:00:48 +0800    100*sigma(a[i])-x*sigma(b[i])=0]]>https://blog.csdn.net/acm_code/article/details/43271603https://blog.csdn.net/acm_code/article/details/43271603acm_codeThu, 29 Jan 2015 15:09:57 +0800https://blog.csdn.net/acm_code/article/details/43233273https://blog.csdn.net/acm_code/article/details/43233273acm_codeWed, 28 Jan 2015 17:10:35 +0800https://blog.csdn.net/acm_code/article/details/43232591https://blog.csdn.net/acm_code/article/details/43232591acm_codeWed, 28 Jan 2015 16:37:21 +0800https://blog.csdn.net/acm_code/article/details/43232053https://blog.csdn.net/acm_code/article/details/43232053acm_codeWed, 28 Jan 2015 16:07:10 +0800https://blog.csdn.net/acm_code/article/details/43231603https://blog.csdn.net/acm_code/article/details/43231603acm_codeWed, 28 Jan 2015 15:44:38 +0800https://blog.csdn.net/acm_code/article/details/41788109https://blog.csdn.net/acm_code/article/details/41788109acm_codeSun, 07 Dec 2014 15:52:33 +0800https://blog.csdn.net/acm_code/article/details/41623511https://blog.csdn.net/acm_code/article/details/41623511acm_codeSun, 30 Nov 2014 16:01:15 +0800https://blog.csdn.net/acm_code/article/details/41211537https://blog.csdn.net/acm_code/article/details/41211537acm_codeMon, 17 Nov 2014 16:27:40 +0800https://blog.csdn.net/acm_code/article/details/41210329https://blog.csdn.net/acm_code/article/details/41210329acm_codeMon, 17 Nov 2014 15:30:54 +0800https://blog.csdn.net/acm_code/article/details/41209929https://blog.csdn.net/acm_code/article/details/41209929acm_codeMon, 17 Nov 2014 15:16:52 +0800https://blog.csdn.net/acm_code/article/details/41082201https://blog.csdn.net/acm_code/article/details/41082201acm_codeThu, 13 Nov 2014 16:39:23 +0800https://blog.csdn.net/acm_code/article/details/41013585https://blog.csdn.net/acm_code/article/details/41013585acm_codeTue, 11 Nov 2014 16:49:23 +08001，b->2……z->26，ab->27……vwxyz->83681. 给定一个字符串，若其合法，输出其编码，否则输出0 分析：先判断是否合法，若合法，再算其编码 计算编码即计算比该字符串小的字符串的个数，再加1即为其编码]]>https://blog.csdn.net/acm_code/article/details/41012937https://blog.csdn.net/acm_code/article/details/41012937acm_codeTue, 11 Nov 2014 16:13:32 +0800https://blog.csdn.net/acm_code/article/details/41012249https://blog.csdn.net/acm_code/article/details/41012249acm_codeTue, 11 Nov 2014 15:31:29 +0800https://blog.csdn.net/acm_code/article/details/41007069https://blog.csdn.net/acm_code/article/details/41007069acm_codeTue, 11 Nov 2014 09:21:42 +0800