Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

请那位大虾看一看吧，BBS上提供的数据都能通过，为什么就是WA呢？求求您哪！我将铭记您的大德！

Posted by 2004huangyimin at 2005-07-22 13:55:06 on Problem 1014

我是这样想的：凡是超过2的我都将它%2，最后只剩下诸如1 0 1 0 0 0之类的，然后求和，我只要和数为偶的这些能divided都一一枚举出来即可.可是这样却WA，郁闷啊啊~~
#include<iostream>
using namespace std;
void main()
{
	int A[6],i,sum,onenum;
	int static num=0;
	while(1)
	{
		sum=0;onenum=0;
		for(i=0;i<6;i++)
		{
			cin>>A[i];
		}
		if(A[0]==0&&A[1]==0&&A[2]==0&&A[3]==0&&A[4]==0&&A[5]==0)
		{break;}
        for(i=0;i<6;i++)
		{
			A[i]=(A[i]%2);
			if(A[i]==1){onenum++;}
			sum=(A[i]*(i+1))+sum;
		}
		if(sum%2==0)
		{
			if(onenum==0)
			{   
				cout<<"Collection #"<<++num<<":"<<endl;
				cout<<"Can be divided.";
			}
			else if(onenum==3)
			{
				if(A[0]==0&&A[2]==0&&A[4]==0)
				{cout<<"Collection #"<<++num<<":"<<endl;
				cout<<"Can be divided.";
				}
			   else
				for(i=0;i<6;i++)
				{
					if(A[i]*(i+1)==(sum/2))
					{
					 cout<<"Collection #"<<++num<<":"<<endl;
				     cout<<"Can be divided.";
					 break;
					}
				}
			}
	
	      else if(onenum==4)
		  {
			  if(A[0]==0&&A[4]==0&&A[3]==0&&A[5]==0)
			  {cout<<"Collection #"<<++num<<":"<<endl;
				     cout<<"Can't be divided.";
			  }
			  else
			  {
				  cout<<"Collection #"<<++num<<":"<<endl;
				  cout<<"Can be divided.";
			  }
		  }
          else if(onenum==5)
		  {
                 cout<<"Collection #"<<++num<<":"<<endl;
				 cout<<"Can be divided.";
		  }
		  else
		  { 
		          cout<<"Collection #"<<++num<<":"<<endl;
	              cout<<"Can't be divided.";
		  }
		}
	    else
		{ 
		cout<<"Collection #"<<++num<<":"<<endl;
	    cout<<"Can't be divided.";
		}
	    cout<<endl;
	}
	
}

Followed by:

Re:请那位大虾看一看吧，BBS上提供的数据都能通过，为什么就是WA呢？求求您哪！我将铭记您的大德！ (11) palmtenor 2005-07-22 15:08:26
- 你这个随便就举出反例子了 (15) palmtenor 2005-07-22 15:08:50
这个我用流氓的模六搜过了，树形DP是正解，有人证明了模一个什么东西是正确的，但你的模二实在离谱，想过的话模六++，想好好练做DP (1800) sunmoonstar_love 2005-07-22 20:11:40
- %6是你碰对了，取模是不行的 (0) frkstyc 2005-07-22 20:12:36
  - 已经知道了，未名上是什么证明？上不去 (0) sunmoonstar_love 2005-07-22 20:15:20
    - 那个版已经被合并了，你去搜acm_algo这个版的精华吧 (0) frkstyc 2005-07-22 20:16:17
      - 外校IP现在能上么？ (0) sunmoonstar_love 2005-07-22 20:21:55
        可以吧，不能登陆 (0) frkstyc 2005-07-22 20:37:01
        试过了，上不去 (0) sunmoonstar_love 2005-07-22 20:39:21
        我贴过来 (1400) frkstyc 2005-07-22 20:41:44
        谢谢，这兄弟数理推理好强 (1508) sunmoonstar_love 2005-07-22 20:53:08
        Re:我贴过来 (12) ldxf2006 2008-09-18 12:01:45
        Re:我贴过来 (292) nrg1984 2008-09-28 09:33:35
        拜一个 Orz ,踩着别人的石头才勉强过河~~ (1508) passgod 2008-10-10 19:54:17
        Re:我贴过来 (1514) Mandolin23 2010-04-06 20:49:39
        Re:按这个思路 0 5 0 0 4 0 过不了，证明里面哪有问题？ (0) Mandolin23 2010-04-07 16:21:41
        Re:按这个思路 0 5 0 0 4 0 过不了，证明里面哪有问题？ (141) bbbbbbbbba 2010-06-28 20:41:27
        Re:我贴过来 (1508) zhepeng123 2016-11-22 17:21:53
