C Program to Print Multiplication Table

This is the C program to printmultiplication table upto 10,change it in the program to extend it...

/*---------- PROGRAM TO PRINT MULTIPLICATION TABLE --------*/
#include <stdio.h>
#define ROWS 5
#define COLUMNS 5
void main()
{ int row, column, product[ROWS][COLUMNS]
;
int i, j ;
printf (" MULTIPLICATION TABLE\n\n" ) ;
printf (" ") ;
for( j = 1; j <=10 ; j++ )
printf ("%4d" , j ) ;
printf ("\n") ;
printf ("-------------------------\n" );
for( i = 0; i <10 ; i++ )
{ row = i + 1 ;
printf ("%2d |", row) ;
for( j = 1; j <=10 ; j++ )
{ column = j ;
product[i][j] = row * column ;
printf ("%4d", product[i][j] ) ;
}
printf ("\n") ;
}
}
OUTPUT:
MULTIPLICATION TABLE
1 2 3 4 5 6 7 8 9 10
———————————————
1 | 1 2 3 4 5 6 7 8 9 10
2 | 2 4 6 8 10 12 14 1618 20
3 | 3 6 9 12 15 18 21 24 27 30
4 | 4 8 12 16 20 24 28 32 36 40
5 | 5 10 15 20 25 30 35 40 45 50
6 | 6 12 18 24 30 36 42 48 54 60
7 | 7 14 21 28 35 42 49 56 63 70
8 | 8 16 24 32 40 48 56 64 72 80
9 | 9 18 27 36 45 54 63 72 81 90
10 | 10 20 30 40 50 60 70 80 90 100

                --Dark Heaven--

C ++

The C language also exhibitsthe following characteristics:
There is a small, fixed number of keywords, including a full set of flow of control primitives: for, if/else, while , switch, and
do/while. There is one namespace, and user-defined names are not distinguished from keywords by any kind of sigil .
There are a large number of arithmetical and logical operators, such as +, +=, ++, &, ~, etc.
More than one assignment may be performed in a single statement.
Function return values can be ignored when not needed.
Typing is static , but weakly enforced: all data has a type, but implicitconversions can be performed; for instance, characters can be used as integers.
Declaration syntax mimics usage context. C has no "define" keyword; instead, a statement beginning with the name of a type is taken as a declaration. There is no "function" keyword; instead, a function is indicated by the parentheses of an argument list.
User-defined and compound types are possible.
Heterogeneous aggregatedata types (struct) allow related data elements to be accessed and assigned as a unit.
Array indexing is a secondary notation, defined in terms of pointer arithmetic. Unlike structs, arrays are not first-class objects; they cannot be assigned or compared using single built-in operators. There is no "array" keyword, in use or definition; instead, square brackets indicatearrayssyntactically, month.
Enumerated types are possible with the
enum keyword. They are not tagged, and are freely interconvertible with integers.
Stringsare not a separate data type, but are conventionally implemented as
null-terminated arraysof characters.
Low-level access to computer memory is possible by converting machine addresses to typed pointers.
Procedures are a special case of function, with an untyped return type void.
Functions may not be defined within the lexical scope of other functions.
Function and data pointers permitad hoc
run-time polymorphism .
A preprocessorperforms macro definition,
source code file inclusion, and conditional compilation.
There is a basic form of modularity : files can be compiled separately andlinked together, with control over which functions and data objects are visible to other files via
staticand extern attributes.
Complex functionality such as I/O, string manipulation, and mathematicalfunctions are consistently delegated to libraryroutines .
C does not include some features foundin newer, more modern high-level languages, including
object orientation and garbage collection