- Coppy nội dung file lay-diem-thi.js
- Vào trang web cần ấy điểm
- Bấm f12 vào tab console paste đoạn js vào sau đó thay đổi giá trị biến
sbd
. với mỗi mảng con trong biến này tương ứngmin
vàmax
của 1 khoảng số báo danh - Enter chờ quét xong sẽ tự lưu file dạng json.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<html> | |
<head> | |
<meta charset="UTF-8"> | |
<title>Dokin Caculator</title> | |
<link rel='stylesheet prefetch' href='https://cdnjs.cloudflare.com/ajax/libs/twitter-bootstrap/4.0.0-alpha.6/css/bootstrap.min.css'> | |
<link rel="stylesheet" href="css/style.css"> | |
</head> | |
<body> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<div id="canvas"> | |
<span contenteditable="true" spellcheck="false">Porn</span><span class="orange" contenteditable="true" spellcheck="false">Hub</span> | |
</div> | |
<a href="#" class="cumshot">Cum shot</a> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<?php | |
namespace App\Enums; | |
use BenSampo\Enum\Enum; | |
class Enums extends Enum | |
{ | |
public static function toEnums(): array |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
const generateCheckSum = (text) => { | |
let crc = 0xffff; | |
let polynomial = 0x1021; | |
let bytes = new TextEncoder().encode(text); | |
for (let b of bytes) { | |
for (let i = 0; i < 8; i++) { | |
let bit = ((b >> (7 - i)) & 1) === 1; | |
let c15 = ((crc >> 15) & 1) === 1; | |
crc <<= 1; |