- 博客(12)
- 收藏
- 关注
RSS订阅原创 poj3349
#include#include#includetypedef struct Node{int anxis[6];struct Node *next;}Node;void addNode(Node *data[10000],Node *to_add,int *flag);void cmp(Node *head,Node *to_add,int *
2015-04-26 15:11:53
239
原创 poj3274
#include#include#include#define prime 9773typedef struct A{int index;struct A *next;}A;int distance = 0;int map[100001][30]={0};A *Hash[prime] = {0};//K为牛特点的个数
2015-04-26 15:09:10
237
原创 poj2388
#includevoid quickSort(int *A,int start,int end);void quickSort(int *A,int start,int end){int i = start;int j = end;int temp = A[i];if(i{while(i {while(ij--;if(i
2015-04-26 15:05:10
180
原创 poj2299
#includevoid quickSort(int *A,int start,int end,int *step);void quickSort(int *A,int start,int end,int *step){int i = start;int j = end;int temp = A[start];if(i{while(i{while
2015-04-26 15:03:47
171
原创 poj2002
#include#include#includetypedef struct Node{short x;short y;struct Node *next;}Node;Node *Hash[57][57] = {0};void addNode(Node n);int nodeValid(Node n);int node
2015-04-26 15:01:38
173
原创 poj1840
#include#include#includeint count = 0;char map[37500001];int main(void){int cmp;int base[101];//xi不等于0,不为0的解决方案int cf[5];int i,j,k;memset(map,0,sizeof(char) * 37500001);
2015-04-26 14:59:45
170
原创 poj1753FlipGame
#include#include#include#define MAX 65536typedef struct queue{int head;int tail;int data[MAX];}queue;char flag[MAX+1] = {0};void setNumber(int *number,int i,int
2015-04-26 14:58:21
172
原创 poj1035
#include#includevoid proccess(char lib[][16],char toCheck[][16],int *libLen,int *toCheckLen);int CmpString(int type,char check[],char lib[],int *answerCount,int *answerIndex,int _j);vo
2015-04-26 14:55:21
230
原创 循环单向链表
/**循环单项链表*/#ifndef LINKSCLIST_H_#define LINKSCLIST_H_#include#include#include#include"head.h"typedef int ElemType;typedef struct Node{ElemType data;struct Node *ne
2015-04-26 14:47:10
148
原创 数列栈
#ifndef _STACK_H_#define _STACK_H_#include#define TRUE 1#define FALSE 0typedef unsigned int boolean;typedef struct STACK{USER_TYPE *data;// 指向堆栈空间的指针，以后将其看做数组int stackM
2015-04-26 14:45:03
325
原创 stack栈
#ifndef _ARRAYSTACK_H_#define _ARRAYSTACK_H_#include#include#includetypedef struct USER_TYPE{int age;int clas;char *name;double weight;} USER_TYPE;/***元素类型:USER_T
2015-04-26 14:41:12
130
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人