## Search found 70 matches

Sat Apr 16, 2005 6:17 pm
Forum: Volume 8 (800-899)
Topic: 880 - Cantor Fractions
Replies: 24
Views: 17612

Hi Sumanker,
Very late replay !!! . I dont know wheither u read or not. Well, long long is enough for this problem. Thankx.
Sat Apr 16, 2005 6:05 pm
Forum: Volume 101 (10100-10199)
Topic: 10105 - Polynomial Coefficients
Replies: 16
Views: 4746

### Hi

Hi Murkho,
I think ur algo is not ok. Ya, u needs factorial upto 12 but not in this way. Try to find out the algo from any mathematical site like mathworld etc.. And one thinks 1!=1, and 0!=1 and there is no output of 0. Hope it helps. Good Luck.
Sat Apr 16, 2005 3:15 pm
Forum: Volume 101 (10100-10199)
Topic: 10112 - Myacm Triangles
Replies: 13
Views: 5686

### Pro

Hi prince,
Sorry, i've edited my previous post. If u can then plz send me some I/O. Thanks for ur look.
Thu Apr 14, 2005 9:13 am
Forum: Volume 101 (10100-10199)
Topic: 10112 - Myacm Triangles
Replies: 13
Views: 5686

### 10112 - Myacm Triangles

Hi,
Please give me some input/output for the problem 10112 Myacm Triangle. I'm getting WA . Thanks in advance.
Mon Mar 28, 2005 6:27 pm
Forum: Volume 1 (100-199)
Topic: 102 - Ecological Bin Packing
Replies: 485
Views: 51436

### Hi,

Hi, I think ur minimum cost generating calculation is not ok. This is a easy problem. Well there is six combination right ? so just check in which combination u get the minimum value and flag those combination. At last print the minimum value and those combination. Hope it helps. Dont make it comple...
Mon Mar 28, 2005 6:02 pm
Forum: Volume 4 (400-499)
Topic: 488 - Triangle Wave
Replies: 270
Views: 31822
Hi, This is a multiple input problem right ? And u always print new line after each output. Then what happend with the last output ??? The will be print one extra new line after last output, that should not be happened. So replace by this --> Must be at the last line, if(tcase) // last output tcase=...
Mon Mar 21, 2005 6:22 pm
Forum: Volume 108 (10800-10899)
Topic: 10812 - Beat the Spread!
Replies: 35
Views: 18173

### Re

Hi taborda, Lets see an example :- x=15,y=12 then x+y=27 (odd) and x-y=3 (odd) then if u do 27/2=13.5 and 3/2=1.5 all the result is fraction now we see that there is no two integer(not fraction) which summation is X and difference is Y, thats why we check it for even. So for this input output should...
Mon Mar 14, 2005 6:57 pm
Forum: Volume 103 (10300-10399)
Topic: 10346 - Peter's Smokes
Replies: 46
Views: 16389

Hi,
First of all i think the problem number is 10347 not 10346. Well from first look of ur code i get one mistake done by u. When the output will be
-1 then u print int part. You have to print -1.000. Hope it helps. Good Luck.

just use ->
printf("-1.000\n");
Mon Mar 14, 2005 5:51 pm
Forum: Volume 100 (10000-10099)
Topic: 10042 - Smith Numbers
Replies: 75
Views: 23525

### Output

Cut.
Mon Mar 14, 2005 5:51 pm
Forum: Volume 100 (10000-10099)
Topic: 10042 - Smith Numbers
Replies: 75
Views: 23525

### Output

Hi,

22
27
58
4937775
4937818
1000000165
31639
Good Luck.
Sun Mar 13, 2005 4:55 pm
Forum: Volume 4 (400-499)
Topic: 412 - Pi
Replies: 104
Views: 18327

### Again

Hi,
Please dont post your AC code. You have post lots of your ACC code which is not a good work.
Sun Mar 13, 2005 3:00 pm
Forum: Volume 6 (600-699)
Topic: 674 - Coin Change
Replies: 77
Views: 26311

### ??

Hi,
I think Sohel is right. Its very bad practice to post any AC code. You can post critical input/output, some hints,any topics related with that problem but not the AC code.
Fri Mar 11, 2005 9:25 am
Forum: Off topic (General chit-chat)
Topic: What is ur minimum time to generate prime in 20000000 ?
Replies: 28
Views: 7795
Hi Codemaker,
Are u ok ? 27 sec ?????? Is your time generation code is ok ? If u use simple sieve of erathosthenecs then u can get those prime 2.812 sec. If u generate prime by bit then u time will be small enough. Think abt it.
Fri Mar 11, 2005 9:04 am
Forum: Volume 4 (400-499)
Topic: 482 - Permutation Arrays
Replies: 159
Views: 32128

### Help

Hi chops, I think in this problem you only need sort. Nothing else. Here is some hints. 1. For this problem structure will be the best approach i think. Build a structure with two elements, index and num. 2. At first input index value until u get new line. Something like.. while(ch!='\n') { cin>>.s[...
Fri Mar 11, 2005 8:48 am
Forum: Volume 100 (10000-10099)
Topic: 10042 - Smith Numbers
Replies: 75
Views: 23525

### ?

Hi, The problem is basically easy problem. Read the following if you face any problem. 1. You have to find a smith number greater than the given input 2. A prime number is not a smith number. So escape calculation while u get a prime number 3. For each number that is not prime chcek digit sum of the...