Search found 94 matches

by the LA-Z-BOy
Mon Aug 02, 2004 12:44 pm
Forum: Volume 105 (10500-10599)
Topic: 10568 - n Group k
Replies: 9
Views: 2753

thank you very much .. for your reply... so i must have trouble with generating the groups... ( COUNT n,k shouldn't have any other crucial test cases... as my input seems to cover all types) as the outputs are long enough i can't post some ins or outs for GENERATE n,k in this board... so i've to fin...
by the LA-Z-BOy
Mon Aug 02, 2004 11:49 am
Forum: Volume 105 (10500-10599)
Topic: 10568 - n Group k
Replies: 9
Views: 2753

give me some outputs

what is the correct output for this set of data? COUNT 1 1 COUNT 10 11 COUNT 30 1 COUNT 30 2 COUNT 30 3 COUNT 30 4 COUNT 30 5 COUNT 30 6 COUNT 30 7 COUNT 30 8 COUNT 30 9 COUNT 30 10 COUNT 30 11 COUNT 30 12 COUNT 30 13 COUNT 30 14 COUNT 30 15 COUNT 30 16 COUNT 30 17 COUNT 30 18 COUNT 30 19 COUNT 30 2...
by the LA-Z-BOy
Mon May 10, 2004 8:13 pm
Forum: Volume 2 (200-299)
Topic: 291 - The House Of Santa Claus
Replies: 19
Views: 7014

there are total 44 valid configurations. you have missed a lot of them. the first one you've missed in lexicographic order is
123451352
hope you'll get the others now.
thank you.
by the LA-Z-BOy
Mon May 10, 2004 4:23 am
Forum: Volume 6 (600-699)
Topic: 673 - Parentheses Balance
Replies: 243
Views: 47424

yah, i'm from BUET. i know UTTAM too.
cheers
by the LA-Z-BOy
Fri May 07, 2004 2:40 pm
Forum: Volume 6 (600-699)
Topic: 673 - Parentheses Balance
Replies: 243
Views: 47424

hi, your outputs are okay.
some tricky cases to think of:

Code: Select all

3
()()(((
<blank line>
()())))
output is:

Code: Select all

No
Yes
No
thank you.
by the LA-Z-BOy
Fri Apr 23, 2004 11:28 am
Forum: Volume 105 (10500-10599)
Topic: 10582 - ASCII Labyrinth
Replies: 18
Views: 10778

I think it should be four , because the number of solution counts as whether one can turn the pieces in such a way that the patterns form a line connecting some edge of the top left square and some edge of the bottom right square of the board. so the four solutions would be... +---+ | * | |** | | | ...
by the LA-Z-BOy
Tue Mar 09, 2004 11:25 am
Forum: Volume 1 (100-199)
Topic: 191 - Intersection
Replies: 103
Views: 18974

to Almost Human : As UFP2161 already figured out from the problem statement, the definition of intersection is The line is said to intersect the rectangle if the line and the rectangle have at least one point in common. In the sample you mentioned, all the points of the line is common with the recta...
by the LA-Z-BOy
Thu Feb 26, 2004 4:39 pm
Forum: Volume 6 (600-699)
Topic: 612 - DNA Sorting
Replies: 122
Views: 16952

If two or more strings are equally sorted, list them in the same order they are in the input file. Actually, at first you were doing the reverse thing, that is list the strings in reversed order when they are equally .... So in the previous code, the sort function would have been [cpp]int sort_func...
by the LA-Z-BOy
Wed Feb 04, 2004 6:48 pm
Forum: Volume 6 (600-699)
Topic: 615 - Is It A Tree?
Replies: 71
Views: 23948

hello, well, there's isn't much tricky inputs i guess. the ONLY tricky ( yet described in the problem statement) is an input with zero nodes. input 0 0 and the output should be trivial, tree . the real PROBLEM is the index of nodes isn't bound to small limits. the node indices even can be >10000. so...
by the LA-Z-BOy
Tue Jan 06, 2004 9:55 pm
Forum: Volume 104 (10400-10499)
Topic: 10446 - The Marriage Interview :-)
Replies: 17
Views: 9726

hello, your problem is here...[cpp] for(b=1;b<61;b++)trib(61,b);[/cpp] when you call something like trib(61,2) ... your function tries to access table[61][2] which is illegal(array out of bound), because you declared[cpp]typedef unsigned long long ll; ll table[61][61];[/cpp] change this to[cpp] for(...
by the LA-Z-BOy
Wed Dec 31, 2003 3:02 pm
Forum: Volume 105 (10500-10599)
Topic: 10582 - ASCII Labyrinth
Replies: 18
Views: 10778

One tricky input could have been +---+ | | |** | | * | +---+ where Number of solutions: 4 (or what else?).. but it is NOT present in the input data ;). btw. the second input given by titid_gede isn't valid i think... 1 1 +---+ | * | | * | | * | +---+ because as the problem states... all the patterns...
by the LA-Z-BOy
Mon Oct 13, 2003 11:06 am
Forum: Volume 103 (10300-10399)
Topic: 10324 - Zeros and Ones
Replies: 179
Views: 44569

for p10340 (All in All): 1. buffers are too small... take something upto 1000000 (that's what i took, lesser might work. but never with 1000 at least!) 2. still another mistake is in your checking function. try to find it... for this you must fail for input... abbbbbbc abcccccccccccccccccc where you...
by the LA-Z-BOy
Sat Sep 06, 2003 4:15 pm
Forum: Volume 101 (10100-10199)
Topic: 10100 - Longest Match
Replies: 95
Views: 21350

Output for your input:

Code: Select all

 1. Length of longest match: 2
 2. Blank!
 3. Length of longest match: 0
 4. Length of longest match: 0
 5. Length of longest match: 0
by the LA-Z-BOy
Mon Jul 28, 2003 2:13 pm
Forum: Volume 3 (300-399)
Topic: 358 - Don't Have A Cow
Replies: 52
Views: 10996

Hello Dominik
i have Managed to figure out few mistakes in your code, i've sent the modified one via private msg.
thanks
Istiaque Ahmed
by the LA-Z-BOy
Sun Jul 27, 2003 11:24 am
Forum: Volume 4 (400-499)
Topic: 455 - Periodic Strings
Replies: 73
Views: 17451

shouldn't the main() method be public? moreover this is a multiple input problem... you're not handling it accordingly. the input is formed something like this.. 3 Hello HoHoHo ByeByeByeNot so you have to track blank lines at each input block... [java] public static void main(String[] args) { int mu...

Go to advanced search