EditPlus是一款由韩国 Sangil Kim （ES-Computing）出品的小巧但是功能强大的可处理文本、HTML和程序语言的Windows编辑器，你甚至可以通过设置用户工具将其作为C,Java,Php等等语言的一个简单的IDE。
EditPlus启动速度非常快，马甲也是一直都在使用这个编辑器。
官方网址
软件下载
支持 Windows 7/8/8.1/10 系统
https://www.editplus.com/download.html
授权算法
EditPlus 在网上有许许多多的破解版。破解版的风险，大家也应该知道。
官方授权又比较贵，一个用户 $35~
在网上偶尔看见一位大佬破解了 EditPlus 密钥算法。且公开了源码。
代码如下：（看代码会懵逼，直接看演示页面：http://51.ruyo.net/test/editplus-generate.html）
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
var list = [0,49345,49537,320,49921,960,640,49729,50689,1728,1920,51009,1280,50625,50305,1088,52225,3264,3456,52545,3840,53185,52865,3648,2560,51905,52097,2880,51457,2496,2176,51265,55297,6336,6528,55617,6912,56257,55937,6720,7680,57025,57217,8000,56577,7616,7296,56385,5120,54465,54657,5440,55041,6080,5760,54849,53761,4800,4992,54081,4352,53697,53377,4160,61441,12480,12672,61761,13056,62401,62081,12864,13824,63169,63361,14144,62721,13760,13440,62529,15360,64705,64897,15680,65281,16320,16000,65089,64001,15040,15232,64321,14592,63937,63617,14400,10240,59585,59777,10560,60161,11200,10880,59969,60929,11968,12160,61249,11520,60865,60545,11328,58369,9408,9600,58689,9984,59329,
var hexchars = [‘0’,‘1’,‘2’,‘3’,‘4’,‘5’,‘6’,‘7’,‘8’,‘9’,‘A’,‘B’,‘C’,‘D’,‘E’,‘F’];
var regcode = new Array(29);
var i = 0, j = 0, k = 0;
var len, temp, sum, result;
var username = document.getElementById(“username”).value;
username = username.replace(/^\s+|\s+$/g, “”);
for(i = 0;i < 5;i++,k++)
{
for(j = 0;j < 5;j++,k++)
{
regcode[k] = hexchars[parseInt(Math.random() * 16)];
}
if(k == 29) break;
regcode[k] = ‘-‘;
}
len = username.length;
sum = 1;
for(i = 0;i < len;i++)
sum += username.charCodeAt(i);
temp = (parseInt( (sum + 23) / 6 ) + 3) * 7 % 16;
regcode[6] = hexchars[temp & 0xF];
sum = 1;
for(i = 0;i < len;i++)
sum += username.charCodeAt(i);
temp = parseInt( (3 * sum + 39) / 8 ) % 16;
regcode[9] = hexchars[temp & 0xF];
sum = 1;
for(i = 0;i < len;i++)
sum += username.charCodeAt(i);
temp = parseInt( (3 * sum + 19) / 9 ) % 16;
regcode[7] = hexchars[temp & 0xF];
sum = 1;
for(i = 0;i < len;i++)
sum += username.charCodeAt(i);
temp = parseInt( (sum + 10) / 3 ) * 8 % 16;
regcode[10] = hexchars[temp & 0xF];
sum = 1;
for(i = 0;i < len;i++)
sum += username.charCodeAt(i);
temp = (parseInt( (9 * sum + 10) / 3 ) + 36) % 16;
regcode[4] = hexchars[temp & 0xF];
sum = 1;
for(i = 0;i < len;i++)
sum += username.charCodeAt(i);
temp = parseInt( (5 * sum + 11) / 5 ) % 16;
regcode[8] = hexchars[temp & 0xF];
result = 0;
for(i = 0;i < len;i++)
result = ((result >> 8) & 0xFF) ^ list[username.charCodeAt(i) ^ (result & 0xFF)];
result = result.toString(16).toUpperCase();
regcode[2] = result.charAt(0);
regcode[3] = result.charAt(1);
len = regcode.length;
result = 0;
for(i = 2;i < len;i++)
result = ((result >> 8) & 0xFF) ^ list[regcode[i].toString().charCodeAt(0) ^ (result & 0xFF)];
result = result.toString(16).toUpperCase();
regcode[0] = result.charAt(0);
regcode[1] = result.charAt(1);
console.log(regcode.join(”));
|
piller, http://sverige-apotek.life/caosina.html , kosta Sverige.
Thank you for some other magnificent article. The place else may just anybody get that kind of info in such an ideal method of writing? I’ve a presentation next week, and I’m at the search for such info.