POJ_1659 Frogs' Neighborhood

http://poj.org/problem?id=1659

#include<iostream>#include<algorithm>using namespace std;struct node{int i,x;}map[10];int cmp(const void *a,const void *b){return ((*(node*)b).x -(*(node*)a).x);}int main(){//freopen("in.txt","r",stdin);int t,n,i,k,j;int visit[10][10];cin>>t;bool flag;while(t--){flag=true;memset(visit,0,sizeof(visit));cin>>n;for(i=0;i<n;i++){cin>>map[i].x;map[i].i=i;}for(i=0;i<n;i++){qsort(map,n,sizeof(node),cmp);k=map[0].x;map[0].x=0;if(k<=0)break;for(j=1;j<=k;j++){map[j].x--;if(map[j].x<0){flag=false;break;}else{visit[map[0].i][map[j].i]=visit[map[j].i][map[0].i]=1;}}if(flag==false)break;}if(flag){printf("YES/n");for(i=0;i<n;i++){for(j=0;j<n;j++)printf("%d ",visit[i][j]);printf("/n");}}elseprintf("NO/n");printf("/n");}return 0;}