## Search found 5 matches

Thu Nov 06, 2008 6:23 am
Forum: Volume 115 (11500-11599)
Topic: 11550 - Demanding Dilemma
Replies: 12
Views: 5440

### Re: 11550 - Demanding Dilemma

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=1;j<=n;j++) if (map[j][i]) { if ...
Wed Nov 05, 2008 6:34 am
Forum: Volume 115 (11500-11599)
Topic: 11550 - Demanding Dilemma
Replies: 12
Views: 5440

### Re: 11550 - Demanding Dilemma

rij wrote:thanks got ac after a number of tries.
can you say more detail?
I still WA...
Mon Nov 03, 2008 2:27 pm
Forum: Volume 115 (11500-11599)
Topic: 11550 - Demanding Dilemma
Replies: 12
Views: 5440

### Re: 11550 - Demanding Dilemma

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...
Thu Oct 02, 2008 12:27 pm
Forum: Volume 115 (11500-11599)
Topic: 11510 - Erdös Unit Fractions
Replies: 2
Views: 2383

### 11510 - Erdös Unit Fractions

I don't know how to solve this problem...I need help...
Thu Oct 02, 2008 12:26 pm
Forum: Volume 115 (11500-11599)
Topic: 11509 - Touring Robot
Replies: 8
Views: 1974

### Re: 11509 - Touring Robot

in this problem a turn means 2*pi