izhxxx的博客

原题链接：牛客网#include <algorithm>#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include <queue>#include <stack>using namespace std;

原题链接#include <algorithm>#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>using namespace std;typedef struct BiTNode...

原题链接#include <algorithm>#include <iostream>#include <cstdio>#include <cstdlib>#include <cmath>using namespace std;const double PI = acos(-1);int xa, ya, za, xb, ...

原题链接#include <algorithm>#include <iostream>#include <cstdio>#include <cstdlib>using namespace std;typedef struct Node{ int id, grade;}Node;const int MAX = 110;in...

原题链接#include <algorithm>#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>using namespace std;const int MAX = 100010...

原题链接#include <algorithm>#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>using namespace std;int main(){ char ...

原题链接#include <algorithm>#include <iostream>#include <cstdio>#include <cstdlib>using namespace std;const int MAX = 100010;int N, X;int p[MAX] = {0};int Prime[MAX] = {0...

原题链接#include <algorithm>#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>using namespace std;typedef struct Node{...

原题链接#include <algorithm>#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>using namespace std;typedef struct Node{...

第三题：二叉树遍历问题定义输入一棵二叉树，输出树的前、中、后序遍历结果。输入一个整数N（N<= 10000)，表示树中有N个结点（编号0~N-1）。接下来N行，依次为结点0~结点N-1的左右孩子情况。每行3个整数，F,L,R。L,R为F的左右孩子。L,R如果为-1表示该位置上没有孩子。分三行分别输出树的前中后序遍历。同一行中的数字，用一个空格间隔。输入样例50 3 11...

原题链接#include <algorithm>#include <iostream>#include <cstdio>using namespace std;bool isLeapYear(int yy){ if(yy%400 == 0) return true; if(yy%4 == 0 && yy%100) r...

原题链接#include <algorithm>#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>using namespace std;int main(){ char ...

原题链接#include <algorithm>#include <iostream>#include <cstdio>#include <cstdlib>using namespace std;int main(){ int N; while(scanf("%d", &N) != EOF) { ...

原题链接#include <algorithm>#include <iostream>#include <cstdio>#include <cstdlib>using namespace std;const int INF = 1<<30;int main

输入两个集合，分别求其交集和并集中元素的个数，每个集合中可能存在相同的元素，而最终的交集和并集中应该不存在。例如：输入：4 53 4 7 34 6 3 2 6输出：2 5#include <algorithm>#include <iostream>#include <cstdio>#in

1， 求众数。 众数就是一个序列中出现次数最多的数字。 如果不唯一，则输出小的那个值。 给定第一个代表有几个数字。 1<=n<=10^5 每个数字在 int 范围内样例：输入， （第一个代表有几个数字）810 3 8 8 3 2 2 2输出 2#include <algorithm>#include <iostream>#in...