POJ 2817 木棒 解题报告
编号:2817
考查点:递归
思路:一开始很天真的以为找到最小的可以被总长除尽的数即可,后来才发现原来除尽了的数还要判断是否符合题意,这个判断才是关键,也就是这个判断,即组合木棒的过程用到了递归。
提交情况: 啥玩意只要先看了书,自己动脑袋肯定能明白,难就难在不看书自己想通.我是看了书才AC的.。
Source Code:
//POJ Grids 2817
#include
<
iostream
>
using namespace std;
int count;
int stick[ 65 ];
bool flag[ 65 ];
bool istick( int left, int len, int n)
{
if (left == 0 && n == 0 )
return true ;
if (left == 0 )
left = len;
for ( int i = 0 ;i < count;i ++ )
{
if ( ! flag[i])
{
if (left >= stick[i])
{
flag[i] = true ;
if (istick(left - stick[i],len,n - 1 ))
return true ;
flag[i] = false ;
if (stick[i] == left || left == len)
break ;
}
}
}
return false ;
}
int compare( const void * e1, const void * e2)
{
return * (( int * )e2) - * (( int * )e1);
}
int main()
{
while (cin >> count && count != 0 )
{
memset(stick, 0 , sizeof stick);
memset(flag, false , sizeof flag);
int sum = 0 ;
int max = 0 ;
for ( int i = 0 ;i < count;i ++ )
{
cin >> stick[i];
if (stick[i] > max)
max = stick[i];
sum += stick[i];
}
qsort(stick,count, sizeof ( int ),compare);
for ( int i = max;i <= sum;i ++ )
{
if (sum % i == 0 )
{
if (istick( 0 ,i,count))
{
cout << i << endl;
break ;
}
}
}
}
return 0 ;
}
using namespace std;
int count;
int stick[ 65 ];
bool flag[ 65 ];
bool istick( int left, int len, int n)
{
if (left == 0 && n == 0 )
return true ;
if (left == 0 )
left = len;
for ( int i = 0 ;i < count;i ++ )
{
if ( ! flag[i])
{
if (left >= stick[i])
{
flag[i] = true ;
if (istick(left - stick[i],len,n - 1 ))
return true ;
flag[i] = false ;
if (stick[i] == left || left == len)
break ;
}
}
}
return false ;
}
int compare( const void * e1, const void * e2)
{
return * (( int * )e2) - * (( int * )e1);
}
int main()
{
while (cin >> count && count != 0 )
{
memset(stick, 0 , sizeof stick);
memset(flag, false , sizeof flag);
int sum = 0 ;
int max = 0 ;
for ( int i = 0 ;i < count;i ++ )
{
cin >> stick[i];
if (stick[i] > max)
max = stick[i];
sum += stick[i];
}
qsort(stick,count, sizeof ( int ),compare);
for ( int i = max;i <= sum;i ++ )
{
if (sum % i == 0 )
{
if (istick( 0 ,i,count))
{
cout << i << endl;
break ;
}
}
}
}
return 0 ;
}
总结:这道题是递归这章的最后一题,以前感觉递归很巧很简单,现在才发现这玩意这么强悍,搜索好帮手.。
另 今天为了上netifera装了IRC,为装IRC装了Firefox,为装Firefox装了一些字体,导致现在的字体和以前的有所不同了.。
By Ns517
Time 09.02.06