- 博客(55)
- 收藏
- 关注
RSS订阅原创 1111. Online Map
#include #define MaxVNum 500#define INF 10000void dj(int l[][MaxVNum],int t[][MaxVNum],int path[], int S,int dist[],int n,int time[]);void dj2(int t[][MaxVNum], int path[], int S, int time[], int
2017-02-28 17:11:06
541
原创 1119. Pre- and Post-order Traversals
#include typedef struct TreeNode { int left; int right;}TreeNode;int pre[30], post[30], in[30], IsUnique=1,flag=0;TreeNode t[30];void BuildTree(int PreBegin, int PreEnd, int PostBegin, int Post
2017-02-27 19:34:46
306
原创 1028. List Sorting
#include #include #include typedef struct stu { int id; char name[9]; int grade;}stu;int comp1(const void*a, const void*b);int comp2(const void*a, const void*b);int comp3(const void*a, co
2017-02-26 00:05:14
232
原创 1083. List Grades
#include #include typedef struct stu { char name[11]; char id[11]; int grade;}stu;int comp(const void *a, const void*b);int main(){ int n, i,grade1, grade2,flag=0; stu student[1000]; scanf
2017-02-25 23:16:41
229
原创 1042. Shuffling Machine
#include void ConvertPrint(int x);int main(){ int k, card[54], next[54],i,pos,times; scanf("%d", &k); for (i = 0; i < 54; i++) scanf("%d", &next[i]); for (i = 0; i < 54; i++) { pos = i;
2017-02-25 22:46:51
211
原创 1122. Hamiltonian Cycle
#include int main(){ int G[200][200],i,j,VertexNum,EdgeNum,v1,v2,k,SeqSize,IsHC,visited[200]; int seq[1000]; scanf("%d %d", &VertexNum, &EdgeNum); for (i = 0; i < VertexNum; i++) for (j = 0;
2017-02-25 21:59:23
245
原创 1121. Damn Single
#include #define MaxSize 100000typedef struct people { int partner; int IsGuset;}people;int main(){ int n,m,couple1,couple2,guest,cnt,single[MaxSize],i; people data[MaxSize]; for (i = 0; i <
2017-02-25 16:33:54
393
原创 1120. Friend Numbers
#include #include int GetID(int x);int comp(const void*a, const void *b);int main(){ int n, i, num,ID[10000],cnt=1; scanf("%d", &n); for (i = 0; i < n; i++) { scanf("%d", &num); ID[i] = Ge
2017-02-25 15:27:42
257
原创 1081. Rational Sum
#include #include #include /*能不能不用字符串转化为整数？*/typedef struct Number { long long integer; long long numerator; long long denominator;}Number;long long Convert(char num[], int begin, int end);N
2017-02-25 00:01:54
277
原创 1004. Counting Leaves
#include typedef struct node { int first; int next;}node;int main(){ node tree[100]; int n, m,i,ChildNum,ID, ParentID,LeavesNum=0; scanf("%d %d", &n, &m); for (i = 0; i <= n; i++) tree[i].
2017-02-24 17:11:59
191
原创 1090. Highest Price in Supply Chain
#include typedef struct tree { int first; int next;}tree;int main(){ tree t[100000]; int n, i, supplier, Q[100000], front = 0, rear = 0, x, first = 0, cnt = 1, last = 1,root,level_num=1; doub
2017-02-24 14:54:33
171
原创 1106. Lowest Price in Supply Chain
一开始犯蠢输出直接p*（1+r/100）*（1+r/100）居然还过了两个测试点拿了15分哈哈，机智地骗分~依旧乞丐版队列+乞丐版层次遍历。#include typedef struct tree { int first; int next;}tree;int main(){ tree t[100000]; int n, i, child_num, ID, Q[100000],
2017-02-23 23:10:27
188
原创 1118. Birds in Forest
#include int FindRoot(int Bird[],int bird);int main(){ int n, i, bird_num,first,bird,root,first_root,bird_sum=0,tree_sum=0; int Bird[10001]; for (i = 1; i <= 10000; i++) Bird[i] = 0; Bird[0]
2017-02-23 18:14:41
232
原创 1117. Eddington Number
希望都是这种题哈哈。#include #include int comp(const void*a, const void*b);int main(){ int n, i,data[100000],e,j; scanf("%d", &n); for (i = 0; i < n; i++) scanf("%d", &data[i]); qsort(data, n, sizeof(
2017-02-23 16:08:56
215
原创 1102. Invert a Binary Tree
好久没做树的题啦！#include #include typedef struct TreeNode{ int left; int right;}Node;typedef struct Queue { int data[100]; int front; int rear;}Queue;Node T[20];int cnt = 0,n;Queue Q;void Level
2017-02-22 22:21:58
222
原创 1105. Spiral Matrix
一开始居然怎么都想不到思路。#include #include #include #define MaxSize 100int comp(const void *a, const void *b);int main(){ int N,m,n,i,j,Matrix[MaxSize][MaxSize]; scanf("%d",&N); int *data = (int*)malloc
2017-02-22 19:08:00
208
原创 1097. Deduplication on a Linked List（测试点1）
L[100000]设为removed的头结点。#include #include typedef struct LinkList { int Key; int Next;}LinkList;int main(){ LinkList L[100001]; int Add, N, FirstAdd,check[10001],i,Removed; scanf("%d %d", &
2017-02-15 22:26:06
852
2
原创 1094. The Largest Generation
把上一题代码稍微改了一下。#include #include typedef struct EdgeNode { int ID; struct EdgeNode* next;}EdgeNode, *PEdgeNode;typedef struct VNode { int UserID; PEdgeNode FirstChild;}VNode;typedef int Posit
2017-02-13 23:30:00
203
原创 *1076. Forwards on Weibo
用C写真是吃力= =#include #include typedef struct EdgeNode { int UserID; struct EdgeNode* next;}EdgeNode,*PEdgeNode;typedef struct VNode { int UserID; PEdgeNode FirstForward;}VNode;typedef int P
2017-02-13 21:15:35
389
转载 C qsort函数
一、可以编写自己的sort函数。如下函数为将整型数组从小到大排序。void sort(int *a, int l)//a为数组地址，l为数组长度。{ int i, j; int v; //排序主体 for(i = 0; i < l - 1; i ++) for(j = i+1; j < l; j ++) {
2017-02-12 17:15:58
457
原创 1030. Travel Plan
#include #include #define MaxVNum 500#define INFINITY 100000typedef int Vertex;typedef struct MGraph { int Distance[MaxVNum][MaxVNum]; int Cost[MaxVNum][MaxVNum]; int VertexNum;}MGraph,*PMGr
2017-02-07 23:38:36
178
原创 1048. Find Coins
排序题。#include #include void HeapSort(int a[], int n);void HeapAdjust(int a[], int i, int n);int main(){ int n, m,i,j; scanf("%d %d", &n, &m); int *Coin = (int*)malloc(sizeof(int)*n); for (i =
2017-02-07 12:38:35
219
原创 1044. Shopping in Mars
#include #include #define INFINITY 100000int FindClosest(int a[],int m,int n,int e);/*e表示误差哈哈哈哈哈*//*i表示数列的的始端，若和大于给定值，，应放弃i开头的数列，始端向后移，否则尾端向后移*/int main(){ int n,m, i, e; scanf("%d %d", &n, &
2017-02-06 22:11:28
186
原创 1037. Magic Coupon
#include #include /*从两组数中各选出一个相乘，求和的最大值*/void HeapSort(int a[],int n);void HeapAdjust(int a[], int i, int n);int main(){ int ans=0, nc, np,i,j; scanf("%d", &nc); int *Coupon = (int*)malloc(s
2017-02-05 21:20:51
227
原创 1034. Head of a Gang（2、5）
两个测试点2、5过不去嘤嘤嘤先放着回头收拾你。#include #include #define MaxSize 17576typedef struct Set { int time; int root; int total_time;}Set;int FindLoc(char p[]);int FindSet(int loc,Set Gang[]);void Convert
2017-02-05 16:09:39
686
3
原创 *1033. To Fill or Not to Fill
不加target==n这个条件测试点1会出现超时=皿=没找到原因。很有价值的贪心题目！#include #define INFINITY 10000/*有时候不用加满油，只要加够向终点的油即可*/typedef struct Station { float price; float dist;}Station;Station GasS[501];int FindTarget(i
2017-02-04 16:31:17
379
原创 1031. Hello World for U
最近只能在这种简单题上找一找自信了……#include #include int main(){ char sentence[81]; int n1, len,i,j,space; scanf("%s", sentence); len = strlen(sentence); n1 = (len + 2) / 3; for (i = 0,j=len-1; i < n1-1; i+
2017-01-31 19:01:14
320
原创 1089. Insert or Merge
Merge函数写得乱了，听着鞭炮声敲代码= =#include #include int FindStep(int sorted[], int step,int n);void Merge(int sorted[], int step,int NextStep[],int n);int main(){ int n, i = 0, Isinsertion = 1, Pos; scan
2017-01-29 00:39:03
209
原创 1036. Boys vs Girls
#include #include typedef struct Grade { char Name[11]; char ID[11]; char Gender; int grade;}Grade;int main(){ int n,i,FemaleMax=-1,MaleMin=101,FNum,MNum; scanf("%d", &n); Grade *data =
2017-01-26 18:30:09
184
原创 1043. Is It a Binary Search Tree
这道题……没想到镜像BST和BST先序怎么转换，直接复制了一下函数。#include #include int IsBST(int Pre[],int begin,int end,int Post[],int PosBegin,int PosEnd);int IsMBST(int Pre[], int begin, int end, int Post[], int PosBegin, in
2017-01-25 22:47:50
202
原创 1101. Quick Sort
崩溃啊，第三个测试点格式错误，百度了一下简直拍桌子，没数据的时候要输出两个回车……= =考试的时候遇到这种情况我可能要画圈圈了……控诉一下win10，提交看结果的时候你就断网是不是跟爸爸过不去？？#include #include /*快速排序一趟使主元落在最终位置，因此就是排序好的*/int main(){ int n,i,cnt; scanf("%d", &n); long
2017-01-24 23:11:50
254
原创 1029. Median
一开始拼命想王道上一道题，好像那是两个序列大小相同的？用了一半的归并。#include #include /*4 1 5 6 83 2 4 8*/int main(){ long n1, n2,i,j,mid,cnt=0,num; scanf("%ld",&n1); long *seq1 = (long*)malloc(sizeof(long)*n1); for (i = 0
2017-01-24 16:12:23
152
原创 1051. Pop Sequence
这道题以前mooc上做过，记得是差几个测试点，死活AC不了。这次居然一次过了。要注意吃掉判断no之后的数据。思路是要么往pop栈顶元素，要么放入几个之后pop。#include #include int main(){ int m, n, i, k, num,flag,Pop,Top,Max; scanf("%d %d %d", &m, &n, &k); while (k--) {
2017-01-23 21:59:16
384
原创 1035. Password
#include int main(){ int n,i,j,flag,modified=0,m[2000]; char Password[2000][11]; scanf("%d",&n); for (i = 0; i < 2 * n; i++) { scanf("%s", Password[i]); m[i] = 0; } for (i = 1; i < 2 * n;
2017-01-23 16:26:36
163
原创 1024. Palindromic Number
#include #include int IsPalindromic(int num[],int len);int Add(int num[],int num2[], int len);int main(){ int k,len,i,step=0,num[111],reversed[111]; long long n; scanf("%lld %d", &n,&k); f
2017-01-20 14:15:34
230
原创 1040. Longest Symmetric String
我发现我越简单的题越容易出小错误= =希望考试的时候不要o(>﹏#include #include int main(){ char s[1001]; int i,j, longest = 1,len,length; gets_s(s); len = strlen(s); for (i = 0; s[i]!='\0'; i++) {/*到i时能找到的最大对称长度为2*max（le
2017-01-16 23:45:09
287
原创 1092. To Buy or Not to Buy
一开始以为A-Z之后就是a-z。#include #include int main(){ char wanted[1001], shop[1001]; int need[62],i,flag=0; scanf("%s %s", shop, wanted); for (i = 0; i < 62; i++) need[i] = 0; for (i = 0; wanted[i]
2017-01-16 20:24:36
154
原创 1069. The Black Hole of Numbers
#include #include /*递减减递增的*/int main(){ int num, i=0, x[5], y[5], large,small,ans=0,temp,j; scanf("%d",&num); while (ans != 6174) { for (i = 0; i < 4;i++) { temp = num % 10; num /= 10;
2017-01-15 23:21:47
356
原创 1073. Scientific Notation
这次写的有点乱= =#include #include int main(){ char Num[10000]; int i, end= 0,exp=0,zero,dot; scanf("%s", Num); while (Num[end] != '\0') end++; end--; i = end; while (Num[i-1]!= 'E') { exp +=(
2017-01-15 00:14:09
311
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人