#include <iostream> #include <algorithm> using namespace std; //核心思路，创建两个相同的数组来模拟匹配过程。二重循环遍历两组数组，但是要注意对相同元素的处理 int main(int arg...

#include <stdio.h> #include <stdlib.h> int main(int argc, char const *argv[]) { double n1,n2,x1,x2; char op; scanf("%lf %l...

#include <stdio.h> #include <stdlib.h> #define Maxsize 10000 int main(int argc, char const *argv[]) { int k,start,stop,N,coun...

#include <stdio.h> #include <stdlib.h> typedef struct LNode { int Number; struct LNode * next; } LNode; int main(int ar...

#include <iostream> #include <algorithm> using namespace std; typedef struct Node { int Element; // 节点中的元素为整数类型 stru...

#include <stdio.h> #include <stdlib.h> int main(int argc, char const *argv[]) { int n,N ; scanf("%d",&n); if(n==1){//对...

#include <stdio.h> #include <stdlib.h> int Month[]={18,31,30,31,31,30,31,30,31}; //int data[]={6,7,1,2,3,4,5}; int main(int arg...

#include <iostream> #include <algorithm> #define Maxsize 1000 using namespace std; int main(int argc, char const *argv[]) { ...