HDU 2103 Family planning

#include <bits/stdc++.h>
using namespace std;

int a[50];

int main() {
    int T;
    scanf("%d", &T);
    for(int i = 1; i <= T; i ++) {
        int temp = 0;
        int n, m, k;
        scanf("%d%d", &m, &n);
        double sum = 0;
        for(int j = 1; j <= n; j ++)
            scanf("%d", &a[j]);

        for(int j = 1; j <= n; j ++) {
            if(a[j] == 1) {
                temp = j;
                break;
            }
        }

        if(n <= m) {
            if(temp == 0 || temp == n) {
                printf("0 RMB\n");
                continue;
            }
            else
                k = n - temp - 1;
        }
        else {
            if(temp == 0)
                k = n - m - 1;
            else {
                if(temp > m)
                    k = n - m - 1;
                else
                    k = n - temp -1;
            }
        }

        for(int j = 0; j <= k; j ++)
            sum += pow(2.0, j  * 1.0);
        sum = sum * 10000;
        printf("%.0lf RMB\n", sum);
    }
    return 0;
}