Skip to content

Instantly share code, notes, and snippets.

View amphineko's full-sized avatar
🍊
Have a job but do open-source when not busy

amphineko amphineko

🍊
Have a job but do open-source when not busy
  • 07:04 (UTC)
View GitHub Profile
/*
Luna Capsule / vijos-1046
Problem: https://vijos.org/p/1391
Record: https://vijos.org/records/53f226d948c5fc5e2f8b4570
- Use Dijkstra algorithm for calculating the maximum from the source to any points.
*/
#include <cstdio>
/*
Luna Capsule / vijos-1046
Problem: https://vijos.org/p/1046
Record: https://vijos.org/records/53e9a3f748c5fc6f3c8b457f
*/
#include <cstdio>
#include <cstdlib>
#include <iostream>
/*
打开个人首页, 翻到最后一页, 在开发者工具的控制台里运行即可
适用于v5
*/
var _counter = 0;
var iV = setInterval(function () {
var oB = $('[action-type="feed_list_delete"]');
window.scrollTo(0, 1024000);