]]>
]]>
]]>
]]>
#include<iostream>
#include<queue>
using namespace std;
int n,h;
int f[30],t[30],d[30];
int best[30],way[30],maxinum,tot,tag=0;
struct node
{
int num;
int fish;
void set(int id,int f)
{
num=id;
fish=f;
}
};
bool operator<(const node a,const node b)
{
if(a.fish==b.fish)
return a.num>b.num;
else
return a.fish<b.fish;
}
priority_queue<node> qu;
node now;
int main()
{
while(scanf("%d",&n)&&n)
{
if(tag)
printf("\n");
cin>>h;
h*=12;
maxinum=-1;
int i,j;
for(i=0;i<n;i++)
{
cin>>f[i];
}
for(i=0;i<n;i++)
{
cin>>d[i];
}
for(i=0;i<n-1;i++)
{
cin>>t[i];
}
///////////鏁版嵁杈撳叆瀹屾瘯錛屽紑濮嬭繘鍏ヨ綆?br> for(i=0;i<n;i++)
{
memset(way,0,sizeof(way));
while(!qu.empty())
qu.pop();
if(i>0)
h-=t[i-1];
tot=0;
for(j=0;j<=i;j++)
{
now.set(j,f[j]);
qu.push(now);
}
for(j=0;j<h;j++)
{
now=qu.top();
qu.pop();
tot+=now.fish;
now.fish-=d[now.num];
if(now.fish<0)
now.fish=0;
way[now.num]+=5;
qu.push(now);
}
if(tot>maxinum)
{
maxinum=tot;
memcpy(best,way,sizeof(way));
}
}
printf("%d",best[0]);
for(i=1;i<n;i++)
printf(", %d",best[i]);
printf("\nNumber of fish expected: %d\n",maxinum);
tag=1;
}
return 0;
}
]]>
template < typename T >
bool _next_permutation( T *first, T *last );
#define N 8
int main(int argc, char* argv[])
{
int i;
int y = 1;//搴忓彿
char a[N];
for ( i=0; i<N; i++ )
{
a[i] = i + 1 + 64 + 32;
}
long t0 = time( NULL );
do
{
cout << y << "銆--->銆";
for ( i = 0; i<N; i++ ) cout << a[i];
cout << endl;
y++;
}while( _next_permutation( &a[0], &a[N] ) );
long t1 = time( NULL ) - t0;
cout << t1 << endl;//褰揘涓?鏃惰楁椂130縐掞紝涓庢硾鍨嬬畻娉昻ext_permutation鐢ㄦ椂涓鏍?br>
return 0;
}
template < typename T >
bool _next_permutation( T *first, T *last )
{
int i;
int j;
int x = -1;
int rang = last - first;
for ( i=0; i<rang-1; i++ )
{
if ( *( first+i ) <= *( first+i+1 ) )
{
x = i;
}
}
if ( x != -1 )
{
for ( i=x; i<rang; i++ )
{
if ( *( first+x ) <= *( first+i ) )
{
j = i;
}
}
_swap( *( first+x ), *( first+j ) );
for ( i=x+1; i<rang; i++ )
{
if ( i != rang + x - i )
{
int nSwap = rang + x - i;
_swap( *( first+i ), *( first+ ( rang+x-i ) ) );
}
if ( ( i + 1 ) * 2 > rang + x )
{
break;
}
}
}
if ( -1 == x ) return false;
else return true;
}
template < typename T >
void _swap( T &a, T &b )
{
a = a + b;
b = a - b;
a = a - b;
}
]]>
#include<iostream>
#include<stdio.h>
#include<cstring>
using namespace std;
char a[12],b[12],c[12];
char temp[25];
bool add(char *first,char *second)
{
int len1=strlen(first);
int len2=strlen(second);
first[len1]='0';
int i,j;
for(i=0;i<len2;i++)
{
second[i]-='0';
}
for(j=0;j<=len1;j++)
{
first[j]-='0';
}
for(i=0;i<len2;i++)
{
first[i]+=second[i];
}
for(i=0;i<len1;i++)
{
if(first[i]>=10)
{
first[i+1]+=first[i]/10;
first[i]%=10;
}
}
for(i=0;i<=len1;i++)
first[i]+='0';
while(first[len1]=='0')
len1--;
int len3=strlen(c);
len3--;
while(c[len3]=='0')
len3--;
if(len1!=len3)
return false;
while(len3>=0)
{
if(c[len3]!=first[len3])
return false;
len3--;
}
return true;
}
int main()
{
while(gets(temp))
{
int kk=0;
while(temp[kk]!='+')
{
a[kk]=temp[kk];
kk++;
}
a[kk]='\0';
kk++;
int kkk=0;
while(temp[kk]!='=')
{
b[kkk]=temp[kk];
kk++;kkk++;
}
b[kkk]='\0';
kk++;
kkk=0;
while(temp[kk]!='\0')
{
c[kkk]=temp[kk];
kk++;kkk++;
}
c[kkk]='\0';
int len1=strlen(a);
int len2=strlen(b);
if(len1==1&&len2==1&&a[0]=='0'&&b[0]=='0')
{
cout<<"True"<<endl;
break;
}
if(len1>len2)
if(add(a,b))
cout<<"True"<<endl;
else
cout<<"False"<<endl;
else
if(add(b,a))
cout<<"True"<<endl;
else
cout<<"False"<<endl;
}
return 0;
}
]]>