A1103: DFS
#include<iostream>
#include<vector>
using namespace std;
vector<int> fac,temp,ans;
int n,p,k,maxnbottom=-1;
int power(int x)
{
int ans=1;
while(p!=0)
{
ans*=x;
p--;
}
return ans;
}
void init()
{
int temp=0,i=0;
while(temp<=n)
{
fac.push_back(temp);
temp=power(++i);
}
}
void DFS(int index, int Nown, int sum, int num)
{
if(sum==n && Nown==k)
{
if(num>maxnbottom)
{
maxnbottom=num;
ans=temp;
}
return ;
}
if(sum>n || Nown>k)
return ;
if(index-1>=0)
{
temp.push_back(index);
DFS(index,Nown+1,sum+fac[index],num+index);
temp.pop_back();
DFS(index-1,Nown,sum,num);
}
}
int main()
{
cin >> n >> k >> p;
init();
DFS(fac.size()-1,0,0,0);
if(maxnbottom==-1)
cout << "Impossible" << endl;
else
{
printf("%d = %d^%d",n,ans[0],p);
for(int i=1; i<ans.size(); i++)
{
printf(" + %d^%d",ans[i],p);
}
}
return 0;
}
这里有个小问题:
#include<iostream>
#include<vector>
using namespace std;
vector<int> fac,temp,ans;
int n,p,k,maxnbottom=-1;
int power(int x)
{
int ans=1;
while(p!=0)
{
ans*=x;
p--;
}
return ans;
}
void init()
{
int temp=0,i=0;
while(temp<=n)
{
fac.push_back(temp);
temp=power(++i);
}
}
int main()
{
cin >> n >> k >> p;
init();
return 0;
}
A1091 BFS
#include<iostream>
#include<queue>
using namespace std;
int n,m,slice,T;
int a[1290][129][61];
int xx[6]={1,-1,0,0,0,0};
int yy[6]={0,0,1,-1,0,0};
int zz[6]={0,0,0,0,1,-1};
struct node
{
int x,y,z;
}Node;
bool inq[1290][129][61]={false};
bool judge(int x, int y, int z)
{
if(x<0 || x>=n || y<0 || y>=m || z<0 || z>=slice)
return false;
if(a[x][y][z]==0 || inq[x][y][z]==true)
return false;
return true;
}
int BFS(int x, int y, int z)
{
queue<node> q;
int ans=0;
Node.x=x;
Node.y=y;
Node.z=z;
inq[x][y][z]=true;
q.push(Node);
while(!q.empty())
{
node top=q.front();
q.pop();
ans++;
for(int i=0; i<6; i++)
{
int newx=top.x+xx[i];
int newy=top.y+yy[i];
int newz=top.z+zz[i];
if(judge(newx,newy,newz))
{
Node.x=newx;
Node.y=newy;
Node.z=newz;
q.push(Node);
inq[newx][newy][newz]=true;
}
}
}
if(ans>=T)
return ans;
else
return 0;
}
int main()
{
cin >> n >> m >> slice >> T;
for(int z=0; z<slice; z++)
for(int i=0; i<n; i++)
for(int j=0; j<m; j++)
{
cin >> a[i][j][z];
}
int all=0;
for(int z=0; z<slice; z++)
for(int i=0; i<n; i++)
for(int j=0; j<m; j++)
{
if(a[i][j][z]==1 && inq[i][j][z]==false)
all+=BFS(i,j,z);
}
cout << all;
}