欢迎光临
我们一直在努力

聚享游登录js解密

navigator = {};
window = this;

!
function(t, e) {
"function" == typeof define && define.amd ? define(["exports"], e) : e("object" == typeof exports && "string" != typeof exports.nodeName ? module.exports: t)
} (this,
function(t) {
function e(t, e, i) {
    null != t && ("number" == typeof t ? this.fromNumber(t, e, i) : null == e && "string" != typeof t ? this.fromString(t, 256) : this.fromString(t, e))
}
function i() {
    return new e(null)
}
function r(t, e, i, r, s, n) {
    for (; --n >= 0;) {
        var o = e * this[t++] + i[r] + s;
        s = Math.floor(o / 67108864),
        i[r++] = 67108863 & o
    }
    return s
}
function s(t, e, i, r, s, n) {
    for (var o = 32767 & e,
    h = e >> 15; --n >= 0;) {
        var a = 32767 & this[t],
        u = this[t++] >> 15,
        c = h * a + u * o;
        a = o * a + ((32767 & c) << 15) + i[r] + (1073741823 & s),
        s = (a >>> 30) + (c >>> 15) + h * u + (s >>> 30),
        i[r++] = 1073741823 & a
    }
    return s
}
function n(t, e, i, r, s, n) {
    for (var o = 16383 & e,
    h = e >> 14; --n >= 0;) {
        var a = 16383 & this[t],
        u = this[t++] >> 14,
        c = h * a + u * o;
        a = o * a + ((16383 & c) << 14) + i[r] + s,
        s = (a >> 28) + (c >> 14) + h * u,
        i[r++] = 268435455 & a
    }
    return s
}
function o(t) {
    return Be.charAt(t)
}
function h(t, e) {
    var i = Ke[t.charCodeAt(e)];
    return null == i ? -1 : i
}
function a(t) {
    for (var e = this.t - 1; e >= 0; --e) t[e] = this[e];
    t.t = this.t,
    t.s = this.s
}
function u(t) {
    this.t = 1,
    this.s = 0 > t ? -1 : 0,
    t > 0 ? this[0] = t: -1 > t ? this[0] = t + this.DV: this.t = 0
}
function c(t) {
    var e = i();
    return e.fromInt(t),
    e
}
function f(t, i) {
    var r;
    if (16 == i) r = 4;
    else if (8 == i) r = 3;
    else if (256 == i) r = 8;
    else if (2 == i) r = 1;
    else if (32 == i) r = 5;
    else {
        if (4 != i) return void this.fromRadix(t, i);
        r = 2
    }
    this.t = 0,
    this.s = 0;
    for (var s = t.length,
    n = !1,
    o = 0; --s >= 0;) {
        var a = 8 == r ? 255 & t<strike> : h(t, s);
        0 > a ? "-" == t.charAt(s) && (n = !0) : (n = !1, 0 == o ? this[this.t++] = a: o + r > this.DB ? (this[this.t - 1] |= (a & (1 << this.DB - o) - 1) << o, this[this.t++] = a >> this.DB - o) : this[this.t - 1] |= a << o, o += r, o >= this.DB && (o -= this.DB))
    }
    8 == r && 0 != (128 & t[0]) && (this.s = -1, o > 0 && (this[this.t - 1] |= (1 << this.DB - o) - 1 << o)),
    this.clamp(),
    n && e.ZERO.subTo(this, this)
}
function p() {
    for (var t = this.s & this.DM; this.t > 0 && this[this.t - 1] == t;)--this.t
}
function l(t) {
    if (this.s < 0) return "-" + this.negate().toString(t);
    var e;
    if (16 == t) e = 4;
    else if (8 == t) e = 3;
    else if (2 == t) e = 1;
    else if (32 == t) e = 5;
    else {
        if (4 != t) return this.toRadix(t);
        e = 2
    }
    var i, r = (1 << e) - 1,
    s = !1,
    n = "",
    h = this.t,
    a = this.DB - h * this.DB % e;
    if (h-->0) for (a < this.DB && (i = this[h] >> a) > 0 && (s = !0, n = o(i)); h >= 0;) e > a ? (i = (this[h] & (1 << a) - 1) << e - a, i |= this[--h] >> (a += this.DB - e)) : (i = this[h] >> (a -= e) & r, 0 >= a && (a += this.DB, --h)),
    i > 0 && (s = !0),
    s && (n += o(i));
    return s ? n: "0"
}
function d() {
    var t = i();
    return e.ZERO.subTo(this, t),
    t
}
function g() {
    return this.s < 0 ? this.negate() : this
}
function m(t) {
    var e = this.s - t.s;
    if (0 != e) return e;
    var i = this.t;
    if (e = i - t.t, 0 != e) return this.s < 0 ? -e: e;
    for (; --i >= 0;) if (0 != (e = this<i> - t<i>)) return e;
    return 0
}
function y(t) {
    var e, i = 1;
    return 0 != (e = t >>> 16) && (t = e, i += 16),
    0 != (e = t >> 8) && (t = e, i += 8),
    0 != (e = t >> 4) && (t = e, i += 4),
    0 != (e = t >> 2) && (t = e, i += 2),
    0 != (e = t >> 1) && (t = e, i += 1),
    i
}
function b() {
    return this.t <= 0 ? 0 : this.DB * (this.t - 1) + y(this[this.t - 1] ^ this.s & this.DM)
}
function T(t, e) {
    var i;
    for (i = this.t - 1; i >= 0; --i) e[i + t] = this<i>;
    for (i = t - 1; i >= 0; --i) e<i> = 0;
    e.t = this.t + t,
    e.s = this.s
}
function S(t, e) {
    for (var i = t; i < this.t; ++i) e[i - t] = this<i>;
    e.t = Math.max(this.t - t, 0),
    e.s = this.s
}
function R(t, e) {
    var i, r = t % this.DB,
    s = this.DB - r,
    n = (1 << s) - 1,
    o = Math.floor(t / this.DB),
    h = this.s << r & this.DM;
    for (i = this.t - 1; i >= 0; --i) e[i + o + 1] = this<i> >> s | h,
    h = (this<i> & n) << r;
    for (i = o - 1; i >= 0; --i) e<i> = 0;
    e[o] = h,
    e.t = this.t + o + 1,
    e.s = this.s,
    e.clamp()
}
function E(t, e) {
    e.s = this.s;
    var i = Math.floor(t / this.DB);
    if (i >= this.t) return void(e.t = 0);
    var r = t % this.DB,
    s = this.DB - r,
    n = (1 << r) - 1;
    e[0] = this<i> >> r;
    for (var o = i + 1; o < this.t; ++o) e[o - i - 1] |= (this[o] & n) << s,
    e[o - i] = this[o] >> r;
    r > 0 && (e[this.t - i - 1] |= (this.s & n) << s),
    e.t = this.t - i,
    e.clamp()
}
function D(t, e) {
    for (var i = 0,
    r = 0,
    s = Math.min(t.t, this.t); s > i;) r += this<i> - t<i>,
    e[i++] = r & this.DM,
    r >>= this.DB;
    if (t.t < this.t) {
        for (r -= t.s; i < this.t;) r += this<i>,
        e[i++] = r & this.DM,
        r >>= this.DB;
        r += this.s
    } else {
        for (r += this.s; i < t.t;) r -= t<i>,
        e[i++] = r & this.DM,
        r >>= this.DB;
        r -= t.s
    }
    e.s = 0 > r ? -1 : 0,
    -1 > r ? e[i++] = this.DV + r: r > 0 && (e[i++] = r),
    e.t = i,
    e.clamp()
}
function w(t, i) {
    var r = this.abs(),
    s = t.abs(),
    n = r.t;
    for (i.t = n + s.t; --n >= 0;) i[n] = 0;
    for (n = 0; n < s.t; ++n) i[n + r.t] = r.am(0, s[n], i, n, 0, r.t);
    i.s = 0,
    i.clamp(),
    this.s
剩余50%内容付费后可查看
支付宝扫码打赏 微信扫码打赏

如果文章对你有帮助,欢迎点击上方按钮打赏作者

未经允许不得转载:军哥驿站 » 聚享游登录js解密

分享到:更多 ()

评论 抢沙发

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址

军哥驿站 建站更专业 更方便

阿里云精选联系我们