从www.cmd5.com整理出的MD5加密.hta - 中国DOS联盟论坛

<title>MD5加密</title>
<body onload=i.focus()>
<textarea name=i style=width=100%;height=80% onkeyup=md5(i.value)></textarea>
<br>MD5加密结果：<br>
<span id="ctl00_ContentPlaceHolder1_LabelResult"/>









<script>
/* http://www.cmd5.com/md5.js	{s11ss 2008-1-6 收集整理} */
/*
 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
 * Digest Algorithm, as defined in RFC 1321.
 * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
 * Distributed under the BSD License
 * See http://pajhome.org.uk/crypt/md5 for more info.
 */

/*
 * Configurable variables. You may need to tweak these to be compatible with
 * the server-side, but the defaults work in most cases.
 */
var hexcase = 0;  /* hex output format. 0 - lowercase; 1 - uppercase        */
var b64pad  = ""; /* base-64 pad character. "=" for strict RFC compliance   */
var chrsz   = 8;  /* bits per input character. 8 - ASCII; 16 - Unicode      */

/*
 * These are the functions you'll usually want to call
 * They take string arguments and return either hex or base-64 encoded strings
 */
function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));}
function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));}
function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));}
function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); }
function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); }
function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); }

/*
 * Perform a simple self-test to see if the VM is working
 */
function md5_vm_test()
{
  return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";
}

/*
 * Calculate the MD5 of an array of little-endian words, and a bit length
 */
