Search found 154 matches

by Mohammad Mahmudur Rahman
Mon Sep 03, 2007 9:59 pm
Forum: Volume 112 (11200-11299)
Topic: 11269 - Setting Problems
Replies: 26
Views: 10876

Ya, the problem was set as an easy dp problem. So, the constraint is set so that the obvious state dp solution can pass the time limit. If you have any question about that then well, no one is stopping you from getting it accepted by using the greedy solution. So, there shouldn't be any problem.
by Mohammad Mahmudur Rahman
Sat Sep 01, 2007 8:03 pm
Forum: Bugs and suggestions
Topic: 11265 - The Sultan's Problem
Replies: 0
Views: 1934

11265 - The Sultan's Problem

This very important line was missing from the problem statement (also the sample output doesn't depict this last moment change as well) - "print 3 digits after decimal point in output." Sorry for the inconvenience. We'll try to rejudge the contest submissions with a special corrector program if poss...
by Mohammad Mahmudur Rahman
Wed Oct 25, 2006 9:34 pm
Forum: Off topic (General chit-chat)
Topic: National Taiwan University=>PG the Evil
Replies: 3
Views: 3436

Ingenious, no doubt about that 8)...IMHO it has a good chance of being what you are probably thinking cause as soon as I saw 'PG the evil', only one ellaboration struck my mind, which I think is very much obvious. :roll:
by Mohammad Mahmudur Rahman
Sat Sep 30, 2006 11:16 am
Forum: Other words
Topic: 2007 world finals IN JAPAN?
Replies: 20
Views: 10544

Final will be on Tokyo.
http://icpc.baylor.edu/icpc/finals/default.htm
Btw, have a look at the schedule -
http://icpc.baylor.edu/icpc/finals/Schedule.htm
Won't there be any java challenge / parallel challenge this year? Nothing is mentioned in the schedule. :o
by Mohammad Mahmudur Rahman
Thu Sep 14, 2006 7:59 pm
Forum: Volume 6 (600-699)
Topic: 676 - Horse Step Maze
Replies: 21
Views: 11661

Thanks for your concern. I'm mailing the code to you. Please have a look... :)
by Mohammad Mahmudur Rahman
Tue Sep 05, 2006 3:59 am
Forum: Volume 110 (11000-11099)
Topic: 11082 - Matrix Decompressing
Replies: 28
Views: 12310

Actually I was stunned to know that the judge solution was written using backtracking, too. But, in fact this is a variant of the assignment problem which has 2 solutions as far as I know. One is the classical flow solution & the other one is a backtracking solution which continously prunes the sear...
by Mohammad Mahmudur Rahman
Sun Sep 03, 2006 4:17 am
Forum: Volume 110 (11000-11099)
Topic: 11082 - Matrix Decompressing
Replies: 28
Views: 12310

Yes, it is (source -> sum of rows) : (rows -> columns) : (sum of columns -> sink). Btw, what did you set as (rows->columns) capacity value?
by Mohammad Mahmudur Rahman
Sat Sep 02, 2006 7:29 pm
Forum: Volume 110 (11000-11099)
Topic: 11082 - Matrix Decompressing
Replies: 28
Views: 12310

I think you are right. I didn't take part in the contest cause I participated in the real-time contest held with this problemset last month. But I solved this problem during the real-time. And now, amazingly the simple Ford-Fulkerson code with that very idea is getting WA. :o :evil:
by Mohammad Mahmudur Rahman
Sat Sep 02, 2006 9:41 am
Forum: Volume 6 (600-699)
Topic: 676 - Horse Step Maze
Replies: 21
Views: 11661

This problem is leaving me completely dumb. Already got about a dozen WAs today though I miserably failed to find a possible reason. It will be greatly helpful if someone who has gotten AC in this one can provide me some sample I/O.
by Mohammad Mahmudur Rahman
Tue Jul 18, 2006 6:48 am
Forum: Algorithms
Topic: Answering ancestor queries in O(1): O(n) preprocessing
Replies: 2
Views: 1587

I'm an idiot. :oops: Thanks a lot
by Mohammad Mahmudur Rahman
Tue Jul 18, 2006 6:08 am
Forum: Algorithms
Topic: Answering ancestor queries in O(1): O(n) preprocessing
Replies: 2
Views: 1587

Answering ancestor queries in O(1): O(n) preprocessing

As a reference, an ancestor query for a tree can be defined as below - ancestor(u,v) = 1, if v is an ancestor of u; -1, if u is an ancestor of v; 0, otherwise; Now, can anyone tell me that if there's a way to answer ancestor queries in O(1) time. Available pre-processing time for an n-node tree is m...
by Mohammad Mahmudur Rahman
Mon Jan 16, 2006 2:21 pm
Forum: Volume 3 (300-399)
Topic: 336 - A Node Too Far
Replies: 121
Views: 39961

Code: Select all

Case 1: 0 nodes not reachable from node 1 with TTL = 0.
by Mohammad Mahmudur Rahman
Mon Jan 16, 2006 2:11 pm
Forum: Other words
Topic: New ranklist format for each problem
Replies: 31
Views: 9737

Nice job. :D
by Mohammad Mahmudur Rahman
Fri Jan 13, 2006 10:42 pm
Forum: Volume 108 (10800-10899)
Topic: 10815 - Andy's First Dictionary
Replies: 116
Views: 30773

That means your program somehow manages to get into an infinite loop which I think not very unlikely in this input format. :roll: You can try my peculiar input strategy for this one. scanf(" %[^ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz]",buf); while(scanf(" %[ABCDEFGHIJKLMNOPQRSTUVWXYZabc...
by Mohammad Mahmudur Rahman
Fri Jan 13, 2006 10:33 pm
Forum: Volume 105 (10500-10599)
Topic: 10508 - Word Morphing
Replies: 35
Views: 12113

Umm, I think I'd better show you several patterns of compare_function to use with qsort() library function. Then you yourself will be able to pick what you actually need. 1. Just beginning from the scratch, suppose you want to sort int a[10]; in ascending order. Your compare function will be like th...

Go to advanced search