ZOJ - 1204 Additive equations(搜索)
来源:互联网 发布:淘库网络怎么样 编辑:程序博客网 时间:2024/06/02 07:31
Additive equations
Time Limit: 10 Seconds Memory Limit: 32768 KB
We all understand that an integer set is a collection of distinct integers. Now the question is: given an integer set, can you find all its addtive equations? To explain what an additive equation is, let's look at the following examples:
1+2=3 is an additive equation of the set {1,2,3}, since all the numbers that are summed up in the left-hand-side of the equation, namely 1 and 2, belong to the same set as their sum 3 does. We consider 1+2=3 and 2+1=3 the same equation, and will always output the numbers on the left-hand-side of the equation in ascending order. Therefore in this example, it is claimed that the set {1,2,3} has an unique additive equation 1+2=3.
It is not guaranteed that any integer set has its only additive equation. For example, the set {1,2,5} has no addtive equation and the set {1,2,3,5,6} has more than one additive equations such as 1+2=3, 1+2+3=6, etc. When the number of integers in a set gets large, it will eventually become impossible to find all the additive equations from the top of our minds -- unless you are John von Neumann maybe. So we need you to program the computer to solve this problem.
Input
The input data consists of several test cases.
The first line of the input will contain an integer N, which is the number of test cases.
Each test case will first contain an integer M (1<=M<=30), which is the number of integers in the set, and then is followed by M distinct positive integers in the same line.
Output
For each test case, you are supposed to output all the additive equations of the set. These equations will be sorted according to their lengths first( i.e, the number of integer being summed), and then the equations with the same length will be sorted according to the numbers from left to right, just like the sample output shows. When there is no such equation, simply output "Can't find any equations." in a line. Print a blank line after each test case.
Sample Input
33 1 2 33 1 2 56 1 2 3 5 4 6
Output for the Sample Input
1+2=3Can't find any equations.1+2=31+3=41+4=51+5=62+3=52+4=61+2+3=6
继续练搜索,不过此题我没有想到一个更好的搜索方法,让搜索完毕后的答案顺序满足题目要求的。。。于是我还是在搜索完毕后再进行一次排序,用了vector<vector<int> >,注意后两个>>之间要有个空格或者/**/, 280ms, 960kb通过
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int set[31];
int curr;
int x[31];
bool flag;
vector<vector<int> > result;
void dfs(int i,int len,int n)
{
if(i==len)
{
if(curr==n)
{
flag=true;
vector<int> v;
int s=0;
for(int k=0;k<len;++k)
if(x[k])
{
v.push_back(x[k]);
s+=x[k];
}
v.push_back(s);
result.push_back(v);
}
}
else
{
if(curr+set[i]<=n)
{
x[i]=set[i];
curr+=set[i];
dfs(i+1,len,n);
x[i]=0;
curr-=set[i];
}
dfs(i+1,len,n);
}
}
bool com(const vector<int> &a,const vector<int> &b)
{
if(a.size()>b.size())return false;
else if(a.size()<b.size())return true;
for(int i=0;i<a.size()-1;++i)
if(a[i]>b[i])return false;
else if(a[i]<b[i])return true;
}
int main()
{
int t,n;
cin>>t;
while(t--)
{
cin>>n;
curr=0;flag=false;
for(int i=0;i<n;++i)
cin>>set[i];
for(int i=1;i<n;++i)
for(int j=n-1;j>=i;j--)
if(set[j]<set[j-1])
{
int tem=set[j-1];
set[j-1]=set[j];
set[j]=tem;
}
for(int i=2;i<n;++i)
dfs(0,i,set[i]);
if(flag)
{
sort(result.begin(), result.end(), com);
for(int i=0;i<result.size();++i)
{
int j;
for(j=0;j<result[i].size()-1;++j)
{
if(j==0)cout<<result[i][j];
else cout<<"+"<<result[i][j];
}
cout<<"="<<result[i][j]<<endl;
}
result.clear();
}
else cout<<"Can't find any equations."<<endl;
cout<<endl;
}
return 0;
}
- ZOJ - 1204 Additive equations(搜索)
- ZOJ 1204 Additive equations
- ZOJ 1204Additive equations
- zoj - 1204 - Additive equations
- ZOJ 1204 Additive equations
- ZOJ 1204 Additive equations
- ZOJ 1204 Additive equations
- zoj 1204 Additive equations
- zoj 1204 Additive equations
- zoj 1204 Additive equations
- ZOJ 1204Additive equations
- ZOJ 1204 Additive equations
- ZOJ 1204 Additive equations
- ZOJ 1204 Additive equations
- ZOJ 1204(Additive equations)
- Additive equations 1204 (搜索)
- ZOJ 1204 Additive equations (回溯)
- ZOJ-1204 Additive equations (DFS)
- Justin_第1组_2009.4.3
- Justin_第1组_2009.4.7
- Justin_第1组_2009.4.8
- CEGUI学习笔记
- 绝伦科比!
- ZOJ - 1204 Additive equations(搜索)
- Ubuntu Linux Wubi 安装过程
- Homework-电子商务发展存在的问题
- AT&T提前行动 美国两大移动巨头展开4G大战
- 让IE和Firefox都支持innerText(textContent )
- 我的第一篇日志
- 2009.5.30 OA 项目组一周工作报告
- My Holder interface for bean and set management
- 话说程序员的职业生涯