【NOIP2011】【Luogu1003】铺地毯
problemsolutioncodes#includeusingnamespacestd;inta[10010],b[10010],g[10010],k[10010];intmain(){intn;cin>>n;for…
problemsolutioncodes#includeusingnamespacestd;inta[10010],b[10010],g[10010],k[10010];intmain(){intn;cin>>n;for…
problemsolutioncodes#include#include#includeusingnamespacestd;intmain(){stacks;stringstr;cin>>str;boolflag=1;f…
problemsolutioncodes#includeusingnamespacestd;intle[100010],ri[100010],book[100010];intmain(){intn;cin>>n;ri[0…
problemsolutioncodes#include#includeusingnamespacestd;stacks;intmain(){charch;intt=0;while(cin>>ch&&ch!='@'){i…
problemsolutioncodes#include#include#include#definemaxn100001usingnamespacestd;inta[maxn],b[maxn],c[maxn];intm…
problemsolutioncodes//高精减法//高精度的本质,用长度无限的数组或字符串代替int//原理:模拟减法退位#include#include#includeusingnamespacestd;const…
problemsolutioncodes#include#include#include#definemaxn1010usingnamespacestd;inta[maxn],b[maxn],c[maxn];intmai…
problemsolutioncodes#includeusingnamespacestd;intfa[200010];intfind(intx){returnx==fa[x]?x:fa[x]=find(fa[x]);}…
problemsolutioncodes#include#include#definemaxn200020usingnamespacestd;intn,m;structUndirectedEdge{intu,v,w;Un…
problem给定一个范围N回答M个某数字是否为质数的询问(Msolutioncodes#include#definemaxn10000010usingnamespacestd;intpri[maxn];intmain(…