How to count how many times the largest number appear

[Snip]

The user input some numbers and i have to count how many times the largest number that he puts appears. I know how to get the largest, but how to count how many times it appear?

im a beginner in programminng.

When I was trying I did this code:

#include <stdio.h>
#include <stdlib.h>
int main(){
 
int i,j=0;
float n,s,w;
 
for(i=1;i<=5;i++){
                  printf("Primeiro valor: ");
                  scanf("%f",&n);
                  if(i==1) s = n;
                  if(i==1) w = n;
                  if(n>s){ s=n; j++; printf("%d\n",j); }
                  if(n<w) { w=n;  }
                  if(n<s && n>w) { }
                  }
 
 
 
printf("\n%d\n",5-j);
printf("MAX: %f, MIN: %f\n\n",s,w);
 
 
system("pause");
 
}
 

In fact I just need the idea of how do I do that.

[weaknessforcats]

Maybe every time you use printf on it you could increment a counter.

[Snip]

But i will just know what is the largest after the loop, can u give me an example?

[weaknessforcats]

You have s as your largest number. When you define s, set a to zero.

Inside the loop after the scanf compare n to s. If n>a, then n is your new largest number to set s to n.

You don't need to know which iteration of the loop your are on because every time the user enters a number and n <s you set s to the n.

Unfortunately, in this code you only see the value the user currently entered. The previous values are lost as the variable n is reused. Further, you don't know which value is the largest until all the values have been entered.

You might consider have the user enter the values and have your loop store the values in an array. After the loop ends, the array has all the values entered and you can now process the array. Usng a loop like to have already, you can find the largest number in the array. Once you know that, you can process the array in another loop to see how many array elements ae equal to the largest number.

[donbock]

Line 13: here you check if the latest number is the new maximum. Suppose the new number is not a new maximum, but instead is another copy of the old maximum. If that is the case, then increment a counter. Should you find a new maximum, then you want to reset that counter (because you no longer care how many times you saw the old maximum value).

[Frinavale]

I really like @weaknessforcats response.

If you store what the user enters into an array you can keep track of how many times a user enters something by checking the value at the index of the number they enter.

However, it would be really sweet if you took it one step further and implemented a Hash Table that stored the number entered as a Key and the number of times it was entered as the Value!

Try @weaknessforcats' recommendation first because it is a lot easier to understand than using structures etc.

-Frinny