GYH0730的博客

1035. 插入与归并(25)根据维基百科的定义：插入排序是迭代算法，逐一获得输入数据，逐步产生有序的输出序列。每步迭代中，算法从输入序列中取出一元素，将之插入有序序列中正确的位置。如此迭代直到全部元素有序。归并排序进行如下迭代操作：首先将原始序列看成N个只包含1个元素的有序子序列，然后每次迭代归并两个相邻的有序子序列，直到最后只剩下1个有序的序列。现给定原始序列和由某排序算法

#include <iostream>#include <cstdio>#include <cstdlib>using namespace std;int pre[1005];typedef struct node *Tree;int n;struct node{ struct node* left,*right; int data;}...

#include <iostream>#include <cstdio>#include <cstdlib>#include <queue>using namespace std;int post[35],in[35];typedef struct node * Tree;struct node{ struct node *le...

#include <iostream>#include <cstdio>#include <vector>#include <cstring>#include <algorithm>using namespace std;const int MAXN = 10005;int num[MAXN],area[MAXN];v...

#include <iostream>#include <cstdio>#include <string.h>#include <algorithm>using namespace std;int main(void){ char str[1005]; gets(str); int len = strlen(str); ...

#include <iostream>#include <cstdio>#include <queue>#include <cstdlib>using namespace std;typedef struct node * Tree;struct node{ struct node * left,*right; int dat...

#include <stdio.h>int pre[101],em[101][101];int find(int x){ if(pre[x] == x){ return x; } else{ return pre[x] = find(pre[x]); }}void join(int x,int y){ int fx = find(x);...

#include <stdio.h>#include <iostream>#include <vector>#include <cmath>using namespace std;struct node{ int data; int next;};vector<node> v(100001),uq,de;bool...

#include <iostream>#include <set>using namespace std;int main() { int n, t; cin >> n; set<int> s; s.insert(0); for(int i = 0; i < n; i++) { ci...

#include <iostream>#include <cstdio>#include <vector>#include <set>#include <cstring>using namespace std;vector<vector<int> > v(505);int color[505];

#include <iostream>#include <cstdio>#include <vector>using namespace std;struct node1{ int data; int next;};struct node2{ int data; int next; int add;};vector<n...

#include <iostream>#include <cstdio>#include <vector>#include <cstring>#include <string>using namespace std;int sh[1005],sm[1005];struct ans{ int num; int m...

#include <iostream>#include <cstdio>using namespace std;typedef long long ll;int main(void){ int x; cin>>x; ll ans = 1; int cnt = 1; while(ans < x){ ans = ans *...

#include <stdio.h>#include <iostream>#include <string.h>using namespace std;char s[1005];char ans[1000][1000];int main(void){ int n; cin>>n; getchar(); gets(s);...

#include <iostream>#include <cstdio>#include <algorithm>#include <map>using namespace std;const int INF = 0x7fffffff;map<int,double> a;map<int,double> b;m...

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int INF = 0x3f3f3f3f;const int MAXN = 505;int e[MAXN][MAXN],weight[M...

#include <iostream>#include <cstdio>#include <cmath>using namespace std;typedef long long ll;int main(void){ ll n; cin >> n; ll max = sqrt(n); for(int len = 12; ...

表达式转换（25 分）算术表达式有前缀表示法、中缀表示法和后缀表示法等形式。日常使用的算术表达式是采用中缀表示法，即二元运算符位于两个运算数中间。请设计程序将中缀表达式转换为后缀表达式。输入格式:输入在一行中给出不含空格的中缀表达式，可包含+、-、*、\以及左右括号()，表达式不超过20个字符。输出格式:在一行中输出转换后的后缀表达式，要求不同对象（运算数、运算符号

1044. 火星数字(20)时间限制 400 ms内存限制 65536 kB代码长度限制 8000 B判题程序 Standard 作者 CHEN, Yue火星人是以13进制计数的：地球人的0被火星人称为tret。地球人数字1到12的火星文分别为：jan, feb, mar, apr, m

题意：给出一棵树，输出每一层的叶子节点数目思路：首先用一个二维数组存储树，然后对树进行层序遍历，然后遍历层序遍历的数组，在判断是否一层遍历结束时，同时记录下一层的结点数目，第一次提交没有满分，错误点是，只有根节点的情况。#include <stdio.h>#include <queue>using namespace std;struct node{ int n...

题意：给出一张图，求有多少条不同的最短路，和在最短路的前提下求出最大点权和思路：迪杰斯特拉的变形#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;const int INF = 0x3f3f3f3f;int e[505][505],weight[...

题意：给出两个多项式，输出这两个多项式的和思路：指数最多不超过1000，用一个数组来表示多项式即可，输出的时候指数从大到小输出，如果系数为零这一项不输出，如果所有系数都为零只输出0#include <stdio.h>double a[1005],b[1005],ans[1005];int main(void){ int k1,k2; scanf("%d",&k1);...

题意：计算A+B，输出的时候每隔三个数一个逗号。#include <stdio.h>int main(void){ int a,b; scanf("%d%d",&a,&b); int sum = a + b; if(sum == 0){ printf("0\n"); return 0; } if(sum < 0){ printf("-"...

#include <stdio.h>#include <ctype.h>#include <string.h>int judge(char* s){ if(s[0] == '-'){ return -1; } int num = 0; int len = strlen(s); for(int i = 0; i < len;...

#include <iostream>#include <cstdio>#include <string.h>using namespace std;const int MAXN = 1000005;int fa[MAXN],mo[MAXN];int sex[MAXN];bool vis[MAXN];int flag;void dfs(i...

#include <iostream>#include <cstdio>#include <string>#include <set>#include <vector>using namespace std;int main(void){ set<int> s1,s2,s3; vector<int...

#include <iostream>#include <cstdio>#include <string>#include <set>#include <vector>using namespace std;int main(void){ string s; cin>>s; int c[4] ...

#include <iostream>#include <cstdio>#include <vector>#include <cstring>#include <string>#include <set>#include <algorithm>using namespace std;set&amp

#include <iostream>#include <cstdio>#include <vector>#include <cstring>#include <string>#include <set>#include <algorithm>using namespace std;int pr

#include <iostream>#include <cstdio>#include <vector>#include <algorithm>#include <string.h>using namespace std;vector<int> v;bool cmp(int a,int b){ retu...

#include <iostream>#include <cstdio>#include <string>#include <vector>#include <map>#include <algorithm>using namespace std;long long z[105],m[105];/*long ...

#include <iostream>#include <set>#include <string>#include <vector>#include <cmath>using namespace std;vector<int> v[100005];int val[100005];double z,r;d...