![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
复试题目
文章平均质量分 72
Glory232
这个作者很懒,什么都没留下…
展开
-
2017计算机院A
package JavaTest;import java.math.*;import java.util.*;public class JavaTest { public static void main(String[] args) { Scanner in = new Scanner(System.in); int M = in.nextInt(); while (M--...原创 2018-03-19 08:57:26 · 215 阅读 · 0 评论 -
2012计算机D IP数据包解析
#include <iostream>#include <cstdio>#include <string>#include <cstdlib>using namespace std;int main(int argc, char** argv) { int t; scanf("%d", &t); getchar(); fo...原创 2018-03-20 15:04:05 · 203 阅读 · 0 评论 -
2013计算机D 最小距离查询
#include <iostream>#include <cstdio>#include <string>#define max 200200 using namespace std;char strTmp[max / 2];string str;int ans[max];int lastPosLoc[26];int n;void getAn...原创 2018-03-20 12:54:35 · 239 阅读 · 0 评论 -
2013计算机B 统计节点个数
#include <iostream>#include <cstdio>#include <vector>using namespace std;int out[1000];vector<int> map[1000];int main(int argc, char** argv) { int t; scanf("%d", &t...原创 2018-03-20 09:54:58 · 208 阅读 · 0 评论 -
2015计算机C
#include <iostream>#include <cstdio>#define MAX 100using namespace std;int pic[MAX][MAX];int record[MAX][MAX];// 以当前点为右下角的最大的全0正方形边长int min(int a, int b, int c) { if (a < b &...原创 2018-03-19 23:00:25 · 146 阅读 · 0 评论 -
2017计算机院D
//2//12 30//0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0//0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0//0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0//...原创 2018-03-19 14:22:35 · 189 阅读 · 0 评论 -
2011计算机C 寻找宝藏
#include <iostream> #include <cstdio> #include <cmath>#define max 110 using namespace std; int Tree[max]; int main(int argc, char** argv) { int m, n, tar; whil...原创 2018-03-22 21:35:38 · 447 阅读 · 0 评论 -
2017计算机院C
#include <iostream>#include <cstdio>#include <string>#define MAX 100using namespace std;struct node { struct node* left; struct node* right; int val;} nodes[MAX];int loc = ...原创 2018-03-19 10:58:28 · 236 阅读 · 0 评论 -
2017计算机院B
#include <iostream>#include <cstdio>#include <string>#include <sstream>#include <cstdlib>#include <algorithm>using namespace std;string int2string(int i) { ...原创 2018-03-19 10:12:52 · 233 阅读 · 0 评论 -
2012网研B 二叉树的层数
#include <iostream>#include <cstdio>#include <vector>#include <map>#define max 110using namespace std;struct E { int left; int right;} nodes[max];map<int, vector&l...原创 2018-03-20 16:52:00 · 198 阅读 · 0 评论