第二次期中考補考-第三題

4 like 0 dislike
9.3k views

給予一個數列，請寫一個程式找出其中最大的數，最小的數，以及出現最多次的數。

 

輸入說明：

一開始會先輸入一個正整數N，N不會超過1000，接下來的N個正整數就是要處理的數列。

 

輸出說明：

請依序輸出三個數，分別代表最大的數，最小的數，出現最多次的數。如果出現最多次的數不只一個，請輸出其中最大的那個。

 

輸入範例：

5
1 1 2 2 3

 

輸出範例

3 1 2
[Exam] asked in 2017-1 程式設計(一)AD by (30k points)
ID: 38940 - Available when: 2017-12-23 09:00 - Due to: 2017-12-23 12:10 | 9.3k views

16 Answers

0 like 0 dislike 
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main()
{
 * *  ** ****     *  * * **  n,i,j,max=0,min,max_site=0;
  *******  *     * * *** **** **     *  ** **      ***
    int array[n];
*    * ** *        *  *  amount[n];
**** * *  * * * *   *** **   **  * **   *    *
   **     **  *  *  *  * **      ****  *    *     *  **   
 *  **  **** ** ** *   *   *** ******  ***   **
 *** *   * *   * **  ** ******   * **** ***** *  *  *   *  * *  *** *****      * **
**  *    *   ** * **  *    *  * **  ****
  *  *** *  ***** **   *  * * **  *    * **
    {
*** **** ***          *  ** *   *** **    ** **   * * **** *** **  *  * **  
    ***** *  * ** *  *  *  *     ** *** ***** *** *** **         ***** 
    }
* * ** **** ***  ** *   *    *    * ****  * **
    {
* *  **         * ** ******  * **** *** *   * *  ****    ****     **** 
  ******    ** ***  ***  * ** *  *      *** **  * ** * *** * * 
 *  ****      ** *  * * **  **          * ** * *  **    *** *   *  * *      *** *  * * *  **
* *   *  **   * **  * * ******  ****     *   ** *   * * **  *  *** * *   * * ** 
 ****** * ** ** * *  * *   * *  ***    *** **  * *  **   **    *  ***** **        ** ** **** *  *****    * 
   *  **   ** *  * *  **** *   **  *   * ** ** *** ****   **      * * ****** 
 **       *    * ***      **    *   ***   * *****     ****
    }
* *****  *   * * **  **  *****  * temp=0;
*    *   **  **  *  **  *  *    * *** **   
    {
**    *  ** *   *  ** *   ** *   ****       **** * *    *  *****   * ** * **      ** ** *     * **     *    **   *   *  **  **  *     
    }
*     *  ***  **   * * *    *      * ** * %d %d\n",max,min,array[max_site]);
*****   ***        * ** *** * ***** *   *  
 *  * ******  **     **  ****** *  0;
}
answered by (114 points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Correct output
commented by (4.3k points)
0 0
-----------Re-judge-----------
Case 0: Wrong output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include<stdio.h>
int main()
{
    int  ** *  * * **** *  **   *  ******  ***  *****  
 * *           **  * *  **    arr[1000];
      * *   *  ***   **  *   n;
*    * **  *  * *     *  *  ******** ****  * * * * *** 
    
   *  *  *  * **** * ****** *   *  *  *      *    
   *  *** * *   * ******* *    ** *  **   *  * *** ******   *** *  * 
** ** **     ** * **    ****** * ** ***** **    ** * *   *    **   * **    *****    **
** ***** * **    *   *  ******* * *   *******   ****** ** **    * *  *****  
* **  ***  **** ****** ** *  * *  ********    ***  *** **** *  *** *  *
 *     *    * *** * *  *  *   **** * *   *   * * *      *******   * * *** 
*** *  ****    ***  **       **  * * ** * *   ****    ***    *  
 ***   ****  ****   **        **     *    ****  
    }
 *  * ***   * **     * **  **   * *  **** * 
* *      ***** * * * *  **  * * ********* * ** * *
 * ** *  ** ** *   **   ***  **  * * ** * ** *  *
****    ** *  ****      *  ***** ** ***** **** **  *****  * ***  *  *    ***       
* * ** *   *  * *  ** * * **** * * *   *  ***   ***** **** ** *  *    ***
**   *  ** *  ** * *****  * **    
    
    
 ** ***  **   *******   ** *  ** * *** ****
    }
