Search found 106 matches

by Raiyan Kamal
Sun Jul 24, 2005 12:15 pm
Forum: Volume 3 (300-399)
Topic: 333 - Recognizing Good ISBNs
Replies: 166
Views: 22496

hey, where did the headers go ? Anyways, I have found your bug. Compare your output with my output. Hope this will help. INPUT: 0-89237-010-6 0-89237-010-----6 0-8-9-2-3-7-010-6 0-8306-3637-4 0-06-017758-6 This_is_garbage 1-56884-030-6 0-8230-2571-3 0-345-31386-0 0-671-88858-7 0-8104-5687-7 0-671-74...
by Raiyan Kamal
Sun Jul 24, 2005 11:53 am
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 42595

I did it with array of linked lists. I made a node class and a linked list class. The procedures were mostly manipulation of pointers. Make sure you understand what pile-over, pile-onto, move-over and move-onto means. When you are moving a over b, you will have to put all the blocks above a back to ...
by Raiyan Kamal
Sat Jul 16, 2005 12:23 am
Forum: Volume 5 (500-599)
Topic: 531 - Compromise
Replies: 73
Views: 26338

resopnse to little joey

little joey, I know its very very late already, but i could not resist the temptation of posting a Bangla translation. chashi der ay jono-protinidhi der kachhe shat mohor bishishto pustok shorup er protikarer jonno shokol vortuki aain otishottor porimarjon korte hobe # ay ebong shompottir upor aropk...
by Raiyan Kamal
Fri Jul 15, 2005 9:36 pm
Forum: Volume 104 (10400-10499)
Topic: 10405 - Longest Common Subsequence
Replies: 103
Views: 29999

Why do you need the b[][] array ? The problem does not ask you to print LCS, just print the length of the LCS.
by Raiyan Kamal
Thu Jul 14, 2005 10:51 pm
Forum: Volume 101 (10100-10199)
Topic: 10192 - Vacation
Replies: 58
Views: 14864

No need to make size 1000. I got AC using 105.
by Raiyan Kamal
Thu Jul 14, 2005 10:29 pm
Forum: Volume 101 (10100-10199)
Topic: 10192 - Vacation
Replies: 58
Views: 14864

We are supposed to discuss problems of Voluem 3 here, not 101.
by Raiyan Kamal
Tue Jun 07, 2005 1:38 pm
Forum: Volume 4 (400-499)
Topic: 416 - LED Test
Replies: 34
Views: 10158

I hope Sedefcho has already solved the problem. As Sedefcho said, since "this is the only thread dedicated to problem 416", i am posting some explanation for the future sufferers. The status of the 7 LEDs is given for some count down sequence and we have to determine if this is a valid countdown seq...
by Raiyan Kamal
Mon May 30, 2005 8:43 pm
Forum: Volume 5 (500-599)
Topic: 551 - Nesting a Bunch of Brackets
Replies: 56
Views: 12451

My output is same as Jagadish.
by Raiyan Kamal
Tue Apr 19, 2005 3:23 pm
Forum: Volume 102 (10200-10299)
Topic: 10235 - Simply Emirp
Replies: 150
Views: 32008

Your program says,
2 is not prime.
by Raiyan Kamal
Thu Apr 14, 2005 6:05 pm
Forum: Volume 105 (10500-10599)
Topic: 10591 - Happy Number
Replies: 61
Views: 21162

Dear Bugmans, Are you sure you got WA with this code ? I think you are supposed to get Compile error because of these two lines: freopen("10591i.txt","r",stdin); freopen("10591o.txt","w",stdout); I assume these two lines dont exist in your submitted code. Then have a look at this part, if(IsHappyNum...
by Raiyan Kamal
Thu Apr 14, 2005 5:06 pm
Forum: Volume 7 (700-799)
Topic: 726 - Decode
Replies: 36
Views: 10009

Congratulations ! You are welcome. Are you sure this case is wrong ? This output is generated by my accepted code. I assumed that if a char does not appear then its frequency is zero. So i order and then map the chars with zero frequency too, did not ignore them. But i think, the judge input has all...
by Raiyan Kamal
Thu Apr 14, 2005 8:42 am
Forum: Volume 7 (700-799)
Topic: 726 - Decode
Replies: 36
Views: 10009

my ordering is like this : If two chars have different frequency then they are ordered accordig to the frequencly. else ( they have same frequency ) they are ordered lexicographically To arrange according to frequency, the char with higher frequency comes before the char with lower frequency. For ex...
by Raiyan Kamal
Wed Apr 13, 2005 8:35 pm
Forum: Volume 7 (700-799)
Topic: 726 - Decode
Replies: 36
Views: 10009

I tried to compile and run your code on my computer using VC++, but it crashed. Something wrong with your code or is it my computer ? Anyways, here are some test cases case1: the quick brown fox jumped over the lazy dog. thE quicK browN foX jumpeD oveR thE lazY doG. thE quicK browN foX jumpeD oveR t...
by Raiyan Kamal
Fri Apr 08, 2005 4:28 am
Forum: Volume 5 (500-599)
Topic: 551 - Nesting a Bunch of Brackets
Replies: 56
Views: 12451

Dear Mahmud776, one of the sample cases you have posted here is wrong. for the input ((**)()a+b)[(a){a+n}]( you said the output is NO 20 which is wrong. my AC code gives output NO 21 I guess this is a silly typo. Again, for the case ((**)()a+b)[(a){a+n}](* I considered the last '(*' as one symbol an...
by Raiyan Kamal
Wed Mar 30, 2005 6:20 pm
Forum: Volume 5 (500-599)
Topic: 579 - Clock Hands
Replies: 44
Views: 14269

Dear Lord Nemrod, I tried to compare your code and mine with some test cases, but could not find any difference between the outputs. This is strange that your code is getting WA. Do you mail your code to the OJ ? then try using the submit o matic. The only case where I found your output to differ wi...

Go to advanced search