int A[6];
X = [1 3 5 7 9 11]
for ( k=0; k<6; k++ ) { ... }
X = [12 9 6 3 0 -3]
X = [0 3 4 7 8 11]
X = [1 2 4 8 16 32]
X[0] = 1; for ( k=1; k<6; k++ ) { ... }
for ( k=0; k<N; k++ ) printf ( "%d\n", ... );
k = 0; while ( k < N ) { printf ( "%d ", A[k] ); ... }
S = 0; for ( k=0 k<N; k++ ) { ... }
S = 0; for ( k=0; k<N; k++ ) if ( . . . ) S = S + X[k];
S = 0; for ( j=0; j<N; j++ ) if ( ... ) S++;