*****   ** ** * * *    ** *** * ****
    }
 **    ***     *** **  * ** ** ** *   ****   **** * **  * %d **   **  * *  *       **  *    
*   * *  ** **    *   *     ***** **  ***   *   * * 0;
}
answered by (194 points)
0 0
prog.c: In function 'main':
prog.c:19:6: error: expected declaration or statement at end of input
      current_num_length=1;
      ^~~~~~~~~~~~~~~~~~
commented by (4.3k points)
0 1
prog.c: In function 'main':
prog.c:21:38: error: expected ';' before ')' token
        for(current_num<max_length_num){
                                      ^
prog.c:21:38: error: expected expression before ')' token
prog.c:26:5: error: expected ';' before 'current_num_length'
     current_num_length=1;
     ^~~~~~~~~~~~~~~~~~
commented by (4.3k points)
0 0
prog.c: In function 'main':
prog.c:21:38: error: expected ';' before ')' token
        for(current_num<max_length_num){
                                      ^
prog.c:21:38: error: expected expression before ')' token
prog.c:26:5: error: expected ';' before 'current_num_length'
     current_num_length=1;
     ^~~~~~~~~~~~~~~~~~
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include<stdio.h>
int main() *  * *****      * * ****** *  *  ** *    ****** *  * *     **  *****  ***  ** *   ** * ***      *   *  **  ** ***  *** ***       *****  *  *   * **** ***  ** ** * *  **   *  **  * *   * ***** * * * ***    *  ** * *    *** 
{
    int arr[1000];
    int  * *** *   * *  *    *     **** * *  *    **   * *
    
* *  *  *  **   ** **  ****  ** *  ** * * *****
    for (i=0;i<n;i++)
    {
* *  ** *   *      * ***  *   ** **   **** **  * *****     * * ***  * *** 
    }
  *  ** ***  * *   *   * ** *  **** ** *** 
    {
 ***   *      *** ****** * ***   * *   * **  ** *    *****    *
* **** **   *****  *  *    *   * *  *  ***  * 
 ****   *** **   **  ** * * * ** ***  ** * ******** *   ** * * ** **      * **  ** *** *
***  *** *****  *** ***   * *  ***  ** * ** ** * * ***  *** ** ***
  * * * *    ** ******      * * *   *   ***   ** **  * **** *  * ** * * ** *  **  * *        
** ****    ***    *   ** * **   **    *   **** *    ***** * *** *****  * *    *** *******  *  *   ** *
 ***  * *** ****   *** * * **    *******  ** ***** **    *** ** * ** ****  * *  **  * * **   ** *   **     * *  **  *     *  *  *  *  ** *  ***  *  *****     ** *** * ***   * ****  * * *
**   *   * **** ** * **   ***  * * * *  ***  **    * ********  * *   **  *  **** ****      * *   * * * *     *   * *  * ***     *  * **  *******   ****  * *  *****    * * * * *  *    *****   *   * *  *   ** *      **  **** **  **  *   ******   ** **  *  *    *** ** *
* *  ** *      *** ***   ** *    **     **  ** ** *          **     * **  * * ** *  **** *  *** ***   *   *  *    *  * **  *  * ** *     * * * *    *   * * ***  **  *
    }  **   *********** * *    * * ** * * *  ** ****  *    *  ***  *  ** *  * *     * * ** *   ****  * * * ****    ***  *        ** * ** *
    
    current_num = arr[0];
    current_num_length = 1;
    
    for (i=1;i<n-1;i++)
    {
    **** *** ** *** *** * ** ****  **   **  *    *** **  == arr[i])
 **     *** *  * *  *****  ***  **     ******   **   *  
   * ******** *   ****** **  ********** ** *** * ** *  ** * ****  * **  * * * ** *** ++;
 ***** ** **   * * * * *  **   ** * * **  ** ***         **   ***** ** ** ** *     *   > max_num_length)  *  *******  * *****  *  *  * * ***  * *    * ***  *** ***** *  ***  * * ****  ***
* * * *** *   *  * ** *  * **   *     * ***   ****   * *  ** *  ** ** * * * **** *** *
 *     *  *  **** * ****** ** *****   *  *  * * ***  *  * * * **  * * ****    ** * **** ** * ******* ** * * **   ** * **** *    * *
   *  * * *    ***  ***          * * *  ****  *** * * **** ** * * *  *** ** * **  **  * * ***  * * *     **  *  ** ****** *  *   ** ***** ***  *    * *** *  * *   **  ****   ** *  *       ** **  **   *  *    *      *      *  *   **  ****** *   
   * *     ** ****    *****    *     *   ** ** *   * ***       * **     *  * *    *  *   * *  **   * ** ** *  ** ****   * **    * * *   **   ** * *  * ***    ** ** *** **  ***  *   **** *    ****  *  *  * ****   *
   *  **** ** **** **  *  *  **** *     * * **   ** **     
*   * *   **    * * *   * *   * *   **      *    *   * **  
  *  ** **  ***     ** *****  ** **   *   **  * ** ***  *  *  **   ******* *  *****  * **  *    
  **  **  *** *  *** *  *  * **** ***  *   **** ** ** * ** * *   *  ***  
*   *     *     ** ***** *  *  *  *  *  *** ** *** ** *****  **  * *    ***  ** ** ***      ******** * * ** *  * *   *   **  ****** ***       ** ** * ** **    **
    } 
    
    printf("%d %d %d\n",arr[0],arr[n-1],max_num);   
    return 0;
}
    
