Question 14: Number of dominant values.

 

[Plain]
/* Start the comments in the program header (to avoid any problems encountered during the submission of blog posts, the slash used to indicate that the comments have been deleted)
* Copyright and version Declaration of the program
* All rights reserved.
* File name: txt. c
* Author: liuyongshui
* Completion date: January 1, April 24, 2013
* Version No.: V1.0
*/
 
# Include <stdio. h>
 
Int main ()
{
Int I;
Int j;
Int cout = 0;
Int num [] = {1, 3, 5, 7, 9}; // num [] instead of f []
Int cou [] = {2, 3, 4, 7, 8}; // cou [] instead of g []
 
For (I = 0; I <5; I ++)
{
For (j = 0; j <5; j ++)
{
If (num [j]> cou [I])
{
Cout ++;
}
}
}
Printf ("array num [] is % d \ n", cout) larger than the array cou );
 
Return 0;
}

/* Start the comments in the program header (to avoid any problems encountered during the submission of blog posts, the slash used to indicate that the comments have been deleted)
* Copyright and version Declaration of the program
* All rights reserved.
* File name: txt. c
* Author: liuyongshui
* Completion date: January 1, April 24, 2013
* Version No.: V1.0
*/

# Include <stdio. h>

Int main ()
{
Int I;
Int j;
Int cout = 0;
Int num [] = {1, 3, 5, 7, 9}; // num [] instead of f []
Int cou [] = {2, 3, 4, 7, 8}; // cou [] instead of g []

For (I = 0; I <5; I ++)
{
For (j = 0; j <5; j ++)
{
If (num [j]> cou [I])
{
Cout ++;
}
}
}
Printf ("array num [] is % d \ n", cout) larger than the array cou );

Return 0;
}