数根
来源:互联网 发布:国产灾难片 知乎 编辑:程序博客网 时间:2024/06/10 02:50
#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;
#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;
0 0
- 数根
- 数根
- 数根
- 数根
- 数根
- 数根
- 数根
- 数根
- 数根
- POJ 2764:数根
- 1084: 【循环】数根
- I00026 计算数根
- NoiOpenJudge 1.13 数根
- AOJ-754 数根
- CCF NOI1035 数根
- 数
- 数
- 数
- [解决]我遇到的unable to run app in Simpulator
- 利用PD生成数据库语句,在用逆向工程转化为ssh2框架报错
- 一些第三方框架_01
- AT指令对wavecom串口GSM工业手机发送短信(英文和PDU短信)
- 算法设计之线性规划
- 数根
- java for循环实现乘法表
- 2015-11-18-线程总结篇1
- String Stringbuffer Stringbuilder
- android进行录音功能并保存播放
- Itoa 函数
- 【转载】Linux必学的60个命令
- Linux ps命令详解与示例说明
- Android自定义手势识别