【HDOJ】2103 Family planning

题目挺有意思。虽然不是很难。

 #include <stdio.h>

 int main() {
     unsigned int m, n, case_n;
     unsigned int i, j, k, tmp, one=;

     scanf("%u", &case_n);

     while (case_n--) {
         scanf("%u %u", &m, &n);
         k = j = ;
         for (i=; i<=n; ++i) {
             scanf("%u", &tmp);
             if (tmp && !j)
                 j = i;
         }
         if ( (m==n) && (j== || j==n) ) {
                 printf("0 RMB\n");
                 continue;
         }
         if (j && j<n)
             tmp = (one<<(n-j))-;
         else
             tmp = ;
         if (m<n)
             k = (one<<(n-m))-;
         else
             k = ;
         tmp = (tmp>k) ? tmp:k;
         if (tmp)
             printf("%u0000 RMB\n", tmp);
         else
             printf("0 RMB\n");
     }

     return ;
 }