제출 #584142

#제출 시각아이디문제언어결과실행 시간메모리
584142OlympiaPalindrome-Free Numbers (BOI13_numbers)C++17
32.92 / 100
1094 ms212 KiB
#include <bits/stdc++.h> using namespace std; bool isPalindrome (int i) { string s = to_string(i); bool fine = true; for (int j = 0; j < s.length(); j++) { if (j >= 1 && s[j] == s[j - 1]) { fine = false; } if (j >= 2 && s[j] == s[j - 2]) { fine = false; } } return fine; } int powerOf10 (int x) { //pow(10, x) if (x == 1) { return 10; } int tot = 81; for (int i = 0; i < x - 2; i++) { tot *= 8; } return tot + powerOf10(x - 1); } int res (int a, int b) { int ans = 0; for (int i = a; i <= b; i++) { ans += isPalindrome(i); } return ans; } int removeAllBut2 (int x) { string s = to_string(x); for (int i = 2; i < s.length(); i++) { s[i] = '0'; } return stoi(s); } int query (int a, int b) { //cout << a << "<->" << b << '\n'; if (b - a <= 1000) { return res(a, b); } if (a != 0) { return query(0, b) - query(0, a - 1); } if (a == b) { return a; } string s = to_string(b); int tot = 0; int c = 0; for (int i = 1; i <= 9; i++) { for (int j = 0; j <= 9; j++) { for (int k = 0; k <= 9; k++) { if (i == j || j == k || i == k) continue; if (100 * i + 10 * j + k >= 100 * (s[0] - '0') + 10 * (s[1] - '0') + (s[2] - '0')) { continue; } c++; } } } //reverse(b.begin(), b.end()); tot += c * pow(8, (int)s.size() - 3); tot += powerOf10((int)s.length() - 1); reverse(s.begin(), s.end()); s.pop_back(); reverse(s.begin(), s.end()); b = stoi(s); tot += query(removeAllBut2(b), b); return tot; } int main() { int64_t a, b; cin >> a >> b; cout << query(a, b) << '\n'; }

컴파일 시 표준 에러 (stderr) 메시지

numbers.cpp: In function 'bool isPalindrome(int)':
numbers.cpp:6:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 |     for (int j = 0; j < s.length(); j++) {
      |                     ~~^~~~~~~~~~~~
numbers.cpp: In function 'int removeAllBut2(int)':
numbers.cpp:36:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for (int i = 2; i < s.length(); i++) {
      |                     ~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...