摘要：
problemsolutioncodes#includeusing namespace std;int a[10010], b[10010], g[10010], k[10010];int main(){ int n; cin>>n; for(int i... 阅读全文
posted @ 2018-06-08 22:10
gwj1139177410
阅读(105)
评论(0)
推荐(0)
摘要：
problemsolutioncodes#include#include#includeusing namespace std;int main(){ stacks; string str; cin>>str; bool flag = 1; ... 阅读全文
posted @ 2018-06-08 22:08
gwj1139177410
阅读(121)
评论(0)
推荐(0)
摘要：
problemsolutioncodes#includeusing namespace std;int le[100010], ri[100010], book[100010];int main(){ int n; cin>>n; ri[0] = 1; ... 阅读全文
posted @ 2018-06-08 22:07
gwj1139177410
阅读(119)
评论(0)
推荐(0)
摘要：
problemsolutioncodes#include#includeusing namespace std;stacks;int main(){ char ch; int t=0; while(cin>>ch && ch!='@'){ i... 阅读全文
posted @ 2018-06-08 22:06
gwj1139177410
阅读(149)
评论(0)
推荐(0)
摘要：
problemsolutioncodes#include#include#include#define maxn 100001using namespace std;int a[maxn], b[maxn], c[maxn];int main(){ string... 阅读全文
posted @ 2018-06-08 22:04
gwj1139177410
阅读(114)
评论(0)
推荐(0)
摘要：
problemsolutioncodes//高精减法//高精度的本质，用长度无限的数组或字符串代替int//原理：模拟减法退位#include#include#includeusing namespace std;const int maxn = (int)1e6+1... 阅读全文
posted @ 2018-06-08 22:03
gwj1139177410
阅读(116)
评论(0)
推荐(0)
摘要：
problemsolutioncodes#include#include#include#define maxn 1010using namespace std;int a[maxn],b[maxn],c[maxn];int main(){ string s1,... 阅读全文
posted @ 2018-06-08 22:01
gwj1139177410
阅读(117)
评论(0)
推荐(0)
摘要：
problemsolutioncodes#includeusing namespace std;int fa[200010];int find(int x){return x==fa[x] ? x : fa[x]=find(fa[x]);}int main(){ ... 阅读全文
posted @ 2018-06-08 21:58
gwj1139177410
阅读(84)
评论(0)
推荐(0)
摘要：
problemsolutioncodes#include#include#define maxn 200020using namespace std;int n, m;struct UndirectedEdge{ int u, v, w; Undirect... 阅读全文
posted @ 2018-06-08 21:56
gwj1139177410
阅读(105)
评论(0)
推荐(0)
摘要：
problem给定一个范围N回答M个某数字是否为质数的询问（Msolutioncodes#include#define maxn 10000010using namespace std;int pri[maxn];int main(){ int n, m; c... 阅读全文
posted @ 2018-06-08 21:55
gwj1139177410
阅读(92)
评论(0)
推荐(0)
浙公网安备 33010602011771号