题解 | #小乐乐改数字#

知识点：运算

#include <iostream>
using namespace std;

int main() {
    int n = 0;
    int count = 0;
    int digit = 0;
    int a[9] = {0};
    int result = 0;

    cin >> n;

    while (n > 0) {
        digit = n % 10;
        n /= 10;
        if (digit % 2 == 0) {
            a[count++] = 0;
        } else {
            a[count++] = 1;
        }
    }

    for (int i = count - 1; i >= 0; i--) {
        result = result * 10 + a[i];
    }

    cout << result << endl;

    return 0;
}

// 解法一
/*
int main() {

    int n = 0;
    int res = 0;
    int len = 0;
    int temp = 0;
    int power = 0;
    int digit = 0;

    cin >> n;
    // cout << "n=" << n << endl;
    temp = n;

    while (temp > 0) {
        temp /= 10;
        len++;
    }
    power = pow(10, len - 1);
    // cout << "len=" << len << endl;
    // cout << "power=" << power << endl;

    temp = n;

    while (temp > 0) {
        digit = temp / power;
        digit = digit % 2 == 0 ? 0 : 1;
        res = res * 10 + digit;
        temp = temp % power;
        power /= 10;
    }


    cout << res;

    return 0;
}*/