ch07s003.c

稀疏矩阵、链表、图、队列、二叉树、多叉树、排序、遗传算法等的实现

#include <stdio.h>
#include <string.h>

int main(void)
{
  size_t len = 0;
  char buffer[1024] = {0};
  if(fgets(buffer, sizeof buffer, stdin) != NULL)
  {
    len = strlen(buffer);
    printf("The input string is %u bytes long.\n",
           (unsigned)len);
  }

  return 0;
}