ss1h2a3tw

/*
給你一個Binary String長度 < 10^5
定義成長操作為在兩兩間隔間插入 其XOR值
查詢在經過 g < 10^4 成長後 區間內0,1的數量mod prime

思路

首先查詢區間[a,b]可以以[0,b]-[0,a-1]來計算所以問題可以精簡成為單向成長

那麼在一次成長過程中0增加的數量為相同的鄰居 1則反之

johnchen902

#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <new>
using namespace std;

struct Tree;

class TreeRef {

creationix

/*
 * Simple MD5 implementation
 *
 * Compile with: gcc -o md5 -O3 -lm md5.c
 */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
 

kyleturner

To remove a submodule you need to:

Delete the relevant line from the .gitmodules file.
Delete the relevant section from .git/config.
Run git rm --cached path_to_submodule (no trailing slash).
Commit and delete the now untracked submodule files.