2019年3月10日 天梯赛校选（解答）

题目：https://www.cnblogs.com/lightac/p/10534726.html

第一题

#include <iostream>
#include <cstring>

using namespace std;

int main() {
    int num = 0;
    char a[1001], b[1001];
    cin >> num;
    for (int i = 0; i < num; ++i) {
        cin >> a;
        cin >> b;
        if (strcmp(a, b) > 0)
            cout << ">" << endl;
        else if (strcmp(a, b) < 0)
            cout << "<" << endl;
        else
            cout << "=" << endl;
    }
    return 0;
}

第二题

#include <iostream>            //不确定

using namespace std;

int main()
{
    int num = 0;
    cin >> num;
    while (num--) {
        int m = 0, n = 0;
        cin >> n >> m;
        if (m >= n)
            cout << "Yes" << endl;
        else if (!(n % (m + 1)))
            cout << "No" << endl;
        else
            cout << "Yes" << endl;
    }
}

第三题

#include <iostream>                        //找的板子
#include <string>
#include <vector>
#include <algorithm>
#include <stdexcept>
#define MAXN 1000

using namespace std;

int a[MAXN], b[MAXN];
int main(int argc, const char * argv[])
{
    int num = 0;
    cin >> num;
    while (num--) {
        string str1, str2;
        long int len1, len2;
        long int i, j, k;
        int up;

        cin >> str1 >> str2;
        len1 = str1.length();
        len2 = str2.length();
        memset(a, 0, sizeof(a));
        memset(b, 0, sizeof(b));
        for (i = len1 - 1, k = 0; i != -1; --i)
        {
            a[k] = str1[i] - '0';
            k++;
        }
        for (j = len2 - 1, k = 0; j != -1; --j)
        {
            b[k] = str2[j] - '0';
            k++;
        }
        for (i = 0, up = 0; i < MAXN; ++i)
        {
            a[i] = a[i] + b[i] + up;
            up = a[i] / 10;
            a[i] %= 10;
        }
        for (i = MAXN - 1; i != -1; --i)
        {
            if (a[i])
            {
                break;
            }
        }
        for (k = i; k != -1; --k)
        {
            cout << a[k];
        }
        cout << endl;
    }
    return 0;
}