- 博客(25)
- 收藏
- 关注
RSS订阅原创 1067. Sort with Swap(0,*) (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#define swap(a, b) {int c = a; a = b; b = c;}const int N = 100000;int find(int arr[], int n);int k = 1;int main(void) { int
2016-10-31 13:07:05
356
原创 1066. Root of AVL Tree (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>struct node { int data, height; node *left, *right;};node *LL(node *A);node *RR(node *A);node *LR(node *A);node *RL(node
2016-10-31 12:07:50
367
原创 1064. Complete Binary Search Tree (30)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>void preorder(int arr[], int n, int result[], int index);int cmp(const void *v1, const void *v2);int main(void) { int n, i;
2016-10-31 10:43:15
278
原创 1063. Set Similarity (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <set>using namespace std;double common(set<int> &s1, set<int> &s2);int main(void) { int n, m, k, tmp1, tmp2, i, j;
2016-10-31 10:31:48
413
原创 1062. Talent and Virtue (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;const int N = 100000;struct people { char id[15]; int virtue, ta
2016-10-31 10:15:19
181
原创 1061. Dating (20)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <cstring>#include <cctype>#define N 100int main(void) { char days[7][7] = { "MON", "TUE","WED","THU","FRI","SAT","SU
2016-10-31 09:49:31
299
原创 1059. Prime Factors (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <cmath>#include <queue>#include <climits>#include <cstring>using namespace std;struct node { long long factor;
2016-10-30 17:04:14
345
原创 1056. Mice and Rice (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <algorithm>#include <vector>using namespace std;struct player { int index, w, rank;};bool comp1(player p1, player p
2016-10-30 11:11:14
511
原创 1055. The World's Richest (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>#define N 100000using namespace std;struct people { char name[15]; int age, net;};
2016-10-30 10:17:52
266
原创 1054. The Dominant Color (20)解题报告
方法一#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <map>#include <climits>using namespace std;int main(void) { map<int, int> mp; map<int, int>::iterator it;
2016-10-30 09:21:56
234
原创 1053. Path of Equal Weight (30)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <iostream>#include <vector>#include <cstring>#include <algorithm>#define swap(a, b){vector<int> tmp = a; a = b; b = tmp
2016-10-29 18:55:33
276
原创 1052. Linked List Sorting (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <iostream>#include <algorithm>#define N 100000using namespace std;struct node { int address, key, next;};int comp(n
2016-10-29 18:17:04
197
原创 1051. Pop Sequence (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <iostream>#include <stack>using namespace std;#define N 1100bool check(int a[], int n, int m);int main(void) { int
2016-10-29 17:50:56
268
原创 1050. String Subtraction (20)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <iostream>#include <cstring>#define N 11000int main(void) { bool h[300]; char str1[N], str2[N], str3[N]; fge
2016-10-29 17:36:59
301
原创 1048. Find Coins (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <iostream>#include <algorithm>#include <vector>#include <cstring>using namespace std;struct solution { int v1, v2;
2016-10-29 13:11:59
226
原创 1049. Counting Ones (30)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <iostream>#include <stack>using namespace std;int main(void) { long long matrix[12][10] = { {0} }; long long i, j,
2016-10-29 13:11:12
313
原创 1045. Favorite Color Stripe (30)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <iostream>int *arr1, *arr2, n, m;int LCS(void);int main(void) { int i, color; scanf("%d %d", &color, &n); arr1
2016-10-28 17:54:55
314
原创 1044. Shopping in Mars (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <vector>#include <climits>#include <algorithm>using namespace std;struct solution { int begin, end;};void find(vect
2016-10-28 17:16:25
311
原创 1044. Shopping in Mars (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <iostream>struct node { int data; struct node *left, *right, *parent;};node *rebuild1(int left1, int right1, int
2016-10-28 16:56:13
297
原创 1041. Be Unique (20)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <stdio.h>#include <stdlib.h>#define N 10010int main(void) { int *arr, *arr2, n, i, tmp; arr = (int *)calloc(N, sizeof(int)); scanf("%d", &n);
2016-10-28 15:23:01
283
原创 1036. Boys vs Girls (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <stdio.h>#include <stdlib.h>#include <stdbool.h>#include <string.h>#define N 15typedef struct { char name[N], gender[N], id[N]; int grade;} student
2016-10-23 18:07:51
334
原创 1035. Password (20)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <stdio.h>#include <stdlib.h>#include <string.h>#include <stdbool.h>#define N 15typedef struct { char name[N], password[N];} account;bool check(account *
2016-10-23 17:48:26
293
原创 1034. Head of a Gang (30)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <cstdio>#include <cstdlib>#include <map>#include <iostream>#include <string>#include <vector>#include <algorithm>using namespace std;#define N 3000struc
2016-10-23 17:26:25
227
原创 1033. To Fill or Not to Fill (25)解题报告
#define _CRT_SECURE_NO_WARNINGS#include <iostream>#include <cstdio>#include <cstdlib>#include <algorithm>#include <vector>#include <limits>#include <cfloat>#include <cmath>#define INF 1000000
2016-10-23 11:16:39
646
原创 1087. All Roads Lead to Rome (30)解题报告
代码#include <iostream>#include <cstdio>#include <cstdlib>#include <stack>#include <queue>#include <vector>#include <string>#include <functional>#include <map>#define N 220#define INF 1000000us
2016-10-21 12:53:58
676
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人