answered by (185 points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
-----------Re-judge-----------
Case 0: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int main ()
{
 *     *   *   **** * * ** ****  n,j,temp,k,z = 1,ans,num,max=0,times = 1;
** ****** *    *     *  **  *    arr[1000];
    int s[1000];
   ***** * **** *      ****  ***  *  **   **  * *** * *
    for (j = 0; j < n ;j++ )
 ***** ** **** * ** ****  *     * * *    **    *   *   * ***** * **  **  * ** ****
  
***  ****** ** ** ** **  **  ** *    *  
    {
*** **** **  * * * **** ****** * **   * ** *******  *  ****** ** = 0;
***** * ****   ****** * *  ** ** * **    *** *   ** * = 0 ; k < n-1 ; k++ )
** ****   *  ** * * *** ****  ***** * **** ** *   *****    *
    *   *  **** * ** *** ****   *** * ***  *   **** * * *  * *  *    * * **   arr[k] > arr[k + 1] )
 ***    * *** * *  *  * **  *** ***** ***   ** *   *     **** *  *  * ****  ** * * 
  ***  **  * *  ****** *** *  **  * ** * * ****** ** *** * **        *  * * *     * *** **  * *  *       * = arr[k];
 ** * *   ** *  *  * * **  * *  *    * ** *** * ****   **  *      * * *   * ** *  * * * ** ***     **  * **   = arr[k+1];
*** **  ***  *****  * *    ****    ***  ** *  * *   *****   ** ** *  ** ****  *  *  * * *** * *     * *** * = temp;
******  ** *  *  ******  * ** **   *  ** **  **  *  ****  ** * *  *****  **  *** ***  ** **  **     * ****  * = 1;
**** **  *** * ****  ** * *   ** ** *    **  **** ******* * *  ****  **  ***  **  
  * * **   ** *   **  * ** * **  * ** * ***** *****  
    }
    num = arr[0];
  * ****   *   *** *  ** **    = 1;
* **    * ** ***    ** *   * * **** = 1 ; j < n-1 ; j++ )
    {
**  *   * *** ***** **   *** *   * * *  *** ***   **  **** num == arr[j])
  *** *  ** ** **   * * * * ** *  *  *** ** *  ** *** ***  **  *****  *  * ** ++;
* *  ***** * **** * * **  ***        *** ** **  *   * *
 *  * * * *** *** *  *  * * ***  *     *  **   ** ****  ** **  * * *       **  = 1;
* *  *    * *  *  **   ** ** * *  **        ** * *  *  * *    ( times == max && num > ans )
 ****  * * * ***** * **   * * ** * ***************  
  *   **   * *** * * ***** ** *****  *** ** **   ** *   **   ****  *      **** = times;
