제출 #1295491

#제출 시각아이디문제언어결과실행 시간메모리
1295491ChocoPalindrome-Free Numbers (BOI13_numbers)C++20
17.50 / 100
1097 ms576 KiB
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("O3") #define ll long long #define fori(i,j,k) for(ll i=j; i<=k;i++) #define study ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #define pb push_back #define all(s) s.begin(),s.end() #define ins insert #define ss second #define ff first ll sz=4e3+10; ll INF=1e12; ll mod=1e9+7; void work(){ ll a,b; cin>>a>>b; ll cur=0; fori(k,a,b){ string s=to_string(k); bool ok=1; fori(i,0,s.size()-2){ for(ll j=2;j+i<=s.size();j++){ string s1=s.substr(i,j); //cout<<s1<<" "; string s2=s1; reverse(all(s1)); if(s1==s2){ ok=0; break; } } if(!ok) break; } if(ok) cur++; } cout<<cur<<endl; } int main() { study; ll t=1; //cin>>t; fori(i,1,t) work(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...