$B=i5i#C8@8l#Q!u#A(B

    printf("hello world!\n"); // $B$*7h$^$j$NJ86g(B

   /* i = 1;
   /* i = foo(i); */

    static int
    foo(void)
    {
        ...
    }

    #define begin {
    #define end }

    a = 1, b = 2, c = 3;

    int a[10];
    int i = 0;

    while (i < 10)
        a[i] = i++;

    int a[10];
    int i = 0;

    while (i < 10)
        a[i] = i++;

    int i = 3;

    i = i++;

    kcode = getchar() + getchar() << 8;

    i = (c >= 0x81 && c <= 0x9f) || (c >= 0xe0 && c <= 0xfc) /* (1) */
    i = c >= 0x81 && (c <= 0x9f || (c >= 0xe0 && c <= 0xfc)) /* (2) */

    #if (sizeof(int) == 2)
        ...
    #else
        ...
    #endif

  #define swap(a, b) (a ^= b, b ^= a, a ^= b)

  #define swap(a, b) (a ^= b ^= a ^= b)

    if (isspace(c = *s++) == 0)
        putchar(c);

#include <stdio.h>

int main(void)
{
    char s[14] = "hello, world!";

    printf("%s\n", s);
    return 0;
}

struct foo {
    char c1;
    char c2;
};

typedef struct {
    LIST *next;
    char *body;
} LIST;

    if ((c1 = getchar()) & (c2 = getchar()) & 0x80) {
        /* EUC$B4A;z%3!<%I$N=hM}(B */
    }

    printf("a = %d\n", a);
    a << 3;
    printf("a = %d\n", a);

    /* A */
    c = getc(fp);
    c += getc(fp) * 256;

    /* B */
    c = getc(fp);
    c += getc(fp) << 8;

void str_check(char *s1, char *s2)
{
    if (s1 == s2) {
        printf("$BJ8;zNs$,0lCW$7$^$7$?(B\n");
}

    char *str[];

    qsort(str_array, 100, sizeof(char *), strcmp);

struct area window = {0, 0, 1023, 767,};

struct array {
    int item[10];
};

/* $BM?$($i$l$?(Bint$B$NCf$N(B1$B$G$"$k%S%C%H$N?t$rJV$9!#(B
 * $B:G>e0L(B2$B%S%C%H$OMxMQ$G$-$J$$(B
 */
int numofbits(int bits)
{
    int num;

    num = (bits >> 1) & 03333333333;
    num = bits - num - ((num >> 1) & 03333333333);
    num = ((num + (num >> 3)) & 0707070707) % 077;
    return num;
}

int numofbits(long bits)
{
    bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
    bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
    bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
    bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
    return (bits & 0x0000ffff) + (bits >>16 & 0x0000ffff);
}

#define is_kanji1st(c) ((unsigned int) (c ^ 0x20) - 0xa1 < 0x3c)

    len = strlen(s);
    buf = malloc(len);
    strcpy(buf, s);

    /* 1 */
    len = strlen(s);
    buf = malloc(len + 1);

    /* 2 */
    len = strlen(s) + 1;
    buf = malloc(len);

  int *array;

  array = (int *) malloc(sizeof(int) * 16);

int main(argc, argv)
int argc;
char *argv[];
{
    ....

   Warning test.c 22: Call to function 'printf' with no prototype
   in function main