Submission #1170594

#	Time	Username	Problem	Language	Result	Execution time	Memory
1170594		Bzslayed	Palindromic FizzBuzz (NOI19_palindrome)	C++20	100 / 100	10 ms	1868 KiB

palindrome

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 

using namespace std;
using namespace __gnu_pbds; 

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#define ll long long
#define ull unsigned long long
#define llll __int128
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define coutpair(p) cout << p.first << " " << p.second << "|"

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    ll s, e; cin >> s >> e;

    while (s <= e){
        string s1 = to_string(s);
        string s2 = s1;
        reverse(s2.begin(), s2.end());
        if (s1 == s2) cout << "Palindrome!" << "\n";
        else cout << s << "\n";

        s++;
    }
    
    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 14 / 14
• Subtask 4: 8 / 8
• Subtask 5: 9 / 9
• Subtask 6: 20 / 20
• Subtask 7: 31 / 31