机试真题
题目后面再添加
北枫凉
The greatest gift you can give yourself is that of education.
展开
-
2006-2
结构体,sort()函数排序。。。原创 2020-04-23 16:17:05 · 124 阅读 · 0 评论 -
2007-2
有序数组合并。。。不在写了原创 2020-04-23 16:14:41 · 173 阅读 · 0 评论 -
2007-1
/*2020/4/23第二遍*/#include <iostream>#include<stdio.h>using namespace std;int main(){ char c; c = getchar(); int count_space = 0; int count_line = 0; int count_...原创 2020-04-23 16:13:12 · 138 阅读 · 1 评论 -
2008-3
/*2020/4/223第二遍*/#include <iostream>#include<stdio.h>#include<string.h>#include<ctype.h>using namespace std;int main(){ FILE *in,*out; in = fopen("string.in"...原创 2020-04-23 15:45:35 · 138 阅读 · 0 评论 -
2008-2
/*2020/4/23第二遍*/#include <iostream>#include<stdio.h>using namespace std;const int maxn = 10;int A[maxn][maxn];int B[maxn][maxn];int n;void input(int arr[maxn][maxn]){ fo...原创 2020-04-23 15:00:51 · 155 阅读 · 0 评论 -
2008-1
/*2020/4/23第二遍*/#include <iostream>#include<stdio.h>#include<math.h>using namespace std;int isPrime(int n){ if(n<=1) return 0; int temp = sqrt(n)+1; for(int...原创 2020-04-23 14:40:17 · 112 阅读 · 0 评论 -
2009-3
#include <iostream>#include<stdio.h>#include<string.h>using namespace std;int main(){ char str_del[100]; FILE *in; in = fopen("filein.txt","r"); FILE *out; ...原创 2020-04-22 18:58:20 · 136 阅读 · 0 评论 -
2009-2
/*2020/4/22第二遍*/#include <iostream>#include<stdio.h>#include<algorithm>using namespace std;bool cmp(int a,int b){ if(a<b) return 1; else return 0;}int main(){...原创 2020-04-22 18:17:10 · 163 阅读 · 0 评论 -
2009-1
/*2020/4/22第二遍*/#include <iostream>#include<stdio.h>using namespace std;int main(){ int x,n; scanf("%d%d",&x,&n); double y = x; while(n--) { y ...原创 2020-04-22 18:12:56 · 407 阅读 · 0 评论 -
2010-3
/*2020/4/22第二遍*/#include <iostream>#include<set>#include<stdio.h>using namespace std;int main(){ set<int> s1; set<int> s2; int m,n; scanf("%d",&...原创 2020-04-22 18:05:31 · 161 阅读 · 0 评论 -
2010-2
/*2020/4/22第二遍*/#include <iostream>#include<stdio.h>#include<set>#include<string>#include<string.h>using namespace std;int main(){ char str1[100]; cha...原创 2020-04-22 18:00:21 · 156 阅读 · 0 评论 -
2010-1
习题:π/4约等于1-1/3+1/5-1/7…直到发现某项的绝对值小于10的负六次方为止(此项不累加)/*2020/4/22第二遍*/#include <iostream>#include<stdio.h>#include<math.h>using namespace std;int main(){ double pi = 1;...原创 2020-04-22 17:50:06 · 140 阅读 · 0 评论 -
2011-3
/*2020/4/22第二遍*/#include <iostream>#include<stdio.h>#include<string.h>#include<ctype.h>using namespace std;char str[300];int cmp(char p,char q){ if( isupper(p...原创 2020-04-22 17:09:35 · 219 阅读 · 0 评论 -
2011-2
/*2020/4/22第二遍*/#include <iostream>#include<stdio.h>using namespace std;int m1,n1,m2,n2,m,n;int A[30][20];int B[30][20];void inputA(){ scanf("%d%d",&m1,&n1); f...原创 2020-04-22 16:44:16 · 112 阅读 · 0 评论 -
2011-1
#include <iostream>#include<stdio.h>using namespace std;int fun(int n){ int sum = 0; for(int i = 1;i<n;i++) { if(n%i==0) sum+=i; } return s...原创 2020-04-22 16:12:50 · 132 阅读 · 0 评论 -
2012-3
/*2020/4/20第二次编写*/#include <iostream>#include<stdio.h>#include<string.h>#include<stdlib.h>using namespace std;const int MAXWORD = 20;char str[320];struct node{ ...原创 2020-04-20 18:52:39 · 125 阅读 · 0 评论 -
2012-2
/*2020/4/20第二遍*/#include <iostream>#include<stdio.h>#include<string.h>using namespace std;const int maxn = 10;int N;int map_matric[maxn][maxn];int vis[maxn][maxn];int f...原创 2020-04-20 16:27:45 · 131 阅读 · 0 评论 -
2012-1
/*2020/4/19*/#include <iostream>#include<stdio.h>using namespace std;int n;int solution(int x){ int sum = 0; for(int i = 0; ;i++) { int t = x + i;//n n+1 n+...原创 2020-04-19 17:33:27 · 103 阅读 · 0 评论 -
2013-3
/*2020/4/19第二遍*/#include <iostream>#include<stdio.h>#include<string.h>using namespace std;int main(){ char str[100]; scanf("%s",str); int index = -1; for(i...原创 2020-04-19 17:14:52 · 123 阅读 · 0 评论 -
2013-2
#include <iostream>#include<stdio.h>#include<vector>#include<string.h>#include<math.h>using namespace std;const int maxn = 11;int n;vector<int> path;int ...原创 2020-04-19 16:43:39 · 121 阅读 · 0 评论 -
2013-1
/*2020/4/18第二遍*/#include <iostream>#include<stdio.h>using namespace std;int min(int a,int b){ return (a<b)?a:b;}int main(){ int m,n; scanf("%d%d",&m,&n)...原创 2020-04-18 16:42:19 · 126 阅读 · 0 评论 -
2014-3
/*北航机试真题2020/4/25第二遍*/#include<stdio.h>#include<string.h>int line; char str[120]; char temp[120]; char before[120]; char after[120];int count_n = 0;int count_befo...原创 2020-04-25 15:18:01 · 171 阅读 · 0 评论 -
2014-1
/*2020/4/18第二遍*/#include<stdio.h>int fun(int n){ if(n == 0 || n == 1) return 1; else return n*fun(n-1);}int main(){ int n; int temp; scanf("%d",&am...原创 2020-04-18 14:23:52 · 145 阅读 · 0 评论 -
2015-3
/*2020/4/17第二遍*///方法一:建立二叉搜索树/*#include <iostream>#include<stdio.h>#include<string.h>#include<stdlib.h>#include<ctype.h>using namespace std;const int MAXWORD...原创 2020-04-17 19:59:43 · 130 阅读 · 0 评论 -
2015-2
/*2020/4/17第二遍*/#include <iostream>#include<stdio.h>using namespace std;int n,m;struct Window{ int id; int lx,ly; int rx,ry;}windows[20],temp;int cmp(Window w,int...原创 2020-04-17 19:18:22 · 112 阅读 · 0 评论 -
2015-1
/*2020/4/17第二遍*/#include <iostream>#include<stdio.h>using namespace std;int n1,result1;int n2,result2;int factor[100];int count = 0;int fun(int n){ int result = 0; fo...原创 2020-04-17 17:53:09 · 150 阅读 · 0 评论 -
2016-2
/*2020/4/17第二遍*/#include <iostream>#include<stdio.h>#include<string.h>using namespace std;char str[10000];void fun(char temp[],int len,int &count){ int i = 0; ...原创 2020-04-17 17:08:46 · 819 阅读 · 0 评论 -
2016-1
/*2020/4/17第二遍*/#include <iostream>#include<stdio.h>using namespace std;int n,m;int num[20];int main(){ int sum = 0; int ci =0; int i; scanf("%d",&n); i...原创 2020-04-17 16:29:03 · 216 阅读 · 0 评论 -
2017-3
/*2020/4/16第二遍*/#include<stdio.h>#include<stdlib.h>#include<string.h>struct a{ char s1[20]; char s2[20]; char s3[20];}input[100];int N;char str1[20];char st...原创 2020-04-16 19:02:30 · 154 阅读 · 0 评论 -
2017-2
/*2020/4/17第二遍*/#include<stdio.h>#include<string.h>#include<ctype.h>const int MAXVAR = 20;char str1[100];char str2[100];char var1[100][20];char var2[100][20];int n1 = 0,...原创 2020-04-17 16:10:28 · 118 阅读 · 0 评论 -
2017-1
/*2020/4/16二刷*/#include<stdio.h>#include<algorithm>using namespace std;struct node{ int data; int index;}input[100];int N;bool cmp(node a,node b){ if(a.data<b....原创 2020-04-16 17:43:48 · 106 阅读 · 0 评论 -
2018-2
/*2020/4/16二刷*/#include<stdio.h>#include<stdlib.h>#include<string.h>#include<vector>using namespace std;int N;int input[100][4];int maxNum = 0;int maxHeight = 0;t...原创 2020-04-16 17:12:20 · 100 阅读 · 0 评论 -
2018-1
/*2020/4/16,机试二刷*/#include<stdio.h>#include<string.h>struct Line{ int sx,sy,ex,ey; int len; int flag;}lines[100];int N;int maxLen = 1;int main(){ int i,j,k; ...原创 2020-04-16 16:01:58 · 136 阅读 · 0 评论 -
2019-2-2
//我的天第一次编写竟然这么长,一定有我没找到的方法,啊哈哈哈哈,/*北航机试2020/4/13第二场第二题*/#include<stdio.h>#include<stdlib.h>#include<vector>#include<iostream>using namespace std;const int INF = 1000...原创 2020-04-14 00:16:13 · 102 阅读 · 0 评论 -
2019-2-1
内容第一次编写第二次编写第一次编写/*第一次编写2020/3/3*/#include<stdio.h>#include<math.h>int tmp[3];int ans[1000000];int first;int flag;int a,b;int isPrime(int t){ int i; if(t == 0 || t == 1)...原创 2020-04-11 22:45:55 · 86 阅读 · 0 评论 -
2019-1-2
2019北航机试第二场第二题三叉树题目描述Time Limit: 1000 msMemory Limit: 256 mb一个关于三叉树的题目,小于100的值代表树叶,大于100的值为分支点,建树的过程是水平方向建树,输入格式:先输入n,代表有n组数据,接下来n行,输入4个数,第一个数代表根节点,接下来分别代表三个子节点,-1代表子节点不存在,输入的顺序按照层次遍历的次序。接下来,...原创 2020-04-13 17:55:39 · 181 阅读 · 0 评论 -
2019-1-1
/*2020/4/11//第二次编写*/#include<stdio.h>#include<vector>#include<math.h>using namespace std;int isPrime(int n){ if(n == 0 || n == 1) return 0; for(int i = 2;i<=(int)sq...原创 2020-04-11 18:29:54 · 83 阅读 · 0 评论