Skip to content

Instantly share code, notes, and snippets.

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <ctime>
#include <cassert>
#include <map>
// https://jsfiddle.net/bxqfL89j/1/
/*
<div id="container">
<button>Click To Show Message</button>
</div>
*/
function callFnWithTimeout(fn, timeoutMilli) {
const waitPromise = new Promise(resolve => setTimeout(resolve, timeoutMilli));
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
using namespace std;
#include <bits/stdc++.h>
#include <random>
#include <bits/stdc++.h>
using namespace std;
struct PalindromicTree {
//
// private:
struct node {
map<char, int> link;
int suffix_link;
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = int(1e9) + 7;
//素数列挙
bool prime[1000001]; //10^6
vector<int> prs;
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
//素数列挙
bool prime[1000001]; //10^6
vector<int> prs;
void init_prime() {
memset(prime, 1, sizeof(prime));
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
@math314
math314 / ntt.cpp
Last active September 21, 2020 05:05
#include <cstdio>
#include <cassert>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
#define FOR(i,n) for(int i = 0; i < (n); i++)
import hashlib
PRIME = 10162817389166932304743927803664677577393035849460315554227038992256439669168822924924642681859165915398841119695331997622323074382673543580118593098794075768017359068156207668418577358758037040886636583057751950491466568754968161402970164774854422196808968101372380404300325099055524339557705423721707
G = 1323857230486534278
def get_salt(m):
for _ in range(1000):
m = hashlib.sha512(m).hexdigest()
return m
#coding=utf-8
import os
import socket
import select
from time import sleep
import binascii
class Client(object):
def __init__(self):