igt笔试 java_IGT笔试题,正整数N等于M个不同的正整数之和的问题 | 学步园

//

//

//

//  Created by labuser on 10/29/11.

//  Copyright (c) 2011 __MyCompanyName__. All rights reserved.

//

#include

#include "time.h"

//#include

#define times 7

#define scores 40

#define maxnum 20

void cout(int*, int );

void compute(int, int, int*, int);

int main (int argc, char* argv[])

{

int score[times] = {0};

//struct timeval tv;

//struct timezone tz;

//gettimeofday(&tv, &tz);

//int start, end;

//start = tv.tv_usec;

//time_t start,end;

clock_t start, finish;

double  duration;

start = clock();

//start = time(NULL);

compute(scores, times - 1, score, times);

finish = clock();

duration = (double)(finish - start) / CLOCKS_PER_SEC;

printf("%f seconds\n", duration);

//end = time(NULL);

//gettimeofday(&tv, &tz);

//end = tv.tv_usec;

//printf("Spend time: %d microseconds\n", end - start);

//printf("Spend time: %f seconds\n", difftime(end,start));

return 0;

}

void cout(int* result, int n) {

int i;

for (i = n; i > 0; i--) {

printf("  %d", result[i-1]);

}

printf("\n");

}

void compute(int score, int num, int* answer, int m)

{

if (score < 0 || score > (num+1)*10) {

return;

}

if (num == 0) {

*(answer + num) = score;

int n = times - 2;

while (n >= 0 && *(answer + n) > *(answer + n + 1)) {

--n;

}

if (n == -1){

cout(answer, m);

return;

}

}

int i = answer[times] = 1;

for(i = answer[num+1]; i <= maxnum; ++i) {

answer[num] = i;

compute(score - i, num - 1, answer, m);

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值