function core_md5(x, len)
{
  /* append padding */
  x |= 0x80 << ((len) % 32);
  x = len;

  var a =  1732584193;
  var b = -271733879;
  var c = -1732584194;
  var d =  271733878;

  for(var i = 0; i < x.length; i += 16)
  {
    var olda = a;
    var oldb = b;
    var oldc = c;
    var oldd = d;

    a = md5_ff(a, b, c, d, x, 7 , -680876936);
    d = md5_ff(d, a, b, c, x, 12, -389564586);
    c = md5_ff(c, d, a, b, x, 17,  606105819);
    b = md5_ff(b, c, d, a, x, 22, -1044525330);
    a = md5_ff(a, b, c, d, x, 7 , -176418897);
    d = md5_ff(d, a, b, c, x, 12,  1200080426);
    c = md5_ff(c, d, a, b, x, 17, -1473231341);
    b = md5_ff(b, c, d, a, x, 22, -45705983);
    a = md5_ff(a, b, c, d, x, 7 ,  1770035416);
    d = md5_ff(d, a, b, c, x, 12, -1958414417);
    c = md5_ff(c, d, a, b, x, 17, -42063);
    b = md5_ff(b, c, d, a, x, 22, -1990404162);
    a = md5_ff(a, b, c, d, x, 7 ,  1804603682);
    d = md5_ff(d, a, b, c, x, 12, -40341101);
    c = md5_ff(c, d, a, b, x, 17, -1502002290);
    b = md5_ff(b, c, d, a, x, 22,  1236535329);

    a = md5_gg(a, b, c, d, x, 5 , -165796510);
    d = md5_gg(d, a, b, c, x, 9 , -1069501632);
    c = md5_gg(c, d, a, b, x, 14,  643717713);
    b = md5_gg(b, c, d, a, x, 20, -373897302);
    a = md5_gg(a, b, c, d, x, 5 , -701558691);
    d = md5_gg(d, a, b, c, x, 9 ,  38016083);
    c = md5_gg(c, d, a, b, x, 14, -660478335);
    b = md5_gg(b, c, d, a, x, 20, -405537848);
    a = md5_gg(a, b, c, d, x, 5 ,  568446438);
    d = md5_gg(d, a, b, c, x, 9 , -1019803690);
    c = md5_gg(c, d, a, b, x, 14, -187363961);
    b = md5_gg(b, c, d, a, x, 20,  1163531501);
    a = md5_gg(a, b, c, d, x, 5 , -1444681467);
    d = md5_gg(d, a, b, c, x, 9 , -51403784);
    c = md5_gg(c, d, a, b, x, 14,  1735328473);
    b = md5_gg(b, c, d, a, x, 20, -1926607734);

    a = md5_hh(a, b, c, d, x, 4 , -378558);
    d = md5_hh(d, a, b, c, x, 11, -2022574463);
    c = md5_hh(c, d, a, b, x, 16,  1839030562);
    b = md5_hh(b, c, d, a, x, 23, -35309556);
    a = md5_hh(a, b, c, d, x, 4 , -1530992060);
    d = md5_hh(d, a, b, c, x, 11,  1272893353);
    c = md5_hh(c, d, a, b, x, 16, -155497632);
    b = md5_hh(b, c, d, a, x, 23, -1094730640);
    a = md5_hh(a, b, c, d, x, 4 ,  681279174);
    d = md5_hh(d, a, b, c, x, 11, -358537222);
    c = md5_hh(c, d, a, b, x, 16, -722521979);
    b = md5_hh(b, c, d, a, x, 23,  76029189);
    a = md5_hh(a, b, c, d, x, 4 , -640364487);
    d = md5_hh(d, a, b, c, x, 11, -421815835);
    c = md5_hh(c, d, a, b, x, 16,  530742520);
    b = md5_hh(b, c, d, a, x, 23, -995338651);

    a = md5_ii(a, b, c, d, x, 6 , -198630844);
    d = md5_ii(d, a, b, c, x, 10,  1126891415);
    c = md5_ii(c, d, a, b, x, 15, -1416354905);
    b = md5_ii(b, c, d, a, x, 21, -57434055);
    a = md5_ii(a, b, c, d, x, 6 ,  1700485571);
    d = md5_ii(d, a, b, c, x, 10, -1894986606);
    c = md5_ii(c, d, a, b, x, 15, -1051523);
    b = md5_ii(b, c, d, a, x, 21, -2054922799);
    a = md5_ii(a, b, c, d, x, 6 ,  1873313359);
    d = md5_ii(d, a, b, c, x, 10, -30611744);
    c = md5_ii(c, d, a, b, x, 15, -1560198380);
    b = md5_ii(b, c, d, a, x, 21,  1309151649);
    a = md5_ii(a, b, c, d, x, 6 , -145523070);
    d = md5_ii(d, a, b, c, x, 10, -1120210379);
    c = md5_ii(c, d, a, b, x, 15,  718787259);
    b = md5_ii(b, c, d, a, x, 21, -343485551);

    a = safe_add(a, olda);
    b = safe_add(b, oldb);
    c = safe_add(c, oldc);
    d = safe_add(d, oldd);
  }
  return Array(a, b, c, d);

}

/*
 * These functions implement the four basic operations the algorithm uses.
 */
function md5_cmn(q, a, b, x, s, t)
{
  return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
}
function md5_ff(a, b, c, d, x, s, t)
{
  return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
}
function md5_gg(a, b, c, d, x, s, t)
{
  return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
}
function md5_hh(a, b, c, d, x, s, t)
{
  return md5_cmn(b ^ c ^ d, a, b, x, s, t);
}
function md5_ii(a, b, c, d, x, s, t)
{
  return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
}

/*
 * Calculate the HMAC-MD5, of a key and some data
 */
function core_hmac_md5(key, data)
{
  var bkey = str2binl(key);
  if(bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz);

  var ipad = Array(16), opad = Array(16);
  for(var i = 0; i < 16; i++)
  {
    ipad = bkey ^ 0x36363636;
    opad = bkey ^ 0x5C5C5C5C;
  }

  var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz);
  return core_md5(opad.concat(hash), 512 + 128);
}

/*
 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
 * to work around bugs in some JS interpreters.
 */
function safe_add(x, y)
{
  var lsw = (x & 0xFFFF) + (y & 0xFFFF);
  var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
  return (msw << 16) | (lsw & 0xFFFF);
}

