while(c!='\0') {
     c = nextc();
     if( c=' ' ) count++;
 }

int a = get_first();
while (a != 0);
{
    a = get_next();
}

int i, c, a[256];

for(c=0; c<256; c++) {
  a[c] = c;
}

for(i=0; i<256; i++ ) {
  printf("%d\n", a[c]);
}

if (condition == 1) return 1; else return 0;

typedef int * pointer;
typedef int   nopointer;
typedef struct dinam_stack {
    pointer data;
    nopointer rsize; // real size
    nopointer fsize; // formal size
    nopointer initial_size;
    nopointer increment;

} stack;

do { num = read(); } while (num<1 || num>1000);
arr = (double *)malloc((num-1)*sizeof(float));
for (i=0; i<num; i++) { arr[i] = readarr(i); }

Rational a, b, c = ...;
rat_add(&a, &b, &c);
assert( 1/2 == c.numer / c.denom);

#include <stdio.h>
typedef struct tPoint {
    double x;
    double y;
} Point;
int main() {
    Point p = { 37, 42 };
    printf("(%g, %g)\n", p); // prints "(37, 42)"
    return 0;
}