Search found 48 matches

by mukit
Tue Dec 30, 2008 1:18 pm
Forum: Volume 110 (11000-11099)
Topic: 11063 - B2-Sequence
Replies: 73
Views: 40479

Re: 11063 - B2-Sequence

To rehan,
After each test case you must print a blank line.
and to samin,
For Input :

Code: Select all

2
2 10
Output :

Code: Select all

Case #1: It is a B2-Sequence.

For both of you , check the board first and remove your code after AC.
by mukit
Thu Dec 25, 2008 3:17 pm
Forum: Volume 110 (11000-11099)
Topic: 11062 - Andy's Second Dictionary
Replies: 38
Views: 18616

Re: 11062 - Andy's Second Dictionary

Ok, forget my previous post. I got it AC using STL (set).
One line is important.
The hyphen character is part of the word if, and only if, not followed by a newline.
And it seems the input data is weak.
by mukit
Tue Dec 23, 2008 7:07 pm
Forum: Volume 115 (11500-11599)
Topic: 11561 - Getting Gold
Replies: 31
Views: 10035

Re: 11561 - Getting Gold

Thank's a lot emotional blind. That was the case I caught. :D
Now rank 12 in this problem.
by mukit
Tue Dec 23, 2008 6:34 pm
Forum: Volume 110 (11000-11099)
Topic: 11062 - Andy's Second Dictionary
Replies: 38
Views: 18616

Re: 11062 - Andy's Second Dictionary

Hi, I'm getting WA in this problem. Please give some I/O ... #include<stdio.h> #include<string.h> #include<ctype.h> #include<stdlib.h> #define _null '\0' char word[505][10011]; char data[505][10011]; char buf[99999]; int sort_func(const void *a,const void *b) { return (strcmp((char*)a,(char*)b)); } ...
by mukit
Tue Dec 23, 2008 1:03 pm
Forum: Volume 115 (11500-11599)
Topic: 11561 - Getting Gold
Replies: 31
Views: 10035

Re: 11561 - Getting Gold

whatever, I updated my code using scanf instead of cin. But still WA. Someone please give some I/O.

Code: Select all

Cut ...
Thank's in advance.
by mukit
Mon Dec 22, 2008 1:07 pm
Forum: Volume 109 (10900-10999)
Topic: 10928 - My Dear Neighbours
Replies: 13
Views: 8235

Re: 10928 - My Dear Neighbours

Ok forget that. Got AC. But one thing... for misof's input 2 2 1 2 13 10 11 12 13 11 12 13 11 12 13 11 12 13 11 12 13 11 12 13 11 12 13 11 12 13 11 12 13 11 12 13 1 2 3 4 1 2 3 4 1 2 3 4 output will be, 1 2 2 3 4 5 6 7 8 9 10 So just a newline '\n' (not a blank line) after every case including the l...
by mukit
Mon Dec 22, 2008 12:41 pm
Forum: Volume 109 (10900-10999)
Topic: 10928 - My Dear Neighbours
Replies: 13
Views: 8235

Re: 10928 - My Dear Neighbours

I'm getting WA in this problem :(
Please give some I/O.

Code: Select all

Got Acc ...
Thank's in advance.
by mukit
Mon Dec 22, 2008 9:15 am
Forum: Volume 115 (11500-11599)
Topic: 11561 - Getting Gold
Replies: 31
Views: 10035

Re: 11561 - Getting Gold

sorry, i don't understand. :(
Here I indicated 'L' as the position where there is a gold beside a trap.
So, after getting gold it increments it's counter and return's back to avoid trap.
by mukit
Mon Dec 22, 2008 8:49 am
Forum: Volume 115 (11500-11599)
Topic: 11561 - Getting Gold
Replies: 31
Views: 10035

Re: 11561 - Getting Gold

but my maze size is 53 (maze[53][53]) larger than given limit (3 to 50). First I set all element of maze to 0 (using memset).
So when maze[i+1][j] is called, this dosen't exceed maze. Could please explain ?
by mukit
Mon Dec 22, 2008 8:30 am
Forum: Volume 115 (11500-11599)
Topic: 11561 - Getting Gold
Replies: 31
Views: 10035

Re: 11561 - Getting Gold

Could you please explain ?
I started value of i and j from 1.
by mukit
Mon Dec 22, 2008 7:53 am
Forum: Volume 115 (11500-11599)
Topic: 11561 - Getting Gold
Replies: 31
Views: 10035

11561 - Getting Gold

Hi, I'm getting W.A in this problem. Please give some I/O.

Code: Select all

Cut ...
Thank's in advance.
by mukit
Tue Dec 16, 2008 8:29 pm
Forum: Volume 109 (10900-10999)
Topic: 10905 - Children's Game
Replies: 66
Views: 26067

Re: 10905 - Children’s Game

i'm getting WA in this problem. please give some critical input-output or suggestion.

Code: Select all

ok AC after changing array size 
:wink:
by mukit
Mon Nov 17, 2008 6:09 am
Forum: Volume 115 (11500-11599)
Topic: 11505 - Logo
Replies: 8
Views: 5528

Re: WA-11505-LOGO

Getting WA

Please give some I/O

Code: Select all

Cut ...

Thanks to helloneo :D.
by mukit
Wed Sep 10, 2008 12:10 pm
Forum: Volume 114 (11400-11499)
Topic: 11463 - Commandos
Replies: 18
Views: 10352

Re: 11463 - Commandos

My approach was first finding the most distant node and then calculating the distance of this from the meeting node
and then sum them.
However thanks a lot to Shamim vi. I got AC now. :D
by mukit
Tue Sep 09, 2008 5:04 pm
Forum: Volume 114 (11400-11499)
Topic: 11463 - Commandos
Replies: 18
Views: 10352

Re: 11463 - Commandos

Hi, I am getting W.A in this problem.
Someone please help.

Code: Select all


Removed after AC.

Thanks in advance to all.

Go to advanced search