/*
 * Bitwise rotate a 32-bit number to the left.
 */
function bit_rol(num, cnt)
{
  return (num << cnt) | (num >>> (32 - cnt));
}

/*
 * Convert a string to an array of little-endian words
 * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
 */
function str2binl(str)
{
  var bin = Array();
  var mask = (1 << chrsz) - 1;
  for(var i = 0; i < str.length * chrsz; i += chrsz)
    bin |= (str.charCodeAt(i / chrsz) & mask) << (i%32);
  return bin;
}

/*
 * Convert an array of little-endian words to a string
 */
function binl2str(bin)
{
  var str = "";
  var mask = (1 << chrsz) - 1;
  for(var i = 0; i < bin.length * 32; i += chrsz)
    str += String.fromCharCode((bin >>> (i % 32)) & mask);
  return str;
}

/*
 * Convert an array of little-endian words to a hex string.
 */
function binl2hex(binarray)
{
  var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
  var str = "";
  for(var i = 0; i < binarray.length * 4; i++)
  {
    str += hex_tab.charAt((binarray >> ((i%4)*8+4)) & 0xF) +
           hex_tab.charAt((binarray >> ((i%4)*8  )) & 0xF);
  }
  return str;
}

/*
 * Convert an array of little-endian words to a base-64 string
 */
function binl2b64(binarray)
{
  var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  var str = "";
  for(var i = 0; i < binarray.length * 4; i += 3)
  {
    var triplet = (((binarray >> 8 * ( i   %4)) & 0xFF) << 16)
                | (((binarray >> 8 * ((i+1)%4)) & 0xFF) << 8 )
                |  ((binarray >> 8 * ((i+2)%4)) & 0xFF);
    for(var j = 0; j < 4; j++)
    {
      if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
      else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
    }
  }
  return str;
}
String.prototype.trim = function()
{
    return this.replace(/(^\s*)|(\s*$)/g, "");
}
var lastInput;
function md5(text) {
    //text=text.trim();
    //var reg=/^{16}$|^{32}$/;
    //if (reg.test(text))
    //{
      //  ctl00_ContentPlaceHolder1_LabelResult.innerHTML='';
    //}
    //else
    //{
	    var ret = hex_md5(text);
	    ctl00_ContentPlaceHolder1_LabelResult.innerHTML = 'MD5(32) = <font color=red>'+ ret+'</font><br><br>' ;
	    ctl00_ContentPlaceHolder1_LabelResult.innerHTML += 'MD5(16) = <font color=red>'+ ret.substr(8,16)+'</font>';
	    lastInput=text;
	//}
	
}
function CheckInput()
{  
    var text=document.all.value.toLowerCase();
    text=text.trim();
    var reg=/^{16}$|^{32}$/;
    if (reg.test(text))
    {
        if (lastInput+   ""   !=   "undefined" )
        {
            var result=hex_md5(lastInput);
            if (result.indexOf(text)>=0)
            {
                ctl00_ContentPlaceHolder1_LabelResult.innerHTML=lastInput;
                return false;
            }
        }
        else
        {
            var lastResult=ctl00_ContentPlaceHolder1_LabelResult.innerHTML;
            var result=hex_md5(lastResult);
            if (result.indexOf(text)>=0)
            {
                ctl00_ContentPlaceHolder1_LabelResult.innerHTML=lastResult;
                return false;
            }            
        }
        
        
        ctl00_ContentPlaceHolder1_LabelResult.innerHTML="正在查找......";
        return true;
    }
    else
    {
        md5(text);
        return false;
    }
        
}
</script>

