ZOJ4005 大数开根号

最新推荐文章于 2025-03-07 16:30:53 发布

Summer-Dream

最新推荐文章于 2025-03-07 16:30:53 发布

阅读量164

点赞数

本文链接：https://blog.youkuaiyun.com/qq_41548233/article/details/82717073

版权

Lucky Man

Time Limit: 2 Seconds Memory Limit: 65536 KB

BaoBao is keen on collection. Recently he is abandoning himself to Kantai Collection, especially to collecting cute girls, known as "Fleet Girls".

There are various types of girls in the game. To get a girl, one can use some materials to build her. The probability to get a type of girl by building is the same for all types of girls. From the Coupon Collector's Problem we know that, to collect all types of girls, the expected number of times of building is .

But this rule does not apply to BaoBao, as he is always luckier than the ordinary players (maybe because he's an European). For BaoBao to collect all types of girls, the expected number of times of building is , where means the maximum integer that doesn't exceed .

As a lucky man, BaoBao is not interested in the actual value of , and he just wants to know whether is odd or even. Can you help him?

Input

The first line of the input is an interger (about 100), indicating the number of test cases. For each test case:

The first line contains an integer ( ), indicating the number of types of girls.

Output

For each test case, if is odd output "1" (without quotes), if is even output "0" (without quotes).

Sample Input

Sample Output

打表发现就是根号n的向下取整为奇数还是偶数

#include <cstring>
#include <iostream>

using namespace std;
#pragma GCC optimize(2)
struct Bigint
{
    int len;
    int arg[1005];
    Bigint()
    {
        len = 1;
        memset(arg, 0, sizeof(arg));
    }
    void print()
    {
        for (int i = len - 1; i >= 0; i--){
            cout<<arg[i];
        }
        cout<<endl;
    }
    void CharToBigint(char *str)
    {
        len = strlen(str);
        for (int i = 0; i < len; i++){
            arg[i] = str[len - i - 1] - 48;
        }
        while(arg[len-1] == 0){
            len--;
        }
    }
    friend bool operator==(Bigint r, Bigint w)
    {
        if (r.len != w.len) return false;
        int i = r.len - 1;
        while (i >= 0){
            if (r.arg[i] != w.arg[i])
                return false;
            i--;
        }
        return true;
    }
    friend bool operator<=(Bigint r, Bigint w)
    {
        if (r.len < w.len) return true;
        else if (w.len < r.len) return false;
        int i = r.len - 1;
        while (i >= 0){
            if (r.arg[i]<w.arg[i])
                return true;
            else if (r.arg[i]>w.arg[i])
                return false;
            i--;
        }
        return true;
    }
    friend Bigint operator+(int r, Bigint w){
        w.arg[0] += r;
        int i = 0;
        while (w.arg[i] >= 10){
            w.arg[i + 1] += w.arg[i] / 10;
            w.arg[i] = w.arg[i] % 10;
            i++;
        }
        if(w.arg[i]) i++;
        w.len = i > w.len ? i : w.len;
        return w;
    }
    friend Bigint operator+(Bigint w, int r)
    {
        w.arg[0] += r;
        int i = 0;
        while (w.arg[i] >= 10){
            w.arg[i + 1] += w.arg[i] / 10;
            w.arg[i] = w.arg[i] % 10;
            i++;
        }
        if(w.arg[i]) i++;
        w.len = i > w.len ? i : w.len;
        return w;
    }
    friend Bigint operator-(Bigint r, Bigint w)
    {
        for (int i = 0; i < r.len; i++){
            if (r.arg[i] >= w.arg[i])
                r.arg[i] = r.arg[i] - w.arg[i];
            else{
                r.arg[i] = r.arg[i] + 10;
                r.arg[i + 1] = r.arg[i + 1] - 1;
                r.arg[i] = r.arg[i] - w.arg[i];
            }
        }
        while (r.arg[r.len - 1] == 0 && r.len > 1)
            r.len--;
        return r;
    }
    friend Bigint operator*(int x, Bigint w)
    {
        Bigint r;
        if(x == 0 || (w.len == 1 && w.arg[0] == 0)){
            return r;
        }
        for (int i = 0; i < w.len; i++){
            r.arg[i] += w.arg[i] * x;
            r.arg[i + 1] += r.arg[i] / 10;
            r.arg[i] = r.arg[i] % 10;
        }
        int i = r.arg[w.len] == 0 ? w.len-1 : w.len;
        while (r.arg[i] >= 10){
            r.arg[i + 1] = r.arg[i] / 10;
            r.arg[i] = r.arg[i] % 10;
            i++;
        }
        r.len = (i >= 0) ? i + 1 : 1;
        return r;
    }
    friend Bigint operator*(Bigint r, Bigint w)
    {
        Bigint v;
        if((r.len == 1 && r.arg[0] == 0)|| (w.len == 1 && w.arg[0] == 0)){
            return v;
        }
        for (int i = 0; i < r.len; i++){
            for (int k = 0; k < w.len; k++){
                v.arg[i + k] += w.arg[k] * r.arg[i];
                v.arg[i + k + 1] += v.arg[i + k] / 10;
                v.arg[i + k] = v.arg[i + k] % 10;
            }
        }
        int i = w.len + r.len - 1;
        i = v.arg[i] == 0 ? i-1 : i;
        while (v.arg[i] >= 10){
            v.arg[i + 1] = v.arg[i] / 10;
            v.arg[i] = v.arg[i] % 10;
            i++;
        }
        v.len = (i >= 0) ? i + 1 : 1;
        return v;
    }
    Bigint sqrt()
    {
        Bigint w, r;
        w.len = r.len = 0;
        int lens = len - 1;
        if(len == 1 && arg[0] == 1)
            return *this;
        r.arg[r.len++] = arg[lens--];
        if (len % 2 == 0)
            r = arg[lens--] + 10 * r;
        while (lens >= -1){
            int i = 0;
            while ((i*(i + 20 * w)) <= r){
                i++;
            }
            i--;
            if (i == -1 || (r.len == 1 && r.arg[0] == 1))
                i = 0;
            r = r - (i*(i + 20 * w));
            w = i + 10 * w;
            if(lens >= 0){
                r = arg[lens--] + 10 * r;
                r = arg[lens--] + 10 * r;
            }
            else
                lens -= 2;
        }
        return w;
    }
};



int main()
{
    char stra[1005];
    int testnum;
    std::ios::sync_with_stdio(false);
    cin>>testnum;

    while(testnum--)
    {
        cin>>stra;
        Bigint a;
        a.CharToBigint(stra);
        a = a.sqrt();
        // a.print();
        // cout<<a.arg[0]<<endl;
        if(a.arg[0]==1||a.arg[0]==3||a.arg[0]==5||a.arg[0]==7||a.arg[0]==9)
            cout<<"1"<<endl;
        else
            cout<<"0"<<endl;
    }
    return 0;
}

还有另外一位大佬的博客不错

https://blog.youkuaiyun.com/qq_39599067/article/details/80390222