woj

1、整数拆分问题: 解决方法

#include<iostream>
using namespace std;

void maxsplit(int n){
       int maxmultiply =1;
       if(n<=4){
           if(n<=0){
               return ;
           }else if(n==1||n==2||n==3){
               cout<<n<<endl;
           }else
               cout<<"2"<<" "<<"2"<<endl;
       }else{
           int numthree = n/3;
           if(n%3==0){           
               for(int i=1;i<=numthree;i++){
                   if(i==1)
                    cout<<"3";
                    else cout<<" "<<"3";
               }
               cout<<endl;
           }
           else if(n%3==1){
                cout<<"2 2 ";
               for(int i=1;i<numthree;i++){
                    if(i==1)
                    cout<<"3";
                    else cout<<" "<<"3";
               }
              cout<<endl;
           }else if(n%3==2){
                cout<<"2 ";
               for(int i=0;i<numthree;i++){
                    if(i==0)
                    cout<<"3";
                    else cout<<" "<<"3";
               }
               cout<<endl;
           }
       }
   }
   int main()
   {
        int n;
        cin>>n;
        while(n!=0)
        {
            maxsplit(n);
            cin>>n;
           }
        return 0;
   }

2、数制转换：解题方法

#include<iostream>
using namespace std;

int main()
{
    int cases;
    cin>>cases;
    int n[32];
    int num,tmp,k=0;
    int flag;
    while(cases--)
    {
        k=0; 
        flag=1;
        cin>>num;
        if(num==0)
        {
            cout<<num<<endl;
            continue;
        }
        if(num<0)
        {
            flag=-1;
            num=(-1)*num;
        }
        tmp=num;    
        while(num!=0)
        {
            tmp=num%3;
            if(tmp==2)
            {
                tmp=-1;
                num=num+2;
            }
            else
            {
                num=num-tmp;
            }
            n[k]=tmp*flag;
            k++;
            num=num/3;
        }
        for(int i=k-1;i>=0;i--)
        {
            switch(n[i])
            {
                case -1:cout<<"-";break;
                case 1:cout<<"1";break;
                case 0:cout<<"0";break;
                default:cout<<"error";
            }
        }
        cout<<endl; 
    }
    return 0;
 } 

3、Holding Animals（背包问题)：解决方法

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;

int max(int a,int b)
{
    return a>b?a:b;
}
int main()
{
    int w[101],v[101];
    int m[100001];
    int t,cases;
    while((scanf("%d",&cases))!=EOF)
    {
        w[0]=v[0]=0;
        for(int i=1;i<=cases;i++)
            cin>>w[i]>>v[i];
        cin>>t;
        memset(m,0,sizeof(m));
        for(int i=1;i<=cases;i++)
            for(int j=t;j>=0;j--)
            {
                if(j>=w[i])
                    m[j]=max(m[j],m[j-w[i]]+v[i]);
             }
        cout<<m[t]<<endl;
    }
    return 0;
}