Poj 1014 Dividing
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 47029
Accepted: 11761
Description
Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just split the collection in half. But unfortunately, some of the marbles are larger, or more beautiful than others. So, Marsha and Bill start by assigning a value, a natural number between one and six, to each marble. Now they want to divide the marbles so that each of them gets the same total value. Unfortunately, they realize that it might be impossible to divide the marbles in this way (even if the total value of all marbles is even). For example, if there are one marble of value 1, one of value 3 and two of value 4, then they cannot be split into sets of equal value. So, they ask you to write a program that checks whether there is a fair partition of the marbles.
Input
Each line in the input file describes one collection of marbles to be divided. The lines contain six non-negative integers n1 , . . . , n6 , where ni is the number of marbles of value i. So, the example from above would be described by the input-line "1 0 1 2 0 0". The maximum total number of marbles will be 20000. The last line of the input file will be "0 0 0 0 0 0"; do not process this line.
Output
For each collection, output "Collection #k:", where k is the number of the test case, and then either "Can be divided."or "Can't be divided.". Output a blank line after each test case.
Sample Input
1 0 1 2 0 0
1 0 0 0 1 1
0 0 0 0 0 0
Sample Output
Collection #1:
Can't be divided.
Collection #2:
Can be divided.
Source
Mid-Central European Regional Contest 1999 가방 문제
#include<stdio.h>
#include<string.h>
int v[120001];
int a[7];
int main(void)
{
int i,j,k,s,tmp,flag,t=1;
// freopen("d:\\in.txt","r",stdin);
while(1)
{
s=0;
flag=0;
for(i=1;i<=6;i++)
{
scanf("%d",&a[i]);
s+=a[i]*i;
if(a[i])
flag=1;
}
if(!flag)
break;
printf("Collection #%d:
",t++);
memset(v,0,sizeof(v));
v[0]=1;
if(!(s%2))
{
for(i=1;i<=6;i++)
{
tmp=1;
while(a[i]>=tmp)
{
for(j=s;j>=tmp*i;j--)
{
if(v[j-tmp*i])
v[j]=1;
}
a[i]-=tmp;
tmp*=2;
}
if(a[i])
for(j=s;j>=a[i]*i;j--)
if(v[j-a[i]*i])
v[j]=1;
}
if(v[s/2])
printf("Can be divided.
");
else
printf("Can't be divided.
");
}
else
printf("Can't be divided.
");
}
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
java에서 InputStream, String, File 간의 상호 전환 비교InputStream, String, File 상호 전환 1. String --> InputStream 2. InputStream --> String 오늘 인터넷에서 또 다른 방법을 보았는데, 특별히 가지고 와서 공...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.