实现方法多样,我采用了递归,全部表示了出来,实际操作,按需取用。eg:把2变成ret
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int cs(int a)
{
while (a>1)
{
return 10 * cs(a - 1) + 2;
}
return 2;
}
int main()
{
int x,sum=0;
scanf("%d", &x);
printf("Sn=");
for (int i = 1; i <= x; i++)
{
sum += cs(i);
printf("%d", cs(i));
if (i != x)
{
printf("+");
}
}
return 0;
}
接下来,我演示一下,怎么换x和k的代码
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int cs(int a, int k)
{
while (a > 1)
{
return 10 * cs(a - 1, k) + k;
}
return k;
}
int main()
{
int x, sum = 0;
int ret;
scanf("%d %d", &x, &ret);
printf("Sn=");
for (int i = 1; i <= x; i++)
{
sum += cs(i, ret);
printf("%d", cs(i, ret));
if (i != x)
{
printf("+");
}
}
return 0;
}