声母 | 声母键位 | 可拼合韵母 |
---|---|---|
ch /zh |
仅J/Q键(外侧) | an 、ang 、en 、eng 、u 、un |
ch /zh |
仅W/F键(内侧) | a 、ai 、i 、ong 、ou 、ua 、uai 、uan 、uang 、ui 、uo |
ch /zh |
飞键 | ao 、e |
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
xterm-24bit|xterm with 24-bit direct color mode, | |
use=xterm-256color, | |
setb24=\E[48\:2\:\:%p1%{65536}%/%d\:%p1%{256}%/%{255}%&%d\:%p1%{255}%&%dm, | |
setf24=\E[38\:2\:\:%p1%{65536}%/%d\:%p1%{256}%/%{255}%&%d\:%p1%{255}%&%dm, |
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
#include <iostream> | |
#include <queue> | |
#include <vector> | |
using namespace std; | |
constexpr int oo = 1 << 24; | |
int n; | |
void solve() { |
I hereby claim:
- I am howsiwei on github.
- I am howsiwei (https://keybase.io/howsiwei) on keybase.
- I have a public key ASCPNgtGHW5TnZxaf1uq0DL3XyzYURhhFsiKOnkTFCIk9Qo
To claim this, I am signing this object:
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
abstract class AVLTree<E extends Comparable<E>> { | |
protected final E element; | |
protected final AVLTree<E> left, right; | |
protected final int height; | |
public final int size; | |
protected AVLTree(E element, AVLTree<E> left, AVLTree<E> right, int height, int size) { | |
this.element = element; | |
this.left = left; | |
this.right = right; |
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
#include <iostream> | |
#include <cstdio> | |
#include <vector> | |
#include <stack> | |
using namespace std; | |
vector<vector<int>> adjl; | |
vector<int> low; | |
stack<int> t; | |
vector<bool> popped; |
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
#include <iostream> | |
#include <cstdio> | |
#include <algorithm> | |
#include <vector> | |
#include <numeric> | |
#include <stack> | |
#include <tuple> | |
using namespace std; | |
class SD { |
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
// Solution to https://open.kattis.com/problems/maxflow | |
#include <iostream> | |
#include <vector> | |
#include <queue> | |
#include <limits> | |
using namespace std; | |
#define SZ(a) (int)(a).size() | |
template<typename F> |
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
#include <vector> | |
using namespace std; | |
class SegmentTree { | |
int n; | |
vector<int> t; | |
public: | |
SegmentTree(const vector<int>& a) : n(a.size()), t(2*n) { | |
for (int i = 0; i < n; i++) { | |
t[n+i] = a[i]; |