坑贪心 二进制枚举 CCPC长春A

#include <bits stdc++.h>
using namespace std;
int v[10] = {1, 6, 28, 88, 198, 328, 648},
    e[10] = {8, 18, 28, 58, 128, 198, 388};
int main() {
    int T, n;
    scanf("%d", &amp;T);
    while (T--) {
        scanf("%d", &amp;n);
        int res = 0;
        for (int i = 0; i &lt; (1 &lt;&lt; 7); ++i) {
            int t = 0, s = 0;
            for (int j = 0; j &lt; 7; ++j)
                if (i &gt;&gt; j &amp; 1) s += v[j], t += e[j];
            if (s &lt;= n) res = max(res, t + n * 10);
        }
        printf("%d\n", res);
    }
    return 0;
}