fork download
copy 
  1. #include <stdio.h>
  2.  
  3. void saidai_num(int kosuu, int data[], int *max, int *max_num);
  4.  
  5. int main(void) {
  6. 	int kosuu1 = 6;
  7. 	int data1[] = {10,15,30,15,30,30,7};
  8. 	int max1 = 0;
  9. 	int max_num1 = 0;
  10.  
  11. 	int kosuu2 = 5;
  12. 	int data2[] = {10,10,10,10,10,10};
  13. 	int max2 = 0;
  14. 	int max_num2 = 0;
  15.  
  16. 	saidai_num(kosuu1,data1,&max1,&max_num1);
  17. 	saidai_num(kosuu2,data2,&max2,&max_num2);
  18.  
  19. 	printf("配列１の最大値： %d ,個数： %d \n",max1,max_num1);
  20. 	printf("配列２の最大値： %d ,個数： %d \n",max2,max_num2);
  21.  
  22. 	return 0;
  23. }
  24. void saidai_num(int kosuu, int data[], int *max, int *max_num){
  25. 	int counter = 0;
  26. 	int count = 1;
  27. 	*max = data[0];
  28.  
  29. 	for(counter = 0; counter<kosuu; counter++){
  30. 		if(data[counter] > *max){
  31. 			*max = data[counter];
  32. 			count = 1;
  33. 		}else if (data[counter] == *max){
  34. 			count ++;
  35. 		}
  36.  
  37. 	}
  38. 	*max_num = count;
  39. }
  40.  
Success #stdin #stdout 0s 5324KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
配列１の最大値： 30 ,個数： 3 
配列２の最大値： 10 ,個数： 6
https://ideone.com/4IKR5c
language:
C (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!