Search found 16 matches

by babor
Thu Jan 22, 2004 1:31 pm
Forum: Volume 104 (10400-10499)
Topic: 10490 - Mr. Azad and his Son!!!!!
Replies: 20
Views: 10095

Hai there is a very well known formula in "number theory ".

if p is a prime & 2^p -1 is a prime then (2^p-1)*(2^p -1 ) is a
perfect number . And this is the solution.
Thanks
by babor
Thu Jan 22, 2004 1:22 pm
Forum: Volume 104 (10400-10499)
Topic: 10424 - Love Calculator
Replies: 137
Views: 38654

Hai guy,
I didn't analyze ur code but I also suffered much with this problem.
I think you should be conscious abt taking input. And you have to
check the condition fulfilled (I did mistake on proble specification).

I am not sure abt ur mistake.
Thanks.
by babor
Thu Jan 22, 2004 1:05 pm
Forum: Volume 104 (10400-10499)
Topic: 10463 - Aztec Knights
Replies: 35
Views: 11060

I think the problem is very simple.
I used simple BFS with some condition to solve the problem .

I think the problem involves with negetive input & then we have to avoid it. Thanks :D
by babor
Thu Jan 22, 2004 1:04 pm
Forum: Volume 104 (10400-10499)
Topic: 10463 - Aztec Knights
Replies: 35
Views: 11060

I think the problem is very simple.
I used simple BFS with some condition to solve the problem .

I think the problem involves with negetive input & then we have to avoid it. Thanks :wink:
by babor
Wed Dec 17, 2003 5:46 pm
Forum: Volume 103 (10300-10399)
Topic: 10331 - The Flyover Construction
Replies: 19
Views: 4874

10331- Wa

Hai everybody,
I got wa at 10331 Flyover construction.
Any hints or advice to avoid this .
Thanks in advance
by babor
Mon Nov 03, 2003 2:30 pm
Forum: Volume 103 (10300-10399)
Topic: 10324 - Zeros and Ones
Replies: 179
Views: 42862

It may be for negative co-ordinate .
by babor
Mon Nov 03, 2003 2:21 pm
Forum: Volume 104 (10400-10499)
Topic: 10489 - Boxes of Chocolates
Replies: 28
Views: 8062

Hai find modulas at each and every step tot avoid time limit & overflow
by babor
Wed Oct 08, 2003 10:14 am
Forum: Algorithms
Topic: Any idea abt Edge list
Replies: 1
Views: 1550

Any idea abt Edge list

Hai, Any Idea abt Edge list. Can anybody explain it when or how we
have to use it??
Thanks. Every poster
by babor
Sun Oct 05, 2003 6:26 am
Forum: Volume 103 (10300-10399)
Topic: 10307 - Killing Aliens in Borg Maze
Replies: 54
Views: 17493

10307 Decreasing Runtime

Hai, I have got Ac this problem in 8.4 second. But I saw in Ranklist that
some people got it Ac within .01 second. Any idea for decreasing running time . What thype of Algorithm u used. Please give me hints.
by babor
Wed Sep 24, 2003 7:35 am
Forum: Volume 3 (300-399)
Topic: 315 - Network
Replies: 68
Views: 21091

Reda the new problem description.
by babor
Wed Sep 24, 2003 6:56 am
Forum: Volume 100 (10000-10099)
Topic: 10041 - Vito's Family
Replies: 90
Views: 29447

Hai, at first sort the aray[];
then find median for even or odd number of total thing.
then use median to calculate. :wink:
by babor
Wed Sep 17, 2003 7:14 am
Forum: Volume 3 (300-399)
Topic: 314 - Robot
Replies: 30
Views: 6346

Hai, friend I think you didnot consider that at the "destination " at any direction the cost may be shortest. So u have to check all four direction's
cost which is minimum. Thanks
by babor
Mon Sep 15, 2003 11:15 am
Forum: Volume 104 (10400-10499)
Topic: 10494 - If We Were a Child Again
Replies: 55
Views: 17066

10494

Hai guies I am fool at wa of 10494. is my function wrong or where is wrong handling. My code is /* /* @JUDGE_ID: XXXXXX 10494 C++ */ #include <stdio.h> #include <string.h> #define MAX 100000 unsigned long Modulas(char a[],unsigned long denomi) { unsigned long rim,len,i; rim = (a[0] - 48 )%denomi; le...
by babor
Mon Sep 15, 2003 11:02 am
Forum: Volume 105 (10500-10599)
Topic: 10508 - Word Morphing
Replies: 35
Views: 12010

10508

I have got RTE: . Please say me array size .or give me some hints. here is my code:- /* /* @JUDGE_ID: XXXXX 10508 C++ */ #include <stdio.h> #include <string.h> #define size 10000 // is it cover char input[size][52]; bool morphed(char s1[], char s2[]); void main() { int total,count,i,character; char ...
by babor
Mon Sep 15, 2003 11:01 am
Forum: Volume 105 (10500-10599)
Topic: 10521 - Continuously Growing Fractions
Replies: 17
Views: 6182

10521

Hai I am getting wa can anyone help me. Here is my code. /* /* @JUDGE_ID: XXXXXX 10521 C++ */ #include <stdio.h> void main() { unsigned long long numar,denomi,temp; long i,counter; while(scanf("%llu %llu",&numar,&denomi)==2) { printf("%llu/%llu = %llu",numar,denomi,numar/denomi); counter = 0; temp =...

Go to advanced search