Some task

#include <iostream>
#include <cmath>

#define N 100

using namespace std;

class inf_num {

    private:
        int sign = 1;
        int data[N] = { 0 };

        void div_by_int(inf_num &num, int int_num) {
            for (int i = 0; i < N; i++) {
                if (i + 1 < N) {
                    num.data[i + 1] += (num.data[i] % int_num) * 10;

                }

                num.data[i] /= int_num;
            }
        }

        void fix_sign(inf_num &num) {
            if (compare(num, init()) == 0) {
                num.sign = 1;
            }
        }

        void swap(inf_num &a, inf_num &b) {
            inf_num c  = a;

            a = b;
            b = c;
        }

        int compare(inf_num a, inf_num b) {
            if (a.sign > b.sign) {
                return 1;
            }
            if (a.sign < b.sign) {
                return -1;
            }

            for (int i = 0; i < N; i++) {
                if (a.data[i] > b.data[i]) {
                    return a.sign;
                } else if (a.data[i] < b.data[i]){
                    return -1 * a.sign;
                }
            }

            return 0;
        }

        inf_num sum(inf_num a, inf_num b) {
            inf_num c;

            for (int i = N - 1; i >= 0; i--) {
                c.data[i] = a.data[i] + b.data[i];
            }

            fix_system(c);

            return c;
        }

        inf_num diff(inf_num a, inf_num b) {
            inf_num c;

            for (int i = N - 1; i >= 0; i--) {
                c.data[i] = a.data[i] - b.data[i];
            }

            fix_system(c);

            return c;
        }

        void fix_system(inf_num &num) {
            for (int i = N - 1; i >= 0; i--) {
                if (i > 0) {
                    if (num.data[i] > 9) {
                        num.data[i - 1] += num.data[i] / 10;
                        num.data[i] = num.data[i] % 10;
                    }
                    if (num.data[i] < 0) {
                        while (num.data[i] < 0) {
                            num.data[i] += 10;
                            num.data[i - 1] -= 1;
                        }
                    }
                }
            }
        }

        inf_num mult(inf_num a, inf_num b) {
            inf_num c;

            for (int i = N - 1; i >= 0; i--) {
                inf_num temp;

                for (int j = N - 1; j >= 0; j--) {
                    if (N - 1 - (N - 1 - i + N - 1 - j) >= 0) {
                        temp.data[N - 1 - (N - 1 - i + N - 1 - j)] += a.data[i] * b.data[j];
                    }
                }

                c = c + temp;
            }

            fix_system(c);

            return c;
        }

        inf_num div(inf_num a, inf_num b) {
            inf_num c;

            int cmp = compare(a, b);

            if (cmp == -1) {
                return init();
            }
            if (cmp == 0) {
                c.set("1");

                return c;
            }

            if (compare(a, init()) == 0) {
                return init();
            }

            if (compare(b, init()) == 0) {
                return init();
            }

            inf_num t;

            t.set("1");

            if (compare(b, t) == 0) {
                return a;
            }

            inf_num r_b, l_b;

            l_b.set("1");
            r_b = a;

            inf_num prev_c = init();

            do {
                prev_c = c;

                c = r_b + l_b;

                div_by_int(c, 2);

                cmp = compare(a, b * c);

                if (cmp == 1) {
                    l_b = c;
                }
                if (cmp == -1) {
                    r_b = c;
                }
            } while (cmp != 0 && compare(c, prev_c) != 0);

            return c;
        }

        inf_num sum_sign(inf_num a, inf_num b) {
            inf_num c;

            if (a.sign == b.sign) {
                c = sum(a, b);

                c.sign = a.sign;

                fix_sign(c);

                return c;
            } else {
                if (b.sign == 1) {
                    swap(a, b);
                }

                b.sign = 1;

                int cmp = compare(a, b);

                if (cmp != -1) {
                    c = diff(a, b);
                } else {
                    c = diff(b, a);

                    c.sign = -1;
                }

            }

            fix_sign(c);

            return c;
        }

        inf_num diff_sign(inf_num a, inf_num b) {
            inf_num c;

            if (a.sign != b.sign) {
                c = sum(a, b);

                c.sign = a.sign;

                if (compare(c, init()) == 0) {
                    c.sign = 1;
                }

                fix_sign(c);

                return c;
            } else {

                b.sign *= -1;

                if (compare(c, init()) == 0) {
                    c.sign = 1;
                }

                return sum_sign(a, b);
            }

            return c;
        }

        inf_num mult_sign(inf_num a, inf_num b) {
            inf_num c = mult(a, b);

            c.sign = (a.sign * b.sign);

            return c;
        }

        inf_num div_sign(inf_num a, inf_num b) {
            int c_sign = a.sign * b.sign;

            a.sign = 1; b.sign = 1;

            inf_num c = div(a, b);

            if (compare(c, init()) != 0) {
                c.sign = c_sign;
            }

            return c;
        }

        inf_num init() {
            inf_num num;

            return num;
        }

    public:

        int to_int() {
            int res = 0;

            for (int i = N - 1; i >= 0; i--) {
                res += (*this).data[i] * pow(10, N - 1 - i);
            }

            if (sign == -1) {
                res *= -1;
            }

            return res;
        }

        inf_num operator + (inf_num num) {
            return sum_sign(*this, num);
        }

        inf_num operator - (inf_num num) {
            return diff_sign(*this, num);
        }

        inf_num operator * (inf_num num) {
            return mult_sign(*this, num);
        }

        inf_num operator / (inf_num num) {
            return div_sign(*this, num);
        }

        char in() {
            string s;

            cin >> s;

            set(s);

            return ' ';
        }

        void set(string s) {
            *this = init();

            int i = 0;

            if (s[0] == '-') {
                i++;

                sign = -1;
            } else {
                sign = 1;
            }

            for (i; i < s.size(); i++) {
                data[N - s.size() + i] = s[i] - '0';
            }
        }

        char out() {
            if (sign == -1) {
                cout << "-";
            }

            bool flag = false;

            for (int i = 0; i < N; i++) {
                if (data[i] != 0) {
                    flag = true;
                }

                if (flag) {
                    cout << data[i];
                }
            }

            if (!flag) {
                cout << "0";
            }

            return ' ';
        }
};

int main() {

    inf_num a, b, c;

    cout << "Enter num a: " << a.in() << endl;

    cout << "Enter num b: " << b.in() << endl;

    c = a + b;

    cout << "a + b = " << c.out() << endl;

    //

    c = a - b;

    cout << "a - b = " << c.out() << endl;

    //

    c = a * b;

    cout << "a * b = " << c.out() << endl;

    //

    c = a / b;

    cout << "a / b = " << c.out() << endl;

    return 0;
}