This file contains hidden or 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
| import Control.Monad.Trans.State | |
| import Control.Monad.Trans.Except | |
| data StackState a = StackState | |
| { stackData :: [a] | |
| , stackDoneOps :: Int | |
| , stackOpsLimit :: Int | |
| } deriving (Show) | |
| newStackState :: Int -> StackState a |
This file contains hidden or 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
| import java.io.FileInputStream; | |
| import java.io.IOException; | |
| import java.io.InputStreamReader; | |
| import java.nio.charset.Charset; | |
| import java.nio.file.Files; | |
| import java.nio.file.Paths; | |
| import java.util.*; | |
| public class WordStatLineIndex { | |
| public static final char[] buf = new char[256]; |
This file contains hidden or 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
| template<typename T> | |
| class Vector { | |
| private: | |
| T *array; | |
| size_t cap; | |
| size_t end; // last element pointer | |
| public: | |
| Vector() : Vector(1) {} | |
| explicit Vector(size_t initialCap) { |
This file contains hidden or 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
| template<typename T, size_t n, size_t m> | |
| using matrix = array<array<T, m>, n>; | |
| template<typename T, size_t n > | |
| matrix<T, n, n> get_one_matrix() | |
| { | |
| matrix<T, n, n> res; | |
| for (size_t i = 0; i < n; i++) | |
| for (size_t j = 0; j < n; j++) | |
| res[i][j] = 0; |
This file contains hidden or 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
| int bl_sz = 1; | |
| class query | |
| { | |
| int l; | |
| int r; | |
| int id; | |
| } | |
| bool comp(const query& a, const query& b) |
This file contains hidden or 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
| 10000 | |
| /berq/az/ | |
| /berq/hqa/cyx/ | |
| /berq/hqa/dove/mxfm/ | |
| /berq/hqa/dove/puxu/es/ | |
| /berq/hqa/dove/puxu/xqe/ | |
| /berq/hqa/mti/ | |
| /berq/hqa/qoqc/ | |
| /berq/hqa/tcc/ | |
| /berq/pll/si/eh/dq/oa/ |
This file has been truncated, but you can view the full file.
This file contains hidden or 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
| 10000 | |
| /afu/ | |
| /cu/flj/bj/dk/ | |
| /cu/flj/bj/yh/ishm/ | |
| /cu/flj/lp/mbasj/prjhq/ij/hwq/ | |
| /cu/flj/lp/mbasj/prjhq/ij/iap/n/hxp/ | |
| /cu/flj/lp/mbasj/prjhq/ij/ri/ | |
| /cu/flj/lp/mbasj/prjhq/ij/syvf/wil/aek/ | |
| /cu/flj/lp/mbasj/prjhq/ij/syvf/wil/buw/is/ | |
| /cu/flj/lp/mbasj/prjhq/ij/syvf/wil/buw/wlhe/avz/chwd/ |
This file contains hidden or 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 int P = max(rand(), 239017) | 1; | |
| const int N = 500020; | |
| const int MOD1 = 1000000007; | |
| const int MOD2 = 1000000009; | |
| array<pair<int, int>, N> p; | |
| bool initp() | |
| { |
This file contains hidden or 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
| ll gcd(ll x, ll y) | |
| { | |
| while(x > 0 && y > 0) | |
| { | |
| if (x > y) | |
| x = x % y; | |
| else | |
| y = y % x; | |
| } |
This file contains hidden or 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 <bits/stdc++.h> | |
| //#include <ext/pb_ds/assoc_container.hpp> | |
| //#include <ext/pb_ds/tree_policy.hpp> | |
| using namespace std; | |
| //using namespace __gnu_pbds; | |
| #define INF (1<<30) |
NewerOlder