利用C++的特性写的:
#include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
using namespace std;
int main()
{
int data, length = 0;
vector<int> v;
cin >> data;
while (data > 0)
{
v.push_back(data % 10);
data /= 10;
length++;
}
cout << "它是一个" << length << "位数" << endl;
cout << "它的每一位为:";
reverse(v.begin(), v.end());
for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
{
cout << *it << " ";
}
cout << endl;
cout << "逆序输出为:";
reverse(v.begin(), v.end());
for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
{
cout << *it;
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int n[5];
int main(){
int a;
scanf("%d",&a);
int i=0;
while(a>0){
n[i]=a%10;
a=a/10;
i++;
}
printf("%d\n",i);
for(int j=i-1;j>=0;j--){
printf("%d ",n[j]);
}
printf("\n");
for(int j=0;j<i;j++){
printf("%d",n[j]);
}
return 0;
}
利用取商,取余,依次求得其各个位数,输出