GH的博客

乘：procedure c1(x:longint);var i,j,k:longint; y:int64;begin y:=0; for i:=1 to ans[0] do begin ans[i]:=ans[i]*x+y; y:=ans[i] div mo; ans[i]:=ans[i] m

code:void spfa(){ int h=1,t=1,i,j,k; d[1]=1; dis[1]=0; bz[1]=true; while (h<=t) { int l=d[h]; i=g[l];//前向新 while (a[i][0]==l) { int

code:long long mi(long long x,long long l){ long long y; if (x==1) return(l); if (x%2==1) { long long s=mi(x/2,l); y=(s*s*l); } else { long long s=m

hdu2222code#include &lt;cstdio&gt;#include &lt;cstring&gt;#include &lt;algorithm&gt;#include &lt;queue&gt;using namespace std;const int N=1e6+10,M=1e6+10;queue&lt;int&gt; d;char s[N];int...