RT

卧槽！

#include <stdio.h> #include <stdlib.h> #include <assert.h> #define MAX_TEST_ITEMS 100000 typedef struct node Node; struct node{     int num;     Node* left;     Node* right; }; int size(Node *node); Node *newNode(int data); void printTree(Node *node); Node *insertnode(Node*node, int data); void heapInsert (int items[], int heapSize, int maxItems, int item); void heapDeleteRoot (int items[], int heapSize); // Implement the functions //void insert (int items[], int numItems, int maxItems, int item); //void deleteMin (int items[], int

#include<stdio.h> #include<string.h> #include<stdlib.h> #include<assert.h> #include<math.h> #include "BigNumber.h" #define MAX 30 typedef struct point *POINT; struct bigNumber{     POINT head; }; struct point{     unsigned long long array[MAX]; }; // create a new bignumber representation of initialValue BigNumber newNumber (unsigned long long initialValue){     int counter=MAX-1;     int counter2=MAX-1;     assert(initialValue>=0);     BigNumber new;   

void showNetwork (SortNetwork doomed){     Link temp;     temp = doomed->head;     int size = doomed->size;     int index = 0;         for(index=0;index<size;index++){        printf(" %d",index);     }     printf("\n");     while(temp){        for(index=0;index<size;index++){           if(index==temp->from||index==temp->

#include<stdio.h> #include<string.h> #include<ctype.h> #include<stdlib.h> #include<assert.h> #define MAX 30 #define MAXSIZE 1000 #define LIMIT 16 #define TRUE 1 int main(void) {    char bid[MAXSIZE][MAX], tmp[MAX], lowest[MAX];    int mode = 2, unique = 1, done = 0;    int firstrun = 1;    int i = 0, j = 0;    int len, same;       while (fgets(bid[i],MAX,stdin) != NULL) {      assert(i < MAXSIZE);      if (atoi(bid[i]) != 0) {     &n

#include <stdio.h> #include <stdlib.h> #include <assert.h> #include <math.h> #include "BigNumber.h"    int main (void) {     BigNumber n        = newNumber (3);     BigNumber sum0toN = newNumber (3);     show(n);     show(sum0toN); //    int counter=1;     printf("check pt 1 creat new\n");     assert(n!=NULL);     assert(equals(n, sum0toN)==1);    printf("before increm

#include<stdio.h> #include<string.h> #include<stdlib.h> #include<assert.h> #include<math.h> #include "BigNumber.h" typedef struct point *POINT; struct bigNumber{     POINT head; }; struct point{     unsigned long long array[30]; }; // create a new bignumber representation of initialValue BigNumber newNumber (unsigned long long initialValue){     int counter=30;     int counter2=30;     assert(initialValue>=0);     BigNumber new;     new=(BigNumber)

/* *   Directory.h *   Directory * *   Created by Richard Buckland on 23/08/09. *   Copyright 2009. All rights reserved. * */ #include <string.h> #include <stdio.h> #include <stdlib.h> #include "Directory.h" typedef struct node *Node; struct node {     char name[30];     char listing[30];     Node next; }; struct directory {     int maxSize;     int size;     Node head; }; // create a directory w

#include <string.h> #include <stdio.h> #include <stdlib.h> #include <assert.h> #include "Directory.h" int main(){     entry one;     entry two;     entry three;     char *hitler = "hitler";     char *himmler = "himmler";     char *goering = "goering";     char *churchill = "churchill";     char *stalin = "stalin";     one.name = "hitler";  &

/* *   Directory.h *   Directory * *   Created by Richard Buckland on 23/08/09. *   Copyright 2009. All rights reserved. * */ #include <string.h> #include <stdio.h> #include <stdlib.h> #include "Directory.h" typedef struct node *Node; struct node {     char name[30];     char listing[30];     Node next; }; struct directory {     int maxSize;     int size;     Node head; }; // create a directory w

void showNetwork (SortNetwork doomed){     Link temp;     temp = doomed->head;     int size = doomed->size;     int index = 0;     for(index=0;index<size;index++){        printf(" %d",index);     }     printf("\n");     while(temp){        for(index=0;index<size;index++){           if(index==temp->from||index==temp->

#define FALSE 0 #define TRUE 1 typedef struct stack *Stack; Stack newStack (void); void pop (Stack stack); void push (Stack stack, int value); int top (Stack stack); // should return TRUE or FALSE int isEmpty (Stack stack);

#include <stdlib.h> #include <stdio.h> #include <assert.h> #include "Stack.h" int main(){     Stack stack1;     stack1 = newStack();    // stack1->value = 4;     push (stack1, 3);    // printf("test 1 passed\n");     push (stack1, 5);    // printf("test 1 passed\n");     assert(top(stack1) == 5);     printf("test 1 passed\n");     pop (stack1);     assert(to

#define FALSE 0 #define TRUE 1 #include <stdlib.h> #include <stdio.h> #include <string.h> #include <assert.h> #include "Stack.h" //typedef struct stack *Stack; typedef struct node *Node; struct node { int value; Node next; }; struct stack { //int size; Node head; }; Stack newStack (void){     Stack new;     new = malloc(sizeof(struct stack));     new->head = NULL;    // new->size = 0;     return new; } void pop (Stack stack){     as

#define FALSE 0 #define TRUE 1 #include <stdlib.h> #include <stdio.h> #include <string.h> #include <assert.h> typedef struct stack *Stack; struct stack { int value; Stack next; }; Stack newStack (void){     Stack new;     new = malloc(sizeof(struct stack));     return new; }    void pop (Stack stack){     assert(stack!=NULL);     Stack temp;     temp = stack->next;     free(stack);     stack = temp; }     void push (Stack st

火星游客...

http://tieba.baidu.com/f?ct=&tn=&rn=&pn=&lm=&cm=0&kw=%B8%DF%B4%Es5=&sn=&rs6=&myselectvalue=0&word=%B8%DF%B4%EF00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000&submit=%B0%D9%B6%C8%D2%BB%CF%C2&tb=on

囧

http://tieba.baidu.com/f?kz=341483005

我还以为00吧被暴了呢!!!

/......我囧了o(╯□╰)o

BD

http://tieba.baidu.com/f?ct=&tn=&rn=&pn=&lm=&sc=&kw=%B8%DF%B4%EF000000000000000000000000000000000000000000000000000000000000000000000000000&rs2=0&myselectvalue=1&word=%B8%DF%B4%EF000000000000000000000000000000000000000000000000000000000000000000000000000&submit=%B0%D9%B6%C8%D2%BB%CF%C2&tb=on

兰州烧饼

卧槽

我是会员了 - -`1

呵呵........

4个蛋!-0-

太NB了,庆祝一下!

不知道0000吧是否存在~

我的百度资料里 加入的圈子 是这么显示的!

.