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 |
哭死,高手帮忙看看#include<iostream> using namespace std; int mark[202]={0}; int visit[202]; int cow,stall,num; int a[202][202]={0}; int i=0,j=0,x; int t; //用于存cow; void Try(int i) { int pp=0; int sum=0; int e[202]={0}; for(j=0;j<stall;j++) //厩 { if((j==stall-1)&&(a[i][stall-1]==0)&&(i<cow-1)) { Try(i+1); } else { if((a[i][j]>0)&&(mark[j]==0)) { visit[i]=j; //把厩给羊 mark[j]=1; //记录厩已分 sum++; if(i==cow-1) { //e[pp]=sum; //pp++; cout<<sum<<endl; } else Try(i+1); } } visit[i]=-1; mark[j]=0; } //cout<<pp<<" "; //return pp; for(pp=0;e[pp]!=0;pp++) { //cout<<e[pp]<<" "; } } int main() { cin>>cow>>stall; t=cow; while(t--)//t=cow { cin>>num; while(num--) { cin>>x; a[i][x-1]=1; } i++; } /*for(i=0;i<cow;i++) { for(j=0;j<stall;j++) { cout<<a[i][j]<<" ";//每个羊厩为原来的-1 ; } cout<<endl; }*/ Try(0); return 0; } Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator