欢迎投稿 mailto:[email protected]
一款基于python的自研高性能多线程京东扫线报工具
A python-based high-performance multi-thread 京东(JD.Com, Inc) shop activity scan(aka spider)
点点star，感谢！ Give some stars, thank you!
你好，我是萌大奶（https://t.me/doubi_c ）很高兴认识你。
我有一个愿望，就是人人有扫把，人人有线报，为此我将在此放出我自研的超级京东扫店工具，江湖人送爱称”奶scan“。祝大家在薅毛路上前程似锦，日进万豆。
1.下载本仓库所有文件到本地目录
2.每行一条，将京东ck填到'JD_COOKIE.txt'里面。最少也要一条ck，未验证过期ck是否有效，建议使用有效ck，格式pt_key=xxx;pt_pin=xxx;
3.打开，按照注释的说明编辑'scan_config.py'，然后保存
4.运行'scan_main.exe'，开始扫线报
现在你已经完全掌握奶scan的使用方法啦，快去发大财吧！
Hello, my name is 萌大奶（https://t.me/doubi_c ）, very nice to meet you.
I have a dream, that every man could have his/her scan and spy. So that I'm going to introduce you my self-investigated 京东(Jd.Com, Inc) super shop activity scan, which was given a lovely name "Nai_scan".
I hope every you can achieve a promising future in the bussiness of WOOL-HUNTING, and get more than 10,000 JD beans per day.
1.Download all files in this repo
2.Fill one JD cookie per line into 'JD_COOKIE.txt', at least one piece of cookie is needed. Don't know whether out-dated cookie will work, fresh cookie is suggested, format be like pt_key=xxx;pt_pin=xxx;
3.Open, edit 'scan_config.py' following its comments, and save
4.Run 'scan_main.exe' to scan shop activity
Now you have a complete grasp of the utilizing technique of Nai_scan, now hurry up making fortunes!
欢迎使用[NAI_SCAN]（以下简称“SCAN”）。在使用本项目之前，请务必仔细阅读并理解以下免责声明。通过使用本项目，您表示同意接受以下条款和条件：
本项目及其相关文档按“原样”提供，没有任何明示或暗示的担保，包括但不限于适销性、特定用途适用性和非侵权的暗示担保。作者不担保本项目的准确性、完整性、可靠性、适用性或及时性。
使用本项目存在风险，并且用户必须自行承担所有风险和责任。作者不对任何因使用本项目而造成的直接或间接损失负责，包括但不限于数据损失、利润损失、业务中断等。
在任何情况下，作者不对任何特殊、间接、偶然、直接或连带损害负责，无论是在合同诉讼、侵权行为或其他方面，即使作者已被告知此类损害的可能性。本免责声明将在法律允许的最大范围内生效。
本项目的所有权利（包括但不限于版权、商标和专利）均属于作者。未经作者明确授权，不得将该项目用于任何商业目的。未经许可，不得复制、修改、分发或以任何方式利用本项目。
本免责声明受当地法律的管辖，并在法律允许的最大范围内解释。任何对本免责声明的解释或执行将受到[适用法律的管辖地]的法律条款的约束。
通过使用本项目，即表示您接受并同意遵守本免责声明。如果您不同意这些条款，请不要使用本项目。
本免责声明构成了您与作者之间关于本项目的完整协议，并取代了所有先前或同时达成的口头或书面协议。作者保留根据需要随时修改本免责声明的权利。
Welcome to [NAI_SCAN] (hereinafter referred to as "SCAN"). Please ensure that you have carefully read and understood the following disclaimer before using this project. By using this project, you indicate your acceptance of the following terms and conditions:
This project and its related documentation are provided "as is" without any express or implied warranty, including but not limited to implied warranties of merchantability, fitness for a particular purpose, and non-infringement. The authors do not warrant the accuracy, completeness, reliability, suitability, or timeliness of this project.
There are risks associated with the use of this project, and users must assume all risks and responsibilities. The authors shall not be responsible for any direct or indirect losses caused by the use of this project, including but not limited to data loss, profit loss, business interruption, etc.
In no event shall the authors be liable for any special, indirect, incidental, direct, or consequential damages, whether in contract, tort, or otherwise, even if the authors have been informed of the possibility of such damages. This disclaimer shall be effective to the maximum extent permitted by law.
All rights to this project (including but not limited to copyrights, trademarks, and patents) belong to the authors. This project shall not be used for any commercial purpose without the explicit authorization of the authors. Without permission, this project shall not be copied, modified, distributed, or used in any way.
This disclaimer is governed by local laws and interpreted to the fullest extent permitted by law. Any interpretation or enforcement of this disclaimer shall be subject to the legal provisions of [applicable jurisdiction].
By using this project, you indicate your acceptance of and agreement to abide by this disclaimer. If you do not agree with these terms, please do not use this project.
This disclaimer constitutes the entire agreement between you and the authors regarding this project and supersedes all prior or contemporaneous oral or written agreements. The authors reserve the right to modify this disclaimer at any time as needed.