G.D.Retop的专栏

线性求逆元1−1≡1(modp)1^{-1}\equiv1(mod\ p)令p=k∗i+r,r<i,1<i<pp=k*i+r,r<i,1<i<pk∗i+r≡0(modp)k*i+r \equiv 0 (mod\ p)两边同事乘上i−1∗r−1i^{-1}*r^{-1}得到k∗r−1+i−1≡0(modp)k*r^{-1}+i^{-1}\equiv0 (mod\ p)i−1≡−k∗

Problem A. Distance 求树中距离恰好为2的结点对的个数#include#include#includeusing namespace std;int edge[100007];int main(){ int t; while(scanf("%d",&t)!=EOF){ for(int i = 1;i <= t; i++)

取石子游戏Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3381    Accepted Submission(s): 1981Problem Description1堆石子有n个,两人轮流取.先取者第1次

Calendar GameTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3121    Accepted Submission(s): 1830Problem DescriptionAdam and Eve

1325: A very hard problemTime Limit: 3 Sec  Memory Limit: 160 MBSubmit: 253  Solved: 58[Submit][Status][Web Board]DescriptionCX老湿经常被人黑，被黑得多了，自己也就麻木了。于是经常听到有人黑他，他都会深情地说一句：禽兽啊！一天CX

CodeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 489    Accepted Submission(s): 191Problem DescriptionWLD likes playing with

GCDTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7229    Accepted Submission(s): 2651Problem DescriptionGiven 5 integers: a, b

MophuesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 327670/327670 K (Java/Others)Total Submission(s): 910    Accepted Submission(s): 345Problem DescriptionAs we know, any po

A * B Problem PlusTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14598    Accepted Submission(s): 2741Problem DescriptionCalcul

题意：给三个骰子，骰子有k1,k2,k3个面。每次掷骰子，得到的点数和为前进的步数，如果掷骰子的结果为c1,c2,c3（有序）则回到原点。从0点出发，到达大于N的点，则游戏结束。求掷骰子次数的期望。转移方程为：              dp[i] = dp[i+l1+l2+l3]*(1/k1/k2/k3)+dp[0]*(1/k1/k2/k3)+1其中枚举l1,l2,l3为掷骰子得

一、曼哈顿距离最小生成树曼哈顿距离最小生成树问题可以简述如下：给定二维平面上的N个点，在两点之间连边的代价为其曼哈顿距离，求使所有点连通的最小代价。朴素的算法可以用O(N2)的Prim，或者处理出所有边做Kruskal，但在这里总边数有O(N2)条，所以Kruskal的复杂度变成了O(N2logN)。但是事实上，真正有用的边远没有O(N2)条。我们考虑每个点会和其他

#include#include#includeusing namespace std;#define maxn 500007#define maxm 7000007#define uint unsigned intvectorhehe[maxn];uint copr[maxn],factor[maxn];uint next[maxm],val[maxm];uint cnt =

CoprimeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1460    Accepted Submission(s): 571Problem DescriptionThere are n peopl

CRB and CandiesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 402    Accepted Submission(s): 185Problem DescriptionCRB has N di

Saving BeansTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3112    Accepted Submission(s): 1177Problem DescriptionAlthough wint

Xiao Ming's HopeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1793    Accepted Submission(s): 1189Problem DescriptionXiao Ming

DP?Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 128000/128000 K (Java/Others)Total Submission(s): 2460    Accepted Submission(s): 769Problem DescriptionFigure 1 shows t

Circles GameTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 251    Accepted Submission(s): 51Problem DescriptionThere are n circ

He is FlyingTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 91    Accepted Submission(s): 25Problem DescriptionJRY wants to dra

CRB and PuzzleTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 69    Accepted Submission(s): 35Problem DescriptionCRB is now play

#include#include#include#include#includeusing namespace std;#define mod 1000000007#define maxn 22#define ll long longstruct Matrix{ int mat[22][22]; void init(){ memset(mat,0,

Simple MatrixTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 244    Accepted Submission(s): 85Problem DescriptionAs we know, seq

http://www.cppblog.com/menjitianya/archive/2014/06/08/207226.html高斯消元算法目的：            高斯消元，一般用于求解线性方程组AX = B（或 模线性方程组AX mod P = B），以四个未知数，四个方程为例，AX=B表示成4x4的矩        阵和4x1的矩阵相乘的形式：

Best SolverTime Limit: 1500/1000 MS (Java/Others)    Memory Limit: 65535/102400 K (Java/Others)Total Submission(s): 401    Accepted Submission(s): 212Problem DescriptionThe so-called best

Problem of PrecisionTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1057    Accepted Submission(s): 624Problem Description

Tom and matrixTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 447    Accepted Submission(s): 136Problem DescriptionTom was on th

这道题题意：有很多