## doccano使用和部署

### 安装和初始配置

pip install doccano

# 初始化数据库
doccano init

# 创建一个super user。这里要把pass改成你需要的密码。当然，用户名也可以改成别的。


### 启动doccano

# 启动webserver
doccano webserv[......]Read more

## zotero改引用格式

### 1、获取一个csl模版

#### （1）从样式编辑器中获取

zotero->首选项->饮用->样式编辑器

csl库

### 2、修改内容

#### （1）修改文中引文格式

• text variable中可以设置数字显示的格式，如(1)[1]
(1)的格式为<text variable="issue" prefix="(" suffix=")"/>
[1]
• 修改成上标格式 vertical-align=[……]

## 1007. Maximum Subsequence Sum (25)-PAT甲级真题（最大连续子序列和、动态规划dp）

Given a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to be { Ni, Ni+1, …, Nj } where 1 <= i <= j <= K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, it[……]

## 1009. Product of Polynomials (25)-PAT甲级真题

This time, you are supposed to find A*B where A and B are two polynomials.

#### Input Specification:

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 aN1 N2 aN2 … NK aNK, where K is the number of nonzero terms in the polyno[……]

## 1113. Integer Set Partition (25)-PAT甲级真题

Given a set of N (> 1) positive integers, you are supposed to partition them into two disjoint sets A1 and A2 of n1 and n2 numbers, respectively. Let S1 and S2 denote the sums of all the numbers in A1 and A2, respectively. You are supposed to make the partition so that |n1 – n2| is minimized first, a[……]

## 1114. Family Property (25)-PAT甲级真题（并查集）

This time, you are supposed to help us collect the data for family-owned property. Given each person’s family members, and the estate（房产）info under his/her own name, we need to know the size of each family, and the average area and number of sets of their real estate.

Each inp[……]

## 1112. Stucked Keyboard (20)-PAT甲级真题

On a broken keyboard, some of the keys are always stucked. So when you type some sentences, the characters corresponding to those keys will appear repeatedly on screen for k times.

Now given a resulting string on screen, you are supposed to list all the possible stucked keys, and the original strin[……]

## 1110. Complete Binary Tree (25)-PAT甲级真题（BFS）

Given a tree, you are supposed to tell if it is a complete binary tree.

#### Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (<=20) which is the total number of nodes in the tree — and hence the nodes are numbered from 0 to N-1. T[……]

## 1116. Come on! Let’s C (20)-PAT甲级真题

“Let’s C” is a popular and fun programming contest hosted by the College of Computer Science and Technology, Zhejiang University. Since the idea of the contest is for fun, the award rules are funny as the following:

1. The Champion will receive a “Mystery Award” (such as a BIG collection of students’[……]