当前位置:网站首页>关于某手滑块的一些更新(6-18,js逆向)
关于某手滑块的一些更新(6-18,js逆向)
2022-06-24 19:40:00 【成功你要成仁啊】
前言:时隔三个月 我又回来了,以后再也不会被毕设折磨
距离上一篇某手滑块已经快一年了,流程跟以前差不多(可以翻下以前的文章),具体的变化有一下几点:
1、图片缩放的比例
relativeX = int(round(int(distance) * 0.46, 0) - 3)
relativeY = round(int(disY) * 0.46)
2、检测轨迹了
//这里用的缩放法(随机值的一些我也没加,感兴趣的可以自己再完善下)
m_distance = 246
m_list = [[0, 19, 19], [0, 21, 67], [10, 22, 89], [18, 22, 95], [36, 22, 104], [61, 22, 114], [123, 22, 125],
[163, 22, 132], [195, 22, 140], [228, 22, 154], [268, 22, 158], [329, 22, 174], [384, 22, 186],
[409, 22, 193], [427, 22, 201], [449, 22, 208], [463, 22, 223], [478, 22, 227], [492, 22, 241],
[507, 22, 242], [518, 22, 252], [528, 22, 257], [539, 22, 266], [547, 22, 273], [557, 23, 286],
[568, 23, 291], [583, 23, 306], [590, 23, 318], [597, 23, 321], [601, 23, 335], [608, 23, 337],
[612, 23, 352], [623, 23, 359], [637, 23, 374], [641, 23, 384], [644, 23, 387], [652, 23, 393],
[655, 23, 401], [663, 23, 408], [666, 23, 419], [670, 23, 428], [673, 23, 437], [681, 23, 441],
[684, 23, 450], [684, 23, 457], [692, 23, 465], [695, 23, 482], [699, 23, 490], [699, 23, 504],
[702, 23, 529], [706, 23, 537], [710, 23, 555], [713, 23, 562], [713, 23, 578], [721, 23, 584],
[728, 24, 611], [728, 24, 627], [731, 24, 633], [735, 24, 643], [739, 24, 649], [742, 24, 657],
[742, 24, 667], [746, 24, 675], [750, 24, 681], [753, 24, 688], [757, 24, 697], [757, 24, 704],
[764, 24, 713], [768, 24, 721], [771, 24, 733], [775, 24, 740], [782, 24, 746], [786, 24, 753],
[789, 24, 764], [797, 24, 769], [800, 24, 785], [804, 24, 796], [807, 24, 809], [811, 24, 818],
[815, 24, 827], [815, 24, 842], [818, 24, 848], [822, 24, 868], [829, 24, 874], [829, 24, 889],
[833, 24, 897], [836, 24, 913], [840, 24, 920], [844, 24, 931], [844, 24, 945], [847, 24, 961],
[851, 24, 978], [855, 24, 985], [858, 24, 994], [858, 24, 1008], [862, 24, 1033], [865, 24, 1066],
[869, 24, 1081], [873, 24, 1097], [873, 24, 1233]]
x = distance / m_distance
one_list = []
for i in m_list:
list_ = []
for j in i:
list_.append(round(j * x))
one_list.append(list_)
str1 = ''
for k in one_list:
str1 += str(k[0]) + "|" + str(k[1]) + "|" + str(k[2]) + ","
print("轨迹:", str1[:-1])
return str1[:-1]
然后就没有了,溜了溜了,下一篇关于滑块的文章可能是140,拜拜!
边栏推荐
- Introduction to machine learning compilation course learning notes lesson 1 overview of machine learning compilation
- 使用Aggregated APIServer扩展你的kubernetes API
- [QT] QT event handling
- Feign project construction
- 双亲委派机制
- 【个人实验报告】
- 中国SSD行业企业势力全景图
- win10或win11打印机无法打印
- Basic principles of layer 2 switching
- 别再乱用了,这才是 @Validated 和 @Valid 的真正区别!!!
猜你喜欢

Principles of Ethernet port mirroring, link aggregation and VLAN Technology

Leetcode: calculate the number of elements less than the current element on the right (sortedlist+bisect\u left)

2022年安全员-A证考题及答案

JMM 最最最核心的概念:Happens-before 原则

Future development of education industry of e-commerce Express

2022-06-10 work record --js- obtain the date n days after a certain date
Relationnet++: a representation of fusion of multiple detection targets based on transformer | neurips 2020

Basic principles of spanning tree protocol

2022年高处安装、维护、拆除考试模拟100题及模拟考试

【Laravel系列7.9】测试
随机推荐
Programmers become gods by digging holes in one year, carrying flags in five years and becoming gods in ten years
Code farmers should also understand the IPv4 subnet division of point networks
ACL (access control list) basic chapter - Super interesting learning network
是否需要提高代码阅读能力?这有技巧
vulnhub DC: 2
China smallpox vaccine market trend report, technical innovation and market forecast
How to integrate Huawei cloud function services in fluent
Redis hop table
High level application of SQL statements in MySQL database (II)
Beijiafu (p+f) R2000 modified radar IP
VRRP skills topic
CDN principle
Fanuc robot_ Introduction to Karel programming (1)
别再乱用了,这才是 @Validated 和 @Valid 的真正区别!!!
Leetcode: calculate the number of elements less than the current element on the right (sortedlist+bisect\u left)
MySQL夺命10问,你能坚持到第几问?
【软件工程】期末重点
2022-06-16 工作记录--JS-判断字符串型数字有几位 + 判断数值型数字有几位 + 限制文本长度(最多展示n个字,超出...)
Research Report on solar battery charger industry - market status analysis and development prospect forecast
In the era of full programming, should I give up this road?