SeedCoder2014热身题目1 -- 解答

#include <stdio.h>

int n;

int mostValueableNumber(int minNum, int maxNum)
{
 int ans = maxNum;
 int b = 0;
 for(int i = maxNum; i >= minNum; --i)
 {
  int tmp = i;
  int cnt = 0;
  while(tmp > 0)
  {
   if(tmp % 10 != 9)
    break;
   ++cnt;
   tmp /= 10;
  }
  if(b < cnt)
  {
   ans = i;
   b = cnt;
  }
 }
 return ans;
}

int main()
{
 int a,b;
 scanf("%d",&n);
 for(int i = 0; i < n; ++i)
 {
  scanf("%d %d",&a,&b);
  printf("%d\n",mostValueableNumber(a,b));
 }
 return 0;
}