Submission #20475

#TimeUsernameProblemLanguageResultExecution timeMemory
20475Lower Boundary (#35)채점 시스템 (OJUZ11_judge)C++98
100 / 100
136 ms2180 KiB
/* #include<vector> #include<string> #include<algorithm> #include<stdio.h> using namespace std; struct BigInteger { string integer; BigInteger(string _integer) : integer(_integer) {}; }; BigInteger operator+(BigInteger a, BigInteger b) { vector<int> aList, bList, resultList; for (int i = a.integer.size() - 1; i >= 0; i--) aList.push_back(a.integer[i] - '0'); for (int i = b.integer.size() - 1; i >= 0; i--) bList.push_back(b.integer[i] - '0'); int maxDigit = max(a.integer.size(), b.integer.size()) + 1; for (int i = 0; i < maxDigit - a.integer.size(); i++) aList.push_back(0); for (int i = 0; i < maxDigit - b.integer.size(); i++) bList.push_back(0); for (int i = 0; i < maxDigit; i++) resultList.push_back(0); for (int i = 0; i < maxDigit - 1; i++) { resultList[i] += (aList[i] + bList[i]); resultList[i + 1] += resultList[i] / 10; resultList[i] %= 10; } while (resultList.back() == 0 && resultList.size() != 1) resultList.pop_back(); string result = ""; for (int i = resultList.size() - 1; i >= 0; i--) { result += (resultList[i] + '0'); } return BigInteger(result); } bool operator<(BigInteger a, BigInteger b) { if (a.integer.size() < b.integer.size()) return true; else if (a.integer.size() > b.integer.size()) return false; else return a.integer < b.integer; } bool operator==(BigInteger a, BigInteger b) { return a.integer == b.integer; } int main() { //std::ios::sync_with_stdio(false); int tc; scanf("%d", &tc); while (tc--) { char a1[100], b1[100]; scanf("%s%s", &a1, &b1); string a = a1; string b = b1; string c; int result = (b.size() - a.size() - 1); for (int i = 0; i < b.size(); i++) c += '0'; for (int i = 1; i < 10; i++) { c[0] = i + '0'; if (BigInteger(c) + BigInteger(a) < BigInteger(b) || BigInteger(c) + BigInteger(a) == BigInteger(b)) { result++; break; } } if (result < 0) puts("0"); else printf("%d\n", result); } } */ #include<iostream> #include<cmath> #include<string> using namespace std; int main() { std::ios::sync_with_stdio(false); int tc; cin >> tc; while (tc--) { string strA, strB; cin >> strA >> strB; long long int a = 0, b = 0; for (int i = 0; i < strA.size(); i++) { long long int addNum = 1; for (int j = 0; j < i; j++) addNum *= 10; a += addNum * (strA[strA.size() - 1 - i] - '0'); } for (int i = 0; i < strB.size(); i++) { long long int addNum = 1; for (int j = 0; j < i; j++) addNum *= 10; b += addNum * (strB[strB.size() - 1 - i] - '0'); } long long int c = 1; for (int i = 0; i < strB.size() - 1; i++) c *= 10; int result = strB.size() - strA.size() - 1; for (int i = 1; i < 10; i++) { if (i*c + a <= b) { result++; break; } } if (result < 0) cout << 0 << endl; else cout << result << endl; } }

Compilation message (stderr)

judge.cpp: In function 'int main()':
judge.cpp:80:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < strA.size(); i++) {
                     ^
judge.cpp:85:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < strB.size(); i++) {
                     ^
judge.cpp:91:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < strB.size() - 1; i++) c *= 10;
                     ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...