qingdao

1001

#include <bits/stdc++.h>

using namespace std;
vector<long long> v;
long long pow2(long long a, int b)
{
    long long ans = ;
    for(int i = ; i <= b; ++i)
        ans *= a;
    return ans;
}
void init()
{
    for(int a = ; a <= ; ++a)
    {
        for(int b = ; b <= ; ++b)
        {
            for(int c = ; c <= ; c++)
            {
                for(int d = ; d <= ; d++)
                {
                    long double sb= (long double)pow2(, a)*(long double)pow2(, b)*(long double)pow2(, c)*(long double)pow2(, d);
                    long long t = pow2(, a)*pow2(, b)*pow2(, c)*pow2(, d);
                    if(sb< || sb> ||t< || t>) break;
                    //printf("!");
                    v.push_back(t);
                }
            }
        }
    }
    sort(v.begin(), v.end());
    //for(int i = 0; i < v.size(); ++i)cout << v[i] << endl;
}
int lb(int x, int y, int k)
{
    int m;
    while(x < y)
    {
        m = x+(y-x+)/;
        if(v[m] <= k) x = m;
        else y = m-;
    }
    return x;
}
int main()
{
    int o, p;
    //cout << pow2(2,10);
    init();
    int n,t;
    scanf("%d",&t);
    while(t--)
    {
        int i;
        scanf("%d",&n);
        int lo = ,hi = v.size(),mid;
        //int ans = lb(lo, hi, n);
        /*while(lo<hi)
        {
            mid = (lo+hi)>>1;
            if(v[mid]<=n) lo = mid;
            else hi = mid-1;
        }*/
        int ans = lower_bound( v.begin(), v.end(), (long long)n)-v.begin();
        printf("%d\n",v[ans]);
    }
    return ;
}

1002

#include <bits/stdc++.h>
using namespace std;
double a[+];
char str[];
void init()
{
    for(int i = ; i <= ; ++i)
    {
        double t = (double)i*(double)i;
        a[i] = a[i-]+1.0/t;
    }
}
int trans(char* str)
{
    int ans = ;
    int len = strlen(str);
    for(int i = ; i < len; ++i)
    {
        ans += (str[i]-'');
        ans *= ;
    }
    return ans/;
}
int main()
{
    init();
    long long n;
    //cout << trans("123100023") << endl;
    //for(int i = 1; i < 10; ++i)cout << a[i] << endl;

    while(~scanf("%s", str))
    {
        int len = strlen(str);
        n =trans(str);
        if(len>)
        {
            printf("1.64493\n");
        }
        else if(n >= )
            printf("1.64493\n");
        else
        {
            printf("%.5lf\n", a[n]);
        }
    }
    return ;
}

1005

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int t,n;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        if(n%) printf("Balanced\n");
        else printf("Bad\n");
    }
    return ;
}