当前位置:网站首页>关于某手滑块的一些更新(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,拜拜!
边栏推荐
- Nuscenes -- remedies for missing image files or 0-size images encountered during dataset configuration
- Layer 2 and layer 3 forwarding principle based on VLAN
- Chapter 10 project stakeholder management
- Research Report on terahertz imaging system industry - market status analysis and development prospect forecast
- Research Report on market supply and demand and strategy of ceiling power supply device industry in China
- Research Report on market supply and demand and strategy of China's solar charging controller industry
- Power system | IEEE paper submission process
- Panorama of enterprise power in China SSD industry
- Data communication foundation - Ethernet port mirroring and link aggregation
- 大厂面试必问:如何解决TCP可靠传输问题?8张图带你详细学习
猜你喜欢
Basic principles of spanning tree protocol
JMM 最最最核心的概念:Happens-before 原则
加分利器 不负所托 | 知道创宇获攻防演练防守方感谢信!
Solution to the login error of tangdou people
结合源码剖析Oauth2分布式认证与授权的实现流程
Combine pod identity in aks and secret in CSI driver mount key vault
win10或win11打印机无法打印
DX 的 HLSL 和 GL 的 GLSL的 矩阵构建的行列区别
vulnhub DC: 2
双亲委派机制
随机推荐
Visitor tweets tell you which groups are consuming blind boxes
JWT(Json Web Token)
China solar window market trend report, technical dynamic innovation and market forecast
C#学习两年的增删改查和C#导入导出(去重)案例
2022-06-10 工作记录--JS-获取到某一日期N天后的日期
[Software Engineering] key points at the end of the period
Learn more about the practical application of sentinel
Research Report on market supply and demand and strategy of ceiling power supply device industry in China
DX 的 HLSL 和 GL 的 GLSL的 矩阵构建的行列区别
1. fully explain the basic principles of IPSec
vulnhub Vegeta: 1
【Mongodb】READ_ ME_ TO_ RECOVER_ YOUR_ Data, the database is deleted maliciously
Firewall working principle and detailed conversation table
Feign project construction
envoy获取客户端真实IP
Extend your kubernetes API with aggregated apiserver
Online filing process
How to solve the problem that the computer suddenly can't connect to WiFi
Concurrency of heap memory allocation
Code farmers should also understand the IPv4 subnet division of point networks