BUPT Excited OJ
文章平均质量分 57
Glory232
这个作者很懒,什么都没留下…
展开
-
288. 奇偶求和-软件14
#include <iostream>#include <cstdio>using namespace std;int main(int argc, char** argv) { int T; scanf("%d", &T); while (T--) { int N; scanf("%d", &N); int odd = 0; ...原创 2018-03-18 18:56:15 · 606 阅读 · 0 评论 -
310. 内存分配-网研14-计算机二14
#include <iostream>#include <cstdio>#include <string>#include <algorithm>using namespace std;#define NMAX 100int MemNow[NMAX];bool visited[NMAX]; // 每个内存块只访问1次int main(...原创 2018-03-16 13:48:58 · 227 阅读 · 0 评论 -
311. 图像识别-计算机二2014
// 选择C++11或14,否则会报编译错误#include <iostream>#include <stdio.h>#include <math.h>using namespace std;int Mat[100][100];bool mark[100][100];int res[100];int go[][2] = { -1,-1, -...原创 2018-03-16 09:40:41 · 314 阅读 · 0 评论 -
117. Single Number
#include <cstdio>#include <iostream>#include <map>using namespace std;map<unsigned long long int, int> M;int main(void) { int n; while (scanf("%d", &n) != EOF) { M...原创 2018-03-27 21:30:11 · 180 阅读 · 0 评论 -
120. 日期
#include <cstdio>#include <iostream>#include <map>using namespace std;int isLeap(int y) { if (y % 400 == 0 || (y % 100 != 0 && y % 4 == 0)) return 1; else return 0;}i...原创 2018-03-27 21:43:20 · 215 阅读 · 0 评论 -
213. 大牛们的午饭
#include <cstdio>#include <iostream>#define max 1000100#define MAX(x, y) (x) > (y) ? (x) : (y)#define For(i, m, n) for (i = m; i < n; ++i)using namespace std;int a[max], b[max]...转载 2018-03-28 15:48:39 · 414 阅读 · 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 · 465 阅读 · 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 · 209 阅读 · 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 · 218 阅读 · 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 · 250 阅读 · 0 评论 -
312. 汇编-计算机二2014
#include <iostream>#include <cstdio>#include <string>#include <cstdlib>#include <bitset> using namespace std;struct row { string opt; string a; string b;};unsi...原创 2018-03-16 14:42:17 · 184 阅读 · 0 评论 -
309. 中位数-计算机二2014
#include <iostream>#include <cstdio>#include <algorithm> #include <string>#include <sstream>using namespace std;int nums[100]; string int2string(int i) { stringst...原创 2018-03-16 15:09:25 · 278 阅读 · 0 评论 -
306. Python List-计算机一2014
#include <iostream>#include <cstdio>#include <string>#include <map>#include <vector>#include <algorithm>#include <cstdlib>using namespace std;map&原创 2018-03-16 16:54:08 · 275 阅读 · 0 评论 -
289. 最长连续等差子数列-软件14
#include <iostream>#include <cstdio>using namespace std;int nums[100];int main(int argc, char** argv) { int T; scanf("%d", &T); while (T--) { int N; scanf("%d", &N); ...原创 2018-03-18 18:47:48 · 613 阅读 · 0 评论 -
290. 最近公共祖先-软件14
#include <iostream>#include <cstdio>using namespace std;#define MAX 120int Tree[MAX];int LCA(int u, int v, int N) { int uF[MAX]; int vF[MAX]; for (int i = 1; i <= N; ++i) uF[i]...原创 2018-03-18 17:07:39 · 311 阅读 · 0 评论 -
291. 数据库检索-软件14
#include <iostream>#include <cstdio>#include <string>#include <cstdlib> #include <vector>#include <map>using namespace std;struct P { string name; int sex;...原创 2018-03-18 15:33:38 · 459 阅读 · 0 评论 -
299. 分数加法-网研14
#include <iostream>#include <cstdio>#include <cmath>using namespace std;int GCD(int a, int b) { return b == 0 ? a : GCD(b, a % b);}int main(int argc, char** argv) { int T; s...原创 2018-03-17 20:40:57 · 360 阅读 · 0 评论 -
302. 网络传输-网研14
#include <iostream>#include <cstdio>#include <climits>#include <vector>#include <algorithm>using namespace std;#define MAXPOINT 1010struct E { int next; int c;...原创 2018-03-17 20:22:51 · 413 阅读 · 0 评论 -
301. 进程管理-网研14
#include <iostream>#include <cstdio>#include <map>#include <vector>using namespace std;map<int, vector<int> > M;vector<int> chains[100];int proIdx = 0;原创 2018-03-17 15:15:44 · 312 阅读 · 0 评论 -
303. 众数-计算机一2014
#include <iostream>#include <cstdio>#include <map>#include <algorithm>#include <vector>using namespace std;map<int,int> M;bool cmp(const pair<int, int>原创 2018-03-16 22:59:48 · 284 阅读 · 0 评论 -
304. 旋转图像-计算机一2014
#include <iostream>#include <cstdio>using namespace std;char pic[50][50];char res[50][50];void rotate(char src[50][50], char dst[50][50], int srcRow, int srcCol) { for (int i = 0; i ...原创 2018-03-16 21:31:55 · 266 阅读 · 0 评论 -
305. 网络的核-计算机一2014
#include <iostream>#include <cstdio>#include <vector>#include <climits>using namespace std;int Mat[51][51];//int Mat[51][51][51];struct C { int idx; int cost;}CORE;/...原创 2018-03-16 20:34:11 · 212 阅读 · 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 · 219 阅读 · 0 评论