FREEstriker的博客

  感觉王岐上课讲的还行。  求最大公因数：#include <stdio.h>#include <stdlib.h>void GCD (int a, int b);int main(){ int a, b; scanf ("%d%d", &a, &b); GCD (a, b); return 0;}...

快排：#include <stdio.h>#include <stdlib.h>void qs (int l, int r);int A[10] = {0, 2, 5, 7, 5, 9, 3, 0, 8, 4};int main(){ qs (1, 9); int i; for (i = 1; i <= 9; i++) ...

N皇后：#include <stdio.h>#include <stdlib.h>#include <math.h>void findQueenPosition (int head);int isInTheRightPosition (int layer, int j);void exchange (int a, int b);void ou...

  他讲的这个prim是根据迪杰特斯拉算法改的，上学期数据结构我忘了自己写没写过prim了，他这种似乎更条理一些，我就写了个主要的函数：void update(){ for(i = 1; i <= lenA; i++) { if(A[i] != -1 && min > A[i]) { min...

#include <stdio.h>#include <stdlib.h>int n, c;int value[150], weight[150];int flag[150];int maxValue, curValue, curWeight;void inPut();void dfs(int i);int main(){ int i;...

#include <stdio.h>#include <stdlib.h>int n, c1, c2;int weight[150];int flag[150];int maxWeight, curWeight, weightSum;void inPut();void dfs(int i);int main(){ int i; ...

#include <stdio.h>#include <stdlib.h>int n, m;int p[1005];int find(int i);int main(){ int i; int a, b; scanf("%d%d", &n, &m); for(i = 0; i < n; i++)...

#include <stdio.h>#include <stdlib.h>struct e{ int i; int j; int len;};struct e edge[100005];int map[10000];int n, m;void qs (int l, int r, struct e A[]);int fin...