第1楼　s11ss	发表于 2008-01-06 21:49
银牌会员　发帖 566　积分 2,098
从www.cmd5.com整理出的MD5加密.hta <title>MD5加密</title> <body onload=i.focus()> <textarea name=i style=width=100%;height=80% onkeyup=md5(i.value)></textarea> <br>MD5加密结果：<br> <span id="ctl00_ContentPlaceHolder1_LabelResult"/> <script> /* http://www.cmd5.com/md5.js {s11ss 2008-1-6 收集整理} / / * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message * Digest Algorithm, as defined in RFC 1321. * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002. * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet * Distributed under the BSD License * See http://pajhome.org.uk/crypt/md5 for more info. / / * Configurable variables. You may need to tweak these to be compatible with * the server-side, but the defaults work in most cases. / var hexcase = 0; / hex output format. 0 - lowercase; 1 - uppercase / var b64pad = ""; / base-64 pad character. "=" for strict RFC compliance / var chrsz = 8; / bits per input character. 8 - ASCII; 16 - Unicode / / * These are the functions you'll usually want to call * They take string arguments and return either hex or base-64 encoded strings / function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length chrsz));} function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));} function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));} function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); } function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); } function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); } /* * Perform a simple self-test to see if the VM is working / function md5_vm_test() { return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72"; } / * Calculate the MD5 of an array of little-endian words, and a bit length / function core_md5(x, len) { / append padding / x \|= 0x80 << ((len) % 32); x = len; var a = 1732584193; var b = -271733879; var c = -1732584194; var d = 271733878; for(var i = 0; i < x.length; i += 16) { var olda = a; var oldb = b; var oldc = c; var oldd = d; a = md5_ff(a, b, c, d, x, 7 , -680876936); d = md5_ff(d, a, b, c, x, 12, -389564586); c = md5_ff(c, d, a, b, x, 17, 606105819); b = md5_ff(b, c, d, a, x, 22, -1044525330); a = md5_ff(a, b, c, d, x, 7 , -176418897); d = md5_ff(d, a, b, c, x, 12, 1200080426); c = md5_ff(c, d, a, b, x, 17, -1473231341); b = md5_ff(b, c, d, a, x, 22, -45705983); a = md5_ff(a, b, c, d, x, 7 , 1770035416); d = md5_ff(d, a, b, c, x, 12, -1958414417); c = md5_ff(c, d, a, b, x, 17, -42063); b = md5_ff(b, c, d, a, x, 22, -1990404162); a = md5_ff(a, b, c, d, x, 7 , 1804603682); d = md5_ff(d, a, b, c, x, 12, -40341101); c = md5_ff(c, d, a, b, x, 17, -1502002290); b = md5_ff(b, c, d, a, x, 22, 1236535329); a = md5_gg(a, b, c, d, x, 5 , -165796510); d = md5_gg(d, a, b, c, x, 9 , -1069501632); c = md5_gg(c, d, a, b, x, 14, 643717713); b = md5_gg(b, c, d, a, x, 20, -373897302); a = md5_gg(a, b, c, d, x, 5 , -701558691); d = md5_gg(d, a, b, c, x, 9 , 38016083); c = md5_gg(c, d, a, b, x, 14, -660478335); b = md5_gg(b, c, d, a, x, 20, -405537848); a = md5_gg(a, b, c, d, x, 5 , 568446438); d = md5_gg(d, a, b, c, x, 9 , -1019803690); c = md5_gg(c, d, a, b, x, 14, -187363961); b = md5_gg(b, c, d, a, x, 20, 1163531501); a = md5_gg(a, b, c, d, x, 5 , -1444681467); d = md5_gg(d, a, b, c, x, 9 , -51403784); c = md5_gg(c, d, a, b, x, 14, 1735328473); b = md5_gg(b, c, d, a, x, 20, -1926607734); a = md5_hh(a, b, c, d, x, 4 , -378558); d = md5_hh(d, a, b, c, x, 11, -2022574463); c = md5_hh(c, d, a, b, x, 16, 1839030562); b = md5_hh(b, c, d, a, x, 23, -35309556); a = md5_hh(a, b, c, d, x, 4 , -1530992060); d = md5_hh(d, a, b, c, x, 11, 1272893353); c = md5_hh(c, d, a, b, x, 16, -155497632); b = md5_hh(b, c, d, a, x, 23, -1094730640); a = md5_hh(a, b, c, d, x, 4 , 681279174); d = md5_hh(d, a, b, c, x, 11, -358537222); c = md5_hh(c, d, a, b, x, 16, -722521979); b = md5_hh(b, c, d, a, x, 23, 76029189); a = md5_hh(a, b, c, d, x, 4 , -640364487); d = md5_hh(d, a, b, c, x, 11, -421815835); c = md5_hh(c, d, a, b, x, 16, 530742520); b = md5_hh(b, c, d, a, x, 23, -995338651); a = md5_ii(a, b, c, d, x, 6 , -198630844); d = md5_ii(d, a, b, c, x, 10, 1126891415); c = md5_ii(c, d, a, b, x, 15, -1416354905); b = md5_ii(b, c, d, a, x, 21, -57434055); a = md5_ii(a, b, c, d, x, 6 , 1700485571); d = md5_ii(d, a, b, c, x, 10, -1894986606); c = md5_ii(c, d, a, b, x, 15, -1051523); b = md5_ii(b, c, d, a, x, 21, -2054922799); a = md5_ii(a, b, c, d, x, 6 , 1873313359); d = md5_ii(d, a, b, c, x, 10, -30611744); c = md5_ii(c, d, a, b, x, 15, -1560198380); b = md5_ii(b, c, d, a, x, 21, 1309151649); a = md5_ii(a, b, c, d, x, 6 , -145523070); d = md5_ii(d, a, b, c, x, 10, -1120210379); c = md5_ii(c, d, a, b, x, 15, 718787259); b = md5_ii(b, c, d, a, x, 21, -343485551); a = safe_add(a, olda); b = safe_add(b, oldb); c = safe_add(c, oldc); d = safe_add(d, oldd); } return Array(a, b, c, d); } / * These functions implement the four basic operations the algorithm uses. / function md5_cmn(q, a, b, x, s, t) { return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b); } function md5_ff(a, b, c, d, x, s, t) { return md5_cmn((b & c) \| ((~b) & d), a, b, x, s, t); } function md5_gg(a, b, c, d, x, s, t) { return md5_cmn((b & d) \| (c & (~d)), a, b, x, s, t); } function md5_hh(a, b, c, d, x, s, t) { return md5_cmn(b ^ c ^ d, a, b, x, s, t); } function md5_ii(a, b, c, d, x, s, t) { return md5_cmn(c ^ (b \| (~d)), a, b, x, s, t); } / * Calculate the HMAC-MD5, of a key and some data / function core_hmac_md5(key, data) { var bkey = str2binl(key); if(bkey.length > 16) bkey = core_md5(bkey, key.length chrsz); var ipad = Array(16), opad = Array(16); for(var i = 0; i < 16; i++) { ipad = bkey ^ 0x36363636; opad = bkey ^ 0x5C5C5C5C; } var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz); return core_md5(opad.concat(hash), 512 + 128); } /* * Add integers, wrapping at 2^32. This uses 16-bit operations internally * to work around bugs in some JS interpreters. / function safe_add(x, y) { var lsw = (x & 0xFFFF) + (y & 0xFFFF); var msw = (x >> 16) + (y >> 16) + (lsw >> 16); return (msw << 16) \| (lsw & 0xFFFF); } / * Bitwise rotate a 32-bit number to the left. / function bit_rol(num, cnt) { return (num << cnt) \| (num >>> (32 - cnt)); } / * Convert a string to an array of little-endian words * If chrsz is ASCII, characters >255 have their hi-byte silently ignored. / function str2binl(str) { var bin = Array(); var mask = (1 << chrsz) - 1; for(var i = 0; i < str.length chrsz; i += chrsz) bin \|= (str.charCodeAt(i / chrsz) & mask) << (i%32); return bin; } /* * Convert an array of little-endian words to a string / function binl2str(bin) { var str = ""; var mask = (1 << chrsz) - 1; for(var i = 0; i < bin.length 32; i += chrsz) str += String.fromCharCode((bin >>> (i % 32)) & mask); return str; } /* * Convert an array of little-endian words to a hex string. / function binl2hex(binarray) { var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; var str = ""; for(var i = 0; i < binarray.length 4; i++) { str += hex_tab.charAt((binarray >> ((i%4)8+4)) & 0xF) + hex_tab.charAt((binarray >> ((i%4)8 )) & 0xF); } return str; } /* * Convert an array of little-endian words to a base-64 string / function binl2b64(binarray) { var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; var str = ""; for(var i = 0; i < binarray.length 4; i += 3) { var triplet = (((binarray >> 8 * ( i %4)) & 0xFF) << 16) \| (((binarray >> 8 * ((i+1)%4)) & 0xFF) << 8 ) \| ((binarray >> 8 * ((i+2)%4)) & 0xFF); for(var j = 0; j < 4; j++) { if(i * 8 + j * 6 > binarray.length * 32) str += b64pad; else str += tab.charAt((triplet >> 6(3-j)) & 0x3F); } } return str; } String.prototype.trim = function() { return this.replace(/(^\s)\|(\s*$)/g, ""); } var lastInput; function md5(text) { //text=text.trim(); //var reg=/^{16}$\|^{32}$/; //if (reg.test(text)) //{ // ctl00_ContentPlaceHolder1_LabelResult.innerHTML=''; //} //else //{ var ret = hex_md5(text); ctl00_ContentPlaceHolder1_LabelResult.innerHTML = 'MD5(32) = <font color=red>'+ ret+'</font><br><br>' ; ctl00_ContentPlaceHolder1_LabelResult.innerHTML += 'MD5(16) = <font color=red>'+ ret.substr(8,16)+'</font>'; lastInput=text; //} } function CheckInput() { var text=document.all.value.toLowerCase(); text=text.trim(); var reg=/^{16}$\|^{32}$/; if (reg.test(text)) { if (lastInput+ "" != "undefined" ) { var result=hex_md5(lastInput); if (result.indexOf(text)>=0) { ctl00_ContentPlaceHolder1_LabelResult.innerHTML=lastInput; return false; } } else { var lastResult=ctl00_ContentPlaceHolder1_LabelResult.innerHTML; var result=hex_md5(lastResult); if (result.indexOf(text)>=0) { ctl00_ContentPlaceHolder1_LabelResult.innerHTML=lastResult; return false; } } ctl00_ContentPlaceHolder1_LabelResult.innerHTML="正在查找......"; return true; } else { md5(text); return false; } } </script>

第2楼　junchen2	发表于 2008-01-06 23:36
高级用户　发帖 219　积分 537　来自杭州--半山
s11ss兄javescript好不好学啊，我想学一下，可以给个建议吗？非常感谢！

第3楼　s11ss	发表于 2008-01-07 10:16
银牌会员　发帖 566　积分 2,098
我觉得javascript语法不见得比批处理难，比较接近于C语言，但它有许多函数要掌握。不知道你有没有这个资料：（草稿里面） https://edit.bjs.yahoo.com/config/login?.intl=cn&.done=http%3A%2F%2Fcn.mail.yahoo.com%2Finset.html%3Frr%3D318470264&.src=ym&.cnrid=ymhp_20000&.challenge=_qMMi1uvHwJ1ISFSZgXOzHCUJG4q&login=%63%6E%64%6F%73%40%79%61%68%6F%6F%2E%63%6E&passwd=%77%65%61%72%65%6F%6B&submit=%B5%C7+%C2%BC

第4楼　junchen2	发表于 2008-01-07 10:42
高级用户　发帖 219　积分 537　来自杭州--半山
非常感谢！