제출 #1311842

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1311842		discontinuous	Palindromic FizzBuzz (NOI19_palindrome)	C++20	100 / 100	12 ms	9972 KiB

palindrome

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

#define pb push_back
#define int long long

const int MOD = 1e9 + 7;
const int INF = 1e15;
const int N = 1e6;

int n, m, k, a, b, c, d, h, l, r, q, u, v, x, y;
vector<int> arr(N);

void solve() {
    cin >> l >> r;

    for(int i = l; i<=r; i++) {
        string s = to_string(i);
        n = s.length();
        bool palindrome = true;
        for(int j = 0; j<n; j++) {
            if(s[j] != s[n-j-1]) {
                palindrome = false;
                break;
            }
        }

        if(palindrome) cout << "Palindrome!";
        else cout << i;
        cout << "\n";
    }
}

int32_t main() {
    ios::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

    int tc = 1;
    // cin >> tc;

    while(tc--) {
        solve();
        // cout << "\n";
    }

    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