]]>
]]>
]]>
]]>
]]>
#include<iostream> //涓洪伩鍏嶆棤闄愮殑鎴栧ぇ閲忕殑閲嶅閫掑綊錛岋紝鎬庝箞鍔烇紵錛燂紝鏁扮粍妯℃嫙
using namespace std;
const int N=100;
int f[N][N][N];
int recur(int a,int b,int c){
if(a<=0 || b<=0 || c<=0){
f[a][b][c]=1;
}
else if(a>20 || b>20 || c>20){
f[a][b][c]=recur(20,20,20);
}
else if(a<b && b<c){
if(f[a][b][c-1] == 0 )
f[a][b][c-1]=recur(a,b,c-1);
if(f[a][b-1][c-1]== 0)
f[a][b-1][c-1]=recur(a,b-1,c-1);
if(f[a][b-1][c] == 0 )
f[a][b-1][c]=recur(a,b-1,c);
f[a][b][c]=f[a][b][c-1]+f[a][b-1][c-1]-f[a][b-1][c];
}
else{
if(f[a-1][b][c] == 0)
f[a-1][b][c]=recur(a-1,b,c);
if(f[a-1][b][c-1] == 0)
f[a-1][b][c-1]=recur(a-1,b,c-1);
if(f[a-1][b-1][c] == 0)
f[a-1][b-1][c]=recur(a-1,b-1,c);
if(f[a-1][b-1][c-1]==0)
f[a-1][b-1][c-1]=recur(a-1,b-1,c-1);
f[a][b][c]=f[a-1][b][c]+f[a-1][b][c-1]+f[a-1][b-1][c]-f[a-1][b-1][c-1];
}
return f[a][b][c];
}
int main()
{
int a,b,c;
//cout<<"杈撳叆3涓暟: "<<endl;
while(cin>>a>>b>>c) {
//memset(f,0,sizeof(f));//鍐欒繖涓氨瓚呮椂銆傘傘?
if(a==-1 && b==-1 && c==-1) break;
if(a<=0 || b<=0 || c<=0)
cout<<"w("<<a<<", "<<b<<", "<<c<<") = "<<1<<endl;
else
cout<<"w("<<a<<", "<<b<<", "<<c<<") = "<<recur(a,b,c)<<endl;
}
return 0;
}
]]>
using namespace std;
int main()
{int n,i,a[51],sum,ave,text,ans;
text=0;
while(cin>>n&&n!=0)
{text++;
sum=ans=0;
for(i=0;i<n;i++)
{cin>>a[i];
sum+=a[i];}
ave=sum/n;
for(i=0;i<n;i++)
{if(a[i]>ave)ans+=a[i]-ave;}
cout<<"Set #"<<text<<endl;
cout<<"The minimum number of moves is "<<ans<<"."<<endl<<endl;
}
return 0;
}
]]>
using namespace std;
int main()
{
int num;
char ch;
while(cin>>num&&num)
{
int data[51][2];
cin>>ch;
int i,j,k;
if(ch=='P')
{
for(i=0;i<num;i++)
{
cin>>data[i][0];
data[i][1]=0;//瀵規(guī)暟緇勫垵濮嬪寲蹇呴』鐨?
// cout<<data[i][0]<<" "<<data[i][1]<<endl;
}
for(i=num-1;i>=0;i--)
for(j=i-1;j>=0;j--)
if(data[j][0]>data[i][0])
data[i][1]++;
for(i=0;i<num-1;i++)
{
bool changed=true;
for(j=0;j<num-i-1;j++)
if(data[j][0]>data[j+1][0])
{
changed=false;
int temp1=data[j][0];
int temp2=data[j][1];
data[j][0]=data[j+1][0];
data[j][1]=data[j+1][1];
data[j+1][0]=temp1;
data[j+1][1]=temp2;
}
if(changed)
break;
}
for(i=0;i<num;i++)
{
cout<<data[i][1];
if(i<num-1)
cout<<" ";
}
cout<<endl;
}
if(ch=='I')
{
for(i=0;i<num;i++)
{
cin>>data[i][1];
data[i][0]=0;
// cout<<data[i][0]<<" "<<data[i][1]<<endl;
}
j=0;
for(i=0;i<num;i++)
if((!data[i][1])&&(!data[i][0]))
{
j++;
data[i][0]=i+1;
cout<<i+1;
if(j<num)
cout<<" ";
for(k=0;k<i;k++)
data[k][1]--;
i=-1;
}
cout<<endl;
}
}
return 0;
}
]]>
39 {
40 for(int j = 1; j < i; j++)
41 if(mice[i].w > mice[j].w && mice[i].s < mice[j].s)
42 if(opt[i] < opt[j])
43 {
44 opt[i] = opt[j];
45 path[i] = j;
46 }
47 opt[i]++;
48 }
鍦ㄨ繖涓渶闀夸笉涓嬮檷搴忓垪鐨勬瀯閫犻噷闈㈢殑絎?7琛宱pt[i]++涓鍙ユ湁鐐歸棶棰橈紝濡傛灉鍦?
榪欎釜for(int j = 1; j < i; j++)寰幆閲岄潰濡傛灉娌℃湁鎵懼埌絎﹀悎鏉′歡鐨刴ice閭ｄ箞錛宱pt銆恑銆戜笉搴斿綋鍔犱竴錛岃屼笖浣犺繖涓唬鐮佸湪zoj涓婁篃娌℃湁AC銆傛槸鍚﹀嚭浜嗕竴鐐歸棶棰樸?img src ="http://www.shnenglu.com/superman/aggbug/59065.html" width = "1" height = "1" />
qq:78393083 2008-08-16 16:39 鍙戣〃璇勮
]]>]]>