Re:请那位大虾看一看吧，BBS上提供的数据都能通过，为什么就是WA呢？求求您哪！我将铭记您的大德！ (1800) javawin 2010-08-04 16:24:47

Post your reply here:

User ID:
Password:
Title:

Content:

> 我是这样想的：凡是超过2的我都将它%2，最后只剩下诸如1 0 1 0 0 0之类的，然后求和，我只要和数为偶的这些能divided都一一枚举出来即可.可是这样却WA，郁闷啊啊~~
> #include<iostream>
> using namespace std;
> void main()
> {
> 	int A[6],i,sum,onenum;
> 	int static num=0;
> 	while(1)
> 	{
> 		sum=0;onenum=0;
> 		for(i=0;i<6;i++)
> 		{
> 			cin>>A[i];
> 		}
> 		if(A[0]==0&&A[1]==0&&A[2]==0&&A[3]==0&&A[4]==0&&A[5]==0)
> 		{break;}
>         for(i=0;i<6;i++)
> 		{
> 			A[i]=(A[i]%2);
> 			if(A[i]==1){onenum++;}
> 			sum=(A[i]*(i+1))+sum;
> 		}
> 		if(sum%2==0)
> 		{
> 			if(onenum==0)
> 			{   
> 				cout<<"Collection #"<<++num<<":"<<endl;
> 				cout<<"Can be divided.";
> 			}
> 			else if(onenum==3)
> 			{
> 				if(A[0]==0&&A[2]==0&&A[4]==0)
> 				{cout<<"Collection #"<<++num<<":"<<endl;
> 				cout<<"Can be divided.";
> 				}
> 			   else
> 				for(i=0;i<6;i++)
> 				{
> 					if(A[i]*(i+1)==(sum/2))
> 					{
> 					 cout<<"Collection #"<<++num<<":"<<endl;
> 				     cout<<"Can be divided.";
> 					 break;
> 					}
> 				}
> 			}
> 	
> 	      else if(onenum==4)
> 		  {
> 			  if(A[0]==0&&A[4]==0&&A[3]==0&&A[5]==0)
> 			  {cout<<"Collection #"<<++num<<":"<<endl;
> 				     cout<<"Can't be divided.";
> 			  }
> 			  else
> 			  {
> 				  cout<<"Collection #"<<++num<<":"<<endl;
> 				  cout<<"Can be divided.";
> 			  }
> 		  }
>           else if(onenum==5)
> 		  {
>                  cout<<"Collection #"<<++num<<":"<<endl;
> 				 cout<<"Can be divided.";
> 		  }
> 		  else
> 		  { 
> 		          cout<<"Collection #"<<++num<<":"<<endl;
> 	              cout<<"Can't be divided.";
> 		  }
> 		}
> 	    else
> 		{ 
> 		cout<<"Collection #"<<++num<<":"<<endl;
> 	    cout<<"Can't be divided.";
> 		}
> 	    cout<<endl;
> 	}
> 	
> }
> 
> 			 
> 
> 
> 
> 	
> 
> 			 
>

Home Page Go Back To top