for i=1 to j
for k=1 to n
s1=left(s_in,1)
s_in=mid(s_in,2)
i_asc=asc(s1)+100+long(mid(s_mode,k,1))
if i_asc>255 then i_asc=i_asc - 255
s2=s2+char(i_asc)
if (i - 1)*n+k=i_len then exit
next
next
s_in=s2
//字符串解密函数
int i,j,i_len,n,k
string s_mode='23569875125423' //加密模板
int i_st=100 //加密起始值
string s1,s2
int i_asc
for i=1 to j
for k=1 to n
s1=left(s_in,1)
s_in=mid(s_in,2)
i_asc=asc(s1) - 100 - long(mid(s_mode,k,1))
if i_asc<1 then i_asc=i_asc + 255
s2=s2+char(i_asc)
if (i - 1)*n+k=i_len then exit
next
next
s_in=s2