DFS-速算24点

Description

George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had originally and how long they were originally. Please help him and design a program which computes the smallest possible original length of those sticks. All lengths expressed in units are integers greater than zero.
 

Input

The input contains blocks of 2 lines. The first line contains the number of sticks parts after cutting, there are at most 64 sticks. The second line contains the lengths of those parts separated by the space. The last line of the file contains zero.
 

Output

The output file contains the smallest possible length of original sticks, one per line.
 

Sample Input

9 5 2 1 5 2 1 5 2 1 4 1 2 3 4 0
 

Sample Output

6 5


code:

<span style="font-size:18px;">#include <iostream>
#include<algorithm>
#include<string.h>
#include<stdio.h>
#include<math.h>
using namespace std;

int num[70],n;
bool flag=false;
int visited[70];

int cmp(int a,int b){
    return a>b;
}

void dfs(int ans,int k,int len){
    //5 5 5 2 2 2 1 1 1
    if(!ans&&!k){
        flag=true;
        return;
    }
    if(!ans)
        ans=len;
    for(int j=0;j<n;j++){
        if(!visited[j]&&num[j]<=ans){
            visited[j]=1;
            dfs(ans-num[j],k-1,len);
            if(flag)
                return;
            visited[j]=0;
            if (ans== num[j] || ans == len)//剪枝(前面一次查找成功,后面某次查找错误,则return
                            // 或者 当是6=2+2+2时,第一次查找dfs(6-2,k-1,len)错误,则return );
                 return ;
        }
    }
}

int main(){
    //freopen("input.txt","r",stdin);
    int total;
    while(cin>>n&&n){
        flag=false;
        total=0;
        for(int i=0;i<n;i++){
            visited[i]=0;
            cin>>num[i];
            total+=num[i];
        }
        sort(num,num+n,cmp);
        int j;
        for(j=num[0];j<=total;j++){//注意可以取等于;
            if(total%j!=0)continue;
            dfs(j,n,j);
            if(flag){
                cout<<j<<endl;
                break;
            }
        }
    }
   return 0;
}</span>


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值