#include<stdio.h>
int main()
{
int v, ret,i=0;
int num;
int a[30];
int b[30];
int g, s, B, q, w, sw, bw, qw;
while (1)
{
ret = scanf_s("%d", &v);
if (ret != 1) break;
a[i] = v;
i += 1;
}
for (num = 0; num < i; num++)
{
if (a[num] / 10 == 0)
b[num] = a[num];
if (a[num] / 100 == 0)
{
s = a[num] / 10;
g = a[num] - 10 * s;
b[num] = 10 * g + s;
}
if (a[num] / 1000 == 0)
{
B = a[num] / 100;
s = (a[num] - 100 * B) / 10;
g = a[num] - 100 * B - 10 * s;
b[num] = 100 * g + 10 * s + B;
}
if (a[num] / 10000 == 0)
{
q = a[num] / 1000;
B = (a[num] - 1000 * q) / 100;
s = (a[num] - 1000 * q - 100 * B) / 10;
g = a[num] - 1000 * q - 100 * B - 10 * s;
b[num] = 1000 * g + 100 * s + 10 * B + q;
}
if (a[num] / 100000 == 0)
{
w = a[num] / 10000;
q = (a[num] - 10000 * w) / 1000;
B = (a[num] - 10000 * w - 1000 * q) / 100;
s = (a[num] - 10000 * w - 1000 * q - 100 * B) / 10;
g = a[num] - 10000 * w - 1000 * q - 100 * B - 10 * s;
b[num] = 10000 * g + 1000 * s + 100 * B + 10 * q + w;
}
if (a[num] / 1000000 == 0)
{
sw = a[num] / 100000;
w = (a[num] - 100000 * sw) / 10000;
q = (a[num] - 100000 * sw - 10000 * w) / 1000;
B = (a[num] - 100000 * sw - 10000 * w - 1000 * q) / 100;
s = (a[num] - 100000 * sw - 10000 * w - 1000 * q - 100 * B) / 10;
g = a[num] - 100000 * sw - 10000 * w - 1000 * q - 100 * B - 10 * s;
b[num] = 100000 * g + 10000 * s + 1000 * B + 100 * q + 10 * w + sw;
}
}
int sum = 0,sum1;
for (num = 0; num < i - 1; num++)
{
sum = sum + b[num];
}
printf("%d", sum);
}
我要单纯的逆序数相加