1 条题解

  • 0
    @ 2026-8-21 16:22:51

    #include <bits/stdc++.h> using namespace std; string s, n; char a[1200], b[1200]; int h, k;

    int main() { cin >> s >> n; for (char c : s) { if (c == '-') { a[0] = c; } if (c != '0' && c != '-') { h++; a[h] = c; } else { if (h != 0 && c != '-') { h++; a[h] = c; } } } for (char c : n) { if (c == '-') { b[0] = c; } if (c != '0' && c != '-') { k++; b[k] = c; } else if (c == '0') { if (k >= 1 && c != '-') { k++; b[k] = c; } } } if (h > k) { if (a[0] == '-' && b[0] == '-') { cout << "second"; } else if (a[0] == '-' && b[0] != '-') { cout << "second"; } else if (a[0] != '-' && b[0] == '-') { cout << "first"; } else { cout << "first"; } } else if (h < k) { if (a[0] == '-' && b[0] == '-') { cout << "first"; } else if (a[0] == '-' && b[0] != '-') { cout << "second"; } else if (a[0] != '-' && b[0] == '-') { cout << "first"; } else { cout << "second"; } } else { if (a[0] == 0 && b[0] == 0) { int cnt = 0; for (int i = 1; i <= h; i++) { if (a[i] * 1 > b[i] * 1) { cout << "first"; cnt++; break; } if (a[i] * 1 < b[i] * 1) { cout << "second"; cnt++; break; } } if (cnt == 0) { cout << "same"; } } else if (a[0] == '-' && b[0] != '-') { cout << "second"; } else if (a[0] != '-' && b[0] == '-') { cout << "first"; } else if (a[0] == '-' && b[0] == '-') { int cnt = 0; for (int i = 1; i <= h; i++) { if (a[i] * 1 < b[i] * 1) { cout << "first"; cnt++; break; } if (a[i] * 1 > b[i] * 1) { cout << "second"; cnt++; break; } } if (cnt == 0) { cout << "same"; } } } return 0; }

    • 1

    信息

    ID
    31302
    时间
    1000ms
    内存
    256MiB
    难度
    9
    标签
    递交数
    83
    已通过
    7
    上传者