9 degrees 1057 Mode

[Cpp]/********************************* Date: * Author: SJF0115 * question: 9 degrees 1057 * questions: Mode * Source: http://ac.jobdu.com/problem.php? Pid = 1057 * result: AC * Meaning: * conclusion: * *********************************/# include <stdio. h> # include <stdlib. h> typedef struct Data {int count; // int number of occurrences; // weight} Data; // sort int cmp (const void * a, const void * B) {struct Data * c = (Data *) a; struct Data * d = (Data *) B; if (c-> count! = D-> count) return d-> count-c-> count; else if (c-> number! = D-> number) {return c-> number-d-> number ;}} int main () {int number, I; // freopen ("C: \ Users \ SJF \ Desktop \ acm.txt "," r ", stdin); while (scanf (" % d ", & number )! = EOF) {Data data [11]; // initialize for (I = 0; I <11; I ++) {data [I]. count = 0; data [I]. number = I;} data [number]. count ++; for (I = 0; I <19; I ++) {scanf ("% d", & number); data [number]. count ++;} qsort (data, 11, sizeof (data [0]), cmp); printf ("% d \ n", data [0]. number);} return 0 ;} /*************************************** * *********************** Problem: 1057 User: sjf0115 Language: C ++ Result: Accepted Time: 10 MS Memor Y: 1012 kb ************************************** **************************//************ * ********************** Date: * Author: SJF0115 * question: 9 degrees 1057 * questions: Mode * Source: http://ac.jobdu.com/problem.php? Pid = 1057 * result: AC * Meaning: * conclusion: * *********************************/# include <stdio. h> # include <stdlib. h> typedef struct Data {int count; // int number of occurrences; // weight} Data; // sort int cmp (const void * a, const void * B) {struct Data * c = (Data *) a; struct Data * d = (Data *) B; if (c-> count! = D-> count) return d-> count-c-> count; else if (c-> number! = D-> number) {return c-> number-d-> number ;}} int main () {int number, I; // freopen ("C: \ Users \ SJF \ Desktop \ acm.txt "," r ", stdin); while (scanf (" % d ", & number )! = EOF) {Data data [11]; // initialize for (I = 0; I <11; I ++) {data [I]. count = 0; data [I]. number = I;} data [number]. count ++; for (I = 0; I <19; I ++) {scanf ("% d", & number); data [number]. count ++;} qsort (data, 11, sizeof (data [0]), cmp); printf ("% d \ n", data [0]. number);} return 0 ;} /*************************************** * *********************** Problem: 1057 User: sjf0115 Language: C ++ Result: Accepted Time: 10 MS Memory: 1012 kb ************************************** * ************************/[cpp]/********* * ************************* Date: * Author: SJF0115 * question: 9 degrees 1057 * questions: Mode * Source: http://ac.jobdu.com/problem.php? Pid = 1057 * result: AC * Meaning: * conclusion: * *********************************/# include <stdio. h> # include <stdlib. h> int main () {int Mode, number, I; // freopen ("C: \ Users \ SJF \ Desktop \ acm.txt", "r ", stdin); while (scanf ("% d", & number )! = EOF) {int count [11] = {0}; int Max =-1; count [number] ++; for (I = 0; I <19; I ++) {scanf ("% d", & number); count [number] ++ ;}for (I = 1; I <11; I ++) {if (count [I]> Max) {Max = count [I]; Mode = I ;}} printf ("% d \ n", Mode );} return 0 ;} /*************************************** * *********************** Problem: 1057 User: sjf0115 Language: C ++ Result: Accepted Time: 10 MS Memory: 1012 kb *************************************