caljim

#include<stdio.h>
#include<stdlib.h>


struct element {
  struct element *next;
  unsigned char val;
};

struct element ot = {NULL,NULL};

caljim

#include<stdio.h>
#include<stdlib.h>
#include<time.h>

char hand[][10] = {"剪刀", "石头", "布"};

int main()
{
  int computer, player, ret;
  srand(time(NULL));

caljim

#include<stdio.h>
#include<stdlib.h>

void combine(int src[], int s, int e, int k, int take[], int p)
{
  

  if(k == e - s + 1) {
    
    for(int i = 0; i < p; i++)

caljim

#include "stdio.h"

#ifndef MAXNUM
#define MAXNUM 100
#endif

void divide(int needle[], int from, int end)
{
    int num = end - from;

caljim

#include "insert_sort.h"

Node* find_node(int value)
{
    Node *start = &root;

	while(start->after != NULL) {
		if(start->value == value)
			return start;
		else

caljim

#执行的方法
#./a.out 中国国家人民政府 人民
#输出
#
#[CONSOLE:] 中国国家人民政府
#                 △
#                 ↑表示此处匹配
#
#

caljim

#include "trident.h"

int main(void)
{
  ROOT = create_node(' ',YES);
  printf("ROOT addr:%X\n",ROOT);
  char* a = "he";
  insert_node(a,ROOT);
  insert_node("你好",ROOT);
  insert_node("中国",ROOT);

caljim

form distutils.core import setup, Extension

module1 = Extension('foo',
                    sources = ['foo.c','hash_64a.c'])

setup (name = 'foo',
       version = '0.1.3',
       description = '',
       classifiers=[
        "Programming Language :: Python",],