数根

#include<iostream>

#include<cstring>

#include<string>

using namespace std;

int  zhuanhuan(int arry[], char c[], int n)

{
int sum = 0, k = 0;
int len = strlen(c);
for (int i = 0; i < len; i++)
{
arry[n - len + i] = c[i] - '0';
}
for (k = n - len; k < n; k++)
sum = sum + arry[k];

return sum;

}

int shugeng(int d)

{
int f = 0, num = 0;
while (d != 0)
{
f = d % 10;
d = d / 10;
num = num + f;
}  if (num >= 10)
return  shugeng(num);
else
return num;

}

int main()

{
int n, a[1000];
char c[1000];
cin >> n;
for (int j = 0; j < n; j++)
{
cin >> c;

cout << shugeng(zhuanhuan(a, c, 1000)) << endl;

}
return 0;