Search found 82 matches

by Master
Thu Jun 05, 2003 9:07 pm
Forum: Volume 1 (100-199)
Topic: 102 - Ecological Bin Packing
Replies: 485
Views: 52595

think it easy

your code is learge but the problem is small :wink:

I solve this problem very simple way. there is only 6 type of combination.
check all of them.

use a two dimentional matrix for make it easy.

wish you good luck
by Master
Thu Jun 05, 2003 8:57 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 189534

your code is very clumgy.
try to solve it simply. :lol:
remember ":
simple is smart.
by Master
Thu Jun 05, 2003 8:34 pm
Forum: Volume 6 (600-699)
Topic: 621 - Secret Research
Replies: 45
Views: 19250

Thanks for help.

I made so :o but why :roll: is there any think is in the qustion????????

thanks
M H
by Master
Tue Jun 03, 2003 3:32 pm
Forum: Volume 6 (600-699)
Topic: 621 - Secret Research
Replies: 45
Views: 19250

621- what is the reasult?

what should be the output of the following input:

190135 :roll:

please anyone tell me the reasult?
M H
by Master
Tue May 06, 2003 3:51 pm
Forum: Volume 100 (10000-10099)
Topic: 10050 - Hartals
Replies: 59
Views: 19455

10050 - What is the problem?


Can anyone tell what is the problem with the following two codes? The first one I made and submit a few times and got the WA. Once a day my friend (ZP) came and tells me that he got AC on this problem. So I take his code to find out what is my fault. But I can
by Master
Tue May 06, 2003 3:47 pm
Forum: Volume 1 (100-199)
Topic: 151 - Power Crisis
Replies: 56
Views: 5251

151 - there is some problem in judge end.

Can any one tell me what is the difference between the following codes : Code A #include<stdio.h> #define MAX 150 /** Implementatiom of circular queue **/ int queue[MAX]; int e,f,r; /** _f is front; _r is rear & _e is element number **/ void push(int i) { r++; e++; if(r>=MAX) r=1; queue[r] = i; } i...
by Master
Thu Oct 10, 2002 1:27 pm
Forum: Volume 1 (100-199)
Topic: 112 - Tree Summing
Replies: 137
Views: 14711

112

[/b] How many leaf to root path is in the following tree

22 (5(10()(20))(10()())) :roll:

Go to advanced search