Search found 60 matches

by ayeshapakhi
Fri Jul 06, 2007 4:55 pm
Forum: Volume 111 (11100-11199)
Topic: 11148 - Moliu Fractions
Replies: 19
Views: 12450

hi...

my acc one gives..

Code: Select all

8/11
220-4/5
36/55
4-4/5
1/230
>>I think there's no such input.
220-4/5
0
There should be no input like test 6.. because denominator is 0 here..
by ayeshapakhi
Wed Jul 04, 2007 12:31 pm
Forum: Volume 7 (700-799)
Topic: 766 - Sum of powers
Replies: 14
Views: 7385

there's only two specifications...
and these are enough..

Code: Select all

Numbers should be separated by one space.
Print a blank line between datasets.
1st one requires that there'll be no spaces after the last number in a line.

hope these help..
by ayeshapakhi
Thu Jun 21, 2007 7:07 pm
Forum: Volume 4 (400-499)
Topic: 429 - Word Transformation
Replies: 82
Views: 17886

hello...

i didn't see ur code...but ur program gives output for

Code: Select all

2

aaa
bbb
aab
aba
abb
a
b
*
aab bbb

abc
abd
aaa
aab
abb
*
abb aab
abc abd
aab bbb

Code: Select all

aab abb 1

abb aab 1
abb abb 0
aab abb 1
:roll: is it correct??
by ayeshapakhi
Wed Jun 20, 2007 6:43 pm
Forum: Volume 103 (10300-10399)
Topic: 10347 - Medians
Replies: 32
Views: 14248

hello...

change....

Code: Select all

cout<<"-1"<<'\n'; 
to

Code: Select all

cout<<"-1.000"<<'\n'; 
by ayeshapakhi
Tue Jun 19, 2007 9:31 am
Forum: Volume 4 (400-499)
Topic: 412 - Pi
Replies: 104
Views: 18439

hello...

convert all float to double and change..

Code: Select all

if(count)
         printf("%.6f\n",res);    
into

Code: Select all

if(count)
         printf("%lf\n",res);    

hope it helps...
by ayeshapakhi
Mon Jun 18, 2007 9:48 am
Forum: Volume 112 (11200-11299)
Topic: 11228 - Transportation system.
Replies: 30
Views: 13159

Adrian Kuegel wrote: You can use Prim's algorithm, which can be implemented in O(n^2) using O(n) memory for this problem. hmm... i used kruskal's algo for this prob... ..but one thing.... i can't understand :oops: if i use prim's algo... it needs a queue... of memory of size O(N*N)... isn't it?? or ...
by ayeshapakhi
Thu Jun 14, 2007 9:50 am
Forum: Volume 112 (11200-11299)
Topic: 11226 - Reaching the fix-point.
Replies: 23
Views: 10416

hello...

try these.

input

Code: Select all

10
2 2
3 2
2 3
2 100
100 101
300 300
1000 1000
10001 1000
500000 500000
100 500000
output

Code: Select all

Case #1:
1
Case #2:
1
Case #3:
1
Case #4:
6
Case #5:
5
Case #6:
2
Case #7:
4
Case #8:
11
Case #9:
3
Case #10:
14
by ayeshapakhi
Thu Jun 14, 2007 9:25 am
Forum: Volume 112 (11200-11299)
Topic: 11228 - Transportation system.
Replies: 30
Views: 13159

Thanks to all for the explanation.... I didn't missinterprete the rounding specification.. my problem is in finding the number of states. However, i'll fix it. Edit: got it accepted... but it took huge time... i wonder how rio and other people got acc with such short time and using a little memory!!...
by ayeshapakhi
Wed Jun 13, 2007 12:07 pm
Forum: Volume 4 (400-499)
Topic: 497 - Strategic Defense Initiative
Replies: 144
Views: 21817

O(n^2) solution is ok for this problem.....
ur problem is elsewhere.
by ayeshapakhi
Wed Jun 13, 2007 11:28 am
Forum: Volume 112 (11200-11299)
Topic: 11228 - Transportation system.
Replies: 30
Views: 13159

I'm having WA in this prob..
confused about a point.. why do Little Joey's and asif_rahman0's outputs differ??

please explain this.. :roll:
by ayeshapakhi
Tue Jun 12, 2007 9:02 pm
Forum: Volume 112 (11200-11299)
Topic: 11220 - Decoding the message.
Replies: 54
Views: 20875

probably there's no such things.. try this input 2 The first line of input gives the number of cases T one less than or equals to T less than or equals to thirty then there is a blank line before the first test case Each test case represents a message which is composed by one less than or equals to ...
by ayeshapakhi
Tue Jun 12, 2007 8:25 pm
Forum: Volume 112 (11200-11299)
Topic: 11223 - O: dah dah dah!
Replies: 43
Views: 19124

ur printing more spaces between words when it is not necessary...

make ur ans right for sample i.o ...
by ayeshapakhi
Wed May 23, 2007 3:47 pm
Forum: Volume 9 (900-999)
Topic: 974 - Kaprekar Numbers
Replies: 32
Views: 11968

hi there!!

I think u should remove the Kaprekar numbers from ur posts...
otherwise spoilers will take the chance :oops: ..................
.............................
by ayeshapakhi
Wed May 23, 2007 7:46 am
Forum: Volume 111 (11100-11199)
Topic: 11196 - Birthday Cake
Replies: 2
Views: 4589

11196 - Birthday Cake

Hello.. I'm trying to solve the prob birthday cake... used backtracking to find the radii and heights.. My procedure's taking huge time.. abt 2:45 mins in my machine for the input 100000 10.. :oops: :( In a particular level i calculated the maximum remaining volume and the minimum remaining volume a...
by ayeshapakhi
Mon May 21, 2007 9:26 am
Forum: Volume 112 (11200-11299)
Topic: 11201 - The problem of the crazy linguist
Replies: 21
Views: 10027

WA.....

Someone please provide some test cases..
i got wa.. used brute force to find answer....

regards...

Go to advanced search