Find the number which has the biggest mid-num

SUBMITTED BY: vanthong98

DATE: Nov. 5, 2016, 11:54 a.m.

UPDATED: Nov. 5, 2016, 11:58 a.m.

FORMAT: C++

SIZE: 440 Bytes

History Raw Download

HITS: 1264

Report
  1. #include<iostream>
  3. using namespace std;
  4. int m, n, max;
  6. int midnum(int n) {
  7. int a, b, c, m, x;
  8. a = log10(n);
  9. b = a % 2;
  10. c = a / 2;
  11. m = n;
  12. for (int i = 1; i <= c; i++)
  13. m /= 10;
  14. if (b == 1)
  15. x = m % 100;
  16. else
  17. x = m % 10;
  18. return x;
  19. }
  20. int main(){
  21. cin >> n;
  22. max = 0;
  23. for (int i=1;i<=n;i++)
  24. {
  25. cin >>m;
  26. if (midnum(m) > midnum(max)) max = m;
  27. }
  28. cout << max<<endl;
  29. system("pause");
  30. return 0;
  31. }
comments powered by Disqus