// 1. Input a number to separate each digit, and save it as an array // 2. Determine the first bit of the array that is input at the end. // 3. Determine whether the number of returned questions is satisfied cyclically. # include <iostream> using namespace STD; int main () {int N, temp; int K = 0; int A [20]; cout <"Please input an number:" <Endl; CIN> N; for (INT I = 0; I <20; I ++) // used to separate each bit and store it in the array {If (n> = 1) {temp = n % 10; // key steps for separation a [I] = temp; n = N/10; k ++; // counter, can you know how many digits this number has?} For (INT m = 0; m <K; m ++) // you can determine whether this number is a return number {if (a [m]! = A [k-m-1]) {cout <"this is not the number of replies! "<Endl; break; // skip loop} else {cout <" this is the number of replies! "<Endl; break; // skip loop} return 0 ;}