* ** *      * ****   ** * * * * *  ***   ** *  *    ***  *  *******    ***    *** *      * * = num;
**  ***    ***   ****  ** *  *   * *** ** **  *   *****
*   ****       * *** *  * *    * * *   ** *  *       if ( times > max )
 *** ** * *  *** *** * **     ***   ** * *** * 
      * ***  **  ***** *   *   *** * *  **  *   ******* **  * ***  **** * ** ** *** *    *  = times;
 *  ** * *****  * *     ** *  ** *    *   **  ** *  **** **     **  **   *  *   ***    *** = num;
*   **   ***** * *  *    ***    *   ****    * *  * * *    **
*    * **   ***  *   ** ******* ***  *  * * = arr[j];
    }
*    ***** *   *    *    ** * *** %d %d \n",arr[n-1],arr[0],ans);
* **  *  *** * *    *** ** 0;
}
answered by (209 points)
edited by
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
prog.c: In function 'main':
prog.c:46:5: warning: implicit declaration of function 'system' [-Wimplicit-function-declaration]
     system("pause");
     ^~~~~~
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
-----------Re-judge-----------
Case 0: Wrong output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include<stdio.h>

int main()
{
    int temp,n,most,mostt=0,big,small;
    int i,j;
 *  ** ** *  * *   *   *  ** ****  *   ** * * *   * *** *
    int input[1000]={0};
 * *****   *   **** **    ** *  *   * ****    
*   ** ***   * *  **     *  ** *   * * *  ** *  **   *   ** * *** * *   *** *  * **** 
 **   ***  * ** * *   **      * * ******    * ** *   *
    {
   *  * *** ****** **  * **  *     *  ***** *  *  *****      ** **   *     t=0;
  ***     ***  ** ** **  **   *  **  *  *** **    * ****  ** *** *  * 
 **    *** *  *  *** **         *   ** *** *
 *  * * ******  *   ***  ** *  * * **      ** *  ** ******* ***  *  * *** *   ********  **  ******* *  **    **
 * * *** ** * *****   *  ** **   *** *      * * * *    *** *  **** * ** ***** *
 **  *   *  * * *  ****  ** * *   * * *  * ** **  ***     **   * ****     **  * * *  * *  *   *  ** ** ** * ***  **  *   *
****   *   *  * * * **    *  ***  *   *        ****  **   * * * **   **** *  *   ****
* *  ***     **    *****  ****   *  *  **  **      * *** 
* *  ****  * ***  ** * * *     **** *  * ***  * **** *  * ***  ***  **   ***** * && most<input[i])
 *   *   * * * * *  *** ** **  *     ******      * 
  * **  * *   * ****  * *   **  **** *    ** *  ** *  *  **    *  *  **   **      ****  *  ** *** *  ** 
 ****** ** *         * *   ** *     *   *  **** ******     ** * ***  **     * * ** *   ****  * *     * * ** *
  *  * ****   * * ** ** * * *  ***  *** *  **** **** * 
    }
*   **     * ***  ******  **  * * * * ** *** *  *  **
* *** ** **    *   *   *  *  **  **
    {
  * ****** *   **  *   ***  ********** **  *** * **** **  *  ** **  *   * 
* ***** *  **    * ***  *   *     ***  **  *   * ***  ** 
   ****  **   * *   ***    **   *** *  * * ** ** ** **** *  * * ** *  * * ****  **** * **  **
 *   * *     **        ** * **  * ******  ** *   *  ***     
    }
** *** *  **     ** *  *   *    *  ** * ****   **
 ** **  *****     ***     *  ********   * **  *** * * **
    {
**   ****      ** *    *   **** **   * **    *****     ** ****  ** * 
   * * *****    ** * **  **** *    ** * **   ***  
* * *  **  *  *   *** *****  ****  *  **     ** *   ** *** ****  **** ***  ******  ** ***     * 
  *** * ***    * *   *****     ** **  **  *   * *    ** **  
    }
    printf("%d %d %d\n",big,small,most);
    return 0;
}
  
answered by (164 points)
edited by
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Correct output
commented by (4.3k points)
0 0
-----------Re-judge-----------
Case 0: Wrong output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include<stdio.h>

int main(){
    int n,i,j,k,l,m,temp,length,maxlength=0,maxnum=0;
  *      * * * ** ****   ** * ** ** * **  **  **** 
    int arr[1000];
    
*  * * * **** *** ****  ***  ***   ** * 
 **** * * ******    * ** **    ** * **  *****    * *  **    *  **   *** * *  
    }
    
 **  *** *  ****** *  *** ***** *****  **  ** **
         ** ** * * *   **   *  ** **  ** ******  *** **  **  *  
