제출 #1120784

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1120784		vjudge1	Palindrome-Free Numbers (BOI13_numbers)	C++17	26.67 / 100	1079 ms	504 KiB

numbers

#include <bits/stdc++.h>
using namespace std;
# define int long long

bool pol(string s)
{
  for(int i = 0; i < s.size() / 2; ++i)
  {
    if(s[i] != s[s.size() - i - 1])
      return false;
  }
  return true;
}

bool ok(string s)
{
  string scc;
  for(int i = 0; i < s.size() - 1; i++)
  {
    for(int j = i + 1; j < s.size(); j++)
    {
      string sc = "";
      for(int z = i; z <= j; z++) 
        sc += s[z];
      scc = sc;
      reverse(scc.begin(), scc.end());
      if(sc == scc){
        return 1;
      }
    }
  }
  return 0;
}

void solve()
{
  ios_base::sync_with_stdio(false);
  cin.tie();
  cout.tie();
  int a, b, cnt = 0;
  cin >> a >> b;
  for(int i = a; i <= b; i++)
  {
    string s = to_string(i);
    if(pol(s) && s.size() != 1)
    {
      cnt++;
      continue ;
    }
    if(ok(s) && s.size() != 1)
    {
      cnt++;
      continue ;
    }
  }
  cout << (b - a + 1) - cnt << endl;
}

signed main()
{
  int tt = 1;
  // cin >> tt;
  while(tt--)
    solve();
}

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

numbers.cpp: In function 'bool pol(std::string)':
numbers.cpp:7:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 |   for(int i = 0; i < s.size() / 2; ++i)
      |                  ~~^~~~~~~~~~~~~~
numbers.cpp: In function 'bool ok(std::string)':
numbers.cpp:18:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |   for(int i = 0; i < s.size() - 1; i++)
      |                  ~~^~~~~~~~~~~~~~
numbers.cpp:20:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int j = i + 1; j < s.size(); j++)
      |                        ~~^~~~~~~~~~

• Subtask 1: 25 / 25
• Subtask 2: 1.6666666666666667 / 75