1到19任意个不重复的数相加等于20 (C语言)

#include<stdio.h>


#define MAXKIND 100
#define NUM 5


int first_num(int start, int midresult, int n, int number);
int time_num(int number);
int a[MAXKIND][NUM]={0};
int count = 0;


int main(int args,  char *argv)
{
int i,j;
int sum = 0;
int number = 2;
for(number = 2; number <= 5; number ++)
{
sum = 0;
sum += time_num(number);
printf("there is %d difference number to count to 20 ,and the kinds is %d\n",number,sum);
}
printf("the total kinds is %d\n",count);
for(i = 0; i < count; i++)
{
for(j = 0; j < NUM && a[i][j]; j++)
printf("%d,",a[i][j]);
printf("\n");
}
}


int time_num(int number)
{
int start = 1;
int n = 1;
int midresult = 0;
int sum = 0;
for(start = 1;start <= 19;start++)
{
midresult = start;
sum += first_num(start,midresult,n,number);
}
return sum;
}


int first_num(int start, int midresult, int n, int number)
{
int sum = 0;
int i = 0,j = 0;
a[count][n-1] = start;
for(j = start+1; j <= 19; j++)
{
// a[count][n] = j;
if(n+1 < number && midresult+j < 20)
sum += first_num(j,midresult+j,n+1,number);
if(n+1 == number && midresult+j == 20) 
{
a[count][n] = j;
sum++; 
count++;
for(i = 0; i < n-1; i++)
a[count][i] = a[count-1][i];
}
}
return sum;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值