/*
ID: niepeng1
PROG: fence8
LANG: C++
*/
#include <stdio.h>
#include <memory.h>
#include <algorithm>
#include <functional>
using namespace std;
int board[51];
int rail[1024];
int reslen[51];
int n,r;
/*
没有任何优化,又是没有想出来那个能截除的最多的板子
长度肯定是最小的那几个。又狂倒了。
优化为去掉不能生成的较长的目标板,因为总和必小于拥有的板子长度。
其实还可以去掉较长的目标板和较短的已经拥有板子。
*/
bool can(int now,int f)
{
int i;
bool ret=false;
for(i=f;i<n;i++)
{
if( board[i] == rail[now])
{
if( now == 0)
return true;
board[i]=0;
if( rail[now]==rail[now-1] ) ret=can(now-1,i+1);
else
ret=can(now-1,0);
board[i]=rail[now];
return ret;
}
}
for(i=f;i<n;i++)
{
if( board[i] > rail[now])
{
if( now == 0)
return true;
if( i && board[i] == board[i-1]) continue;
board[i]-=rail[now];
if( rail[now] == rail[now-1]) ret=can(now-1,i);
else
ret=can(now-1,0);
board[i]+=rail[now];
}
if( ret )
return true;
}
return false;
}
int main()
{
int sumb=0,sumr=0,i;
FILE *in = fopen( "fence8.in", "r" );
FILE *out = fopen( "fence8.out", "w" );
fscanf(in,"%d",&n);
for(i=0;i<n;i++)
{
fscanf(in,"%d",&board[i]);
sumb+=board[i];
}
fscanf(in,"%d",&r);
for(i=0;i<r;i++)
fscanf(in,"%d",&rail[i]);
sort(board,board+n,less<int>());
sort(rail,rail+r,less<int>());
for(i=0;i<r;i++){
sumr+=rail[i];
if(sumr>sumb)
break;
}
r=i;
for(i=r-1;i>=0;i--)
{
if( can(i,0) )
break;
}
fprintf(out,"%d/n",i+1);
fclose( out );fclose( in );
return 0;
}