OJ Board

I still WA....I need help... void prepare() { scanf("%d%d",&n,&m); for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) flag[i][j]=false; for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) scanf("%d",&map[i][j]); } bool work() { for (int i=1;i<=m;i++) { int u=-1,v=-1; for (int j=...

rij wrote:thanks got ac after a number of tries.

can you say more detail?
I still WA...

I WA too...-_-!
but I can't understand your code on:if(arr[j]=='1'&& i!=j)count++;
why do you check if i!=j? I think it doesn't need...

I don't know how to solve this problem...I need help...

in this problem a turn means 2*pi