行云出岫

题目链接：https://www.nowcoder.com/acm/contest/73/B题目分析：简单的组合数取模模板题 ，要求逆元。逆元的求法：http://blog.youkuaiyun.com/arrowlll/article/details/52629448规律图如下：代码如下：#include <iostream>#include <stdio.h>...

转自：https://www.cnblogs.com/dominatingdashuzhilin/p/4822768.html题意：字符串s[1]=”c”,s[2]=”ff”,s[i]=s[i-2]+s[i-1] (i>=3); 对于每个n,求s[n]中所有的任意两个字符c的距离之和；思路：用dp[i]表示s[i]的结果，dist[i]表示s[i]中所有c到s[i]末尾的距离之和

题目链接：https://vjudge.net/problem/Gym-101498D**题目：**A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.Co...