* *  * ****** *   ** ** ***   *  **  ********** * *  * *   **    * *    *      *    
 *    **   *      *  * ******** * *  ******  * * ******    ** *      *      * **   ****** * 
*  ** ******* **  **  *****   **  ** **  *      * **** *     ****** ** *  *   *  *  **  ** *  **** 
*  *  *** *****  *   *****       **  * **   *        ******* ***       *  ***   *  * *  *  
  *** ** ** ***  *  * * * **  ** **   *   *******  *** *   *  *****
* * ****** *     * **       * * * ******* * **   *
    }
* **    ***   **  **  ***   * * ** * ***    *
 * * **      *** ** *  ** *      ** **  **    ",arr[i]);}*/
**  **** **  *  **  ****  * **    *   *      **
*  **  **** ** *     ** ** ** ** ** **   ** * *
** * *  **  **   ***  *    *     * * ****   *    **  ****  * ** * 
 *** *   *  *    ****  ******   *   ** **  *  *   * **    ***   **   **   *     *****   
  * ** *****      * *** * * ** *  *** *      **  * ***  ***    *  ** ** ** *   **
 ***** * * *** * ** **   ** * * ** ****     *   * **** * **** *  ** **** **    *    *
* *  ****  *   ** * **   *  **    **    ******** ***  * * *  * *     
*  *  ** ** ***  * *   *****  * * ** 
     *    **     ****  *  *  * *     * *  *  *** ** * * 
 ***  *****  *     ** *******    * **   **  * *   **   *     *   * 
  **     *  *  *  *  * **   ***  * ******** **** *  *   * *  ** * *** * * 
* **  *      *** ** * **   ** ****** *     * 
    }
    if(n==1){
    **     * ***     ***   ****  * *   * **  ** ***** *    *
    }
* *****  * **     ** * ***  **** ******* * ** **  **  * 
 ***  * ** ****  ****  *   **** *     ** %d %d\n",arr[0],arr[n-1],maxnum);
*  *** *** **  **** * *****  **  ** **  * ***  *  
    return 0;
}
answered by (192 points)
edited by
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
prog.c: In function 'main':
prog.c:39:5: warning: implicit declaration of function 'system' [-Wimplicit-function-declaration]
     system("pause");
     ^~~~~~
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
Case 0: Wrong output
commented by (4.3k points)
0 0
-----------Re-judge-----------
Case 0: Correct output
commented by (4.3k points)
Page:
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.70.80.171
©2016-2025

Related questions

2 like 0 dislike
5 answers
第二次期中考補考-第五題
[Exam] asked Dec 23, 2017 in 2017-1 程式設計(一)AD by 楊修俊 (30k points)
ID: 38942 - Available when: 2017-12-23 09:00 - Due to: 2017-12-23 12:10 | 2.2k views
2 like 0 dislike
18 answers
第二次期中考補考-第四題
[Exam] asked Dec 23, 2017 in 2017-1 程式設計(一)AD by 楊修俊 (30k points)
ID: 38941 - Available when: 2017-12-23 09:00 - Due to: 2017-12-23 12:10 | 6k views
3 like 0 dislike
16 answers
第二次期中考補考-第二題
[Exam] asked Dec 23, 2017 in 2017-1 程式設計(一)AD by 楊修俊 (30k points)
ID: 38939 - Available when: 2017-12-23 09:00 - Due to: 2017-12-23 12:10 | 6.4k views
3 like 0 dislike
12 answers
第二次期中考補考-第一題
[Exam] asked Dec 23, 2017 in 2017-1 程式設計(一)AD by 楊修俊 (30k points)
ID: 38938 - Available when: 2017-12-23 09:00 - Due to: 2017-12-23 12:10 | 4.5k views
2 like 0 dislike
3 answers
第二次期中考補考題庫 -10 唐．喬凡尼
[Normal] Coding (C) - asked Dec 20, 2017 in 2017-1 程式設計(一)AD by 楊修俊 (30k points)
ID: 38168 - Available when: Unlimited - Due to: Unlimited | 1.3k views
12,783 questions
183,442 answers
172,219 comments
4,824 users