> #include<iostream.h>
> #include<fstream.h>
> 
> void main()
> {
> 	fstream fin("in.txt",ios::in||ios::out);
> 	int i,j=0,can=0,k;
> 	long half,temp;
> 	long marbles[8];
> 
> 	int r[8];
> 	int t;
> 	marbles[0]=0;
> 	while(1)
> 	{
> 		////input
> 		fin>>marbles[1]>>marbles[2]>>marbles[3]>>marbles[4]>>marbles[5]>>marbles[6];
> //		cin>>marbles[1]>>marbles[2]>>marbles[3]>>marbles[4]>>marbles[5]>>marbles[6];
> 
> 		////judge whether go on by input 
> 		if(marbles[1]==0 && marbles[2]==0 && marbles[3]==0 && marbles[4]==0 && marbles[5]==0 && marbles[6]==0)
> 			break;
> 		half=0;
> 		can=0;
> 
> 		j++;		//time of case
> 	
> 		for(i=1;i<=6;i++)
> 		{
> 			marbles[i]=marbles[i]%2; 
> 			marbles[i]*=i;//store the resting
> 			r[7-i]=marbles[i];
> 			half+=marbles[i];
> 		}	
> 
>  
> 		if((half%2)==0)//half*2==0
> 		{
> 			half/=2;//half the rest of dividing
> 
> 			for(i=1;i<=6;i++)//whether can find value "half" by added the value of r[]  
> 			{
> 				if(r[i]==0)
> 					continue;
> 
> 				t=1;
> 				marbles[t]=i;//record the path
> 				temp=half-r[i];
> 
> 				k=i;
> 				if(temp>=0)
> 				{
> 					if(temp==0)//end 
> 					{
> 						can=1;
> 						break;
> 					}
> 					
> 					for(k+=1;k<=6;k++)
> 						if(r[k]!=0)
> 							break;
> 							
> 
> 					if(k<6)
> 						k++;//next item
> 					else
> 						break;
> 
> 					while(1)
> 					{ 
> 						if(k<=6)
> 						{
> 							temp-=r[k];
>  
> 							if(temp>=0)
> 							{
> 								if(temp==0)
> 								{
> 									can=1;
> 									break;//?
> 								}
> 								t++;
> 								marbles[t]=k;								
> 							}
> 							else
> 								temp+=r[k];
> 						
> 							k++;
> 						}
> 						else//k>6
> 						{
> 						//	k=1+marbles[t];
> 					
> 							k=marbles[t];	//the last has recorded
> 							
> 							temp+=r[k];		//back one step
> 							t--;
> 							k++;
> 						//	k=marbles[t]+1;
>  
> 							if(marbles[t]==i)
> 								break;
> 						
> 						}//end else
> 					}//end while
> 				}
> 			}//end for
> 		}//end (half%2)==0
>  
> 		if(can==1)
> 		{
> 			if(j!=1)
> 				cout<<endl;
> 			cout<<"Collection #"<<j<<":"<<endl;
> 			cout<<"Can be divided."<<endl;
> 			
> 		}
> 		else
> 		{			
> 			if(j!=1)
> 				cout<<endl;
> 
> 			cout<<"Collection #"<<j<<":"<<endl;
> 			cout<<"Can't be divided."<<endl;	
> 		}
> /**/
> 	}
> }

• Re:help！！！ (1971) palmtenor 2005-04-22 21:23:21
  • 照样是0 ms (0) palmtenor 2005-04-22 21:23:51
  • 什么叫没有证明？自己到未名bbs看一下 (2131) frkstyc 2005-04-22 21:39:46
    • 这个......我看不懂，即便是看懂了也不会...... (0) palmtenor 2005-04-22 21:57:51
      • ft，完全是初中的数学 (0) frkstyc 2005-04-22 22:00:33
        • 完了被BS了~~~~不过个人觉得还是挺有成就感的,毕竟比赛的时候剪枝比那个玩意好想~~~ (0) palmtenor 2005-04-22 23:45:00
    • 按你的方法，我用c++做了一下，ac啦，不过有些还是不懂.... (261) IceAngel 2005-05-27 15:26:58
  • 什么叫没有证明？自己到未名bbs看一下！ (2131) frkstyc 2005-04-22 21:39:56
    • 看了，似乎还是云里雾里的~ (0) palmtenor 2005-04-24 12:35:35