Wizmann

import sys
import random
from random import randint

INF = 10 ** 10

P1 = 860939810732536850
P2 = 937467793908762347

Wizmann

README

---

How to use

Paste the js code to Tampermonkey(Chrome) or Greasemonkey(Firefox). Paste the css code to Stylish, and set the matching url pattern as "https://workflowy.com/".

Open a new workflowy page, it works!

Wizmann

// ==UserScript==
// @name         New Userscript
// @namespace    http://tampermonkey.net/
// @version      0.1
// @description  try to take over the world!
// @author       You
// @match        https://workflowy.com/*
// @grant        none
// ==/UserScript==
/* jshint -W097 */

Wizmann

#include "KVTree.hpp"

void TreeIterator::next() {
    return;
}

bool TreeIterator::has_next() {
    while (!_stack.empty() || _cur) {
        if (_cur == nullptr) {
            _cur = _stack.top();

Wizmann

最长后辍匹配 Max suffix match

Description

最长后辍匹配指的是在一个单词中，一个任意非后辍的子串与后辍的最长匹配。

如单词banana，其最长后辍匹配为:b"ana"na和ban"ana"。（引号内的部分即为匹配的部分）

所以，MaxSuffixMatch("banana") = 3。

Wizmann

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

#define input(x) cin >> x

Wizmann

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <unordered_map>

using namespace std;

Wizmann

print 'Hello World!'

Wizmann

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

#define print(x) do {cout << x << endl;} while(0)
#define input(x) do {cin >> x;} while(0)

Wizmann

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

#define print(x) cout << x << endl