Search found 36 matches

by deena sultana
Mon Nov 12, 2007 3:29 pm
Forum: Volume 112 (11200-11299)
Topic: 11260 - Odd Root Sum
Replies: 22
Views: 11377

THANKS jan.
yes, the sqrt is doing something wrong :(
i will do binary search and also i will switch to VC :-)

thanks again.
by deena sultana
Wed Nov 07, 2007 7:43 pm
Forum: Volume 112 (11200-11299)
Topic: 11260 - Odd Root Sum
Replies: 22
Views: 11377

prolem with 11260 (WA)

Hi,
my program works fine upto n=1000000000, but greater than this its getting overflow, my pc is not able to handle 64bit integer, so, i can not fix up where the overflow is occurring. i've used long long as my programs i/p.

After submission i got WA :(
now, what can i do? plzzz help :cry:
by deena sultana
Tue Nov 06, 2007 5:12 pm
Forum: Volume 113 (11300-11399)
Topic: 11335 - Discrete Pursuit
Replies: 15
Views: 5789

Hint: consider x and y component separately.
Wow! this hint is simply great! who r trying to solve 11335, plz think about it and have a pretty solution :-)
thanks to sohel. thanks to sclo too.
by deena sultana
Tue Nov 06, 2007 12:01 pm
Forum: Volume 113 (11300-11399)
Topic: 11335 - Discrete Pursuit
Replies: 15
Views: 5789

yes, i understand :(
it was a stupid algorithm :roll:
sorry :(
by deena sultana
Mon Nov 05, 2007 1:19 pm
Forum: Volume 113 (11300-11399)
Topic: 11335 - Discrete Pursuit
Replies: 15
Views: 5789

ops sorry for my incomplete description :P
i've calculated the Manhattan distance, and also considered the current speed. but, in case of tie i 've chosen the 1st one :-S (may be this is the fault, no?)
by deena sultana
Mon Nov 05, 2007 12:58 pm
Forum: Volume 113 (11300-11399)
Topic: 11335 - Discrete Pursuit
Replies: 15
Views: 5789

well, my algorithm is like this... 1. for t=0, the object's position is (0,0) and u=0, v=0 and the thief's position is (a,0), as the problem states. 2. then for t=1 the object will move at the position from where the distance of the thief's current position (at t=1) is minimum; 3. repeat this proces...
by deena sultana
Sun Nov 04, 2007 5:58 pm
Forum: Volume 113 (11300-11399)
Topic: 11335 - Discrete Pursuit
Replies: 15
Views: 5789

need sample i/o

Can anyone give some sample i/o for 11335, plzzz? i am getting WA
:cry:
by deena sultana
Fri Jun 30, 2006 11:34 pm
Forum: Volume 3 (300-399)
Topic: 371 - Ackermann Functions
Replies: 196
Views: 28661

i m really a stupid!
Thanks my dear friend.

its AC now :D
by deena sultana
Fri Jun 30, 2006 10:00 pm
Forum: Volume 100 (10000-10099)
Topic: 10070 - Leap Year or Not Leap Year and ...
Replies: 233
Views: 53759

Sohel,

u r really gr8.
i m thanking u 4m my heart.

i get AC at last . thank u so much. :D
by deena sultana
Fri Jun 30, 2006 9:33 pm
Forum: Volume 100 (10000-10099)
Topic: 10070 - Leap Year or Not Leap Year and ...
Replies: 233
Views: 53759

Still WA

dear sohel,
thanks for ur help. i was very much cofused abt that line.
now i made a correction but still it's gettin WA.

sohel, thanks again.

i dont know what to do. Any1 help me again?

my correction copy is here:

Code: Select all

	removed after AC

	
plz help, plzzzzzzzzzz.
by deena sultana
Fri Jun 30, 2006 1:29 pm
Forum: Volume 100 (10000-10099)
Topic: 10070 - Leap Year or Not Leap Year and ...
Replies: 233
Views: 53759

10070,WA & WA &....!!!

hi,
i m getting wa in the 10070 for several times. i did some corrections bt still it is WA. :roll:
Any1 there 2 help me, plz?

here is my code:

Code: Select all

	removed

	
I need ur help.
by deena sultana
Fri Jun 30, 2006 1:27 pm
Forum: Volume 100 (10000-10099)
Topic: 10070 - Leap Year or Not Leap Year and ...
Replies: 233
Views: 53759

10070,WA & WA &....!!!

hi, i m getting wa in the 10070 for several times. i did some corrections bt still it is WA. :roll: Any1 there 2 help me, pz? here is my code: #include<iostream> #include<stdio.h> #include<string.h> #include<stdlib.h> #include<math.h> using namespace std; int main() { int flag,count,len,n1,n2,n3,n4,...
by deena sultana
Fri Jun 30, 2006 1:18 pm
Forum: Volume 3 (300-399)
Topic: 371 - Ackermann Functions
Replies: 196
Views: 28661

WHY WA!!! 371

dear friends. i dont know why i m getting WA again n again for 371. my i/o seems correct to me. so where is the fault! i need help. plz help me,plzzzzzzzz. :cry: #include<iostream> #include<algorithm> using namespace std; long long int ackermann(long long int x) { long long int len=0; while(x>1) { i...
by deena sultana
Fri Jun 30, 2006 1:16 pm
Forum: Volume 3 (300-399)
Topic: 371 - Ackermann Functions
Replies: 196
Views: 28661

WHY WA!!! 371

dear friends. i dont know why i m getting WA again n again for 371. my i/o seems correct to me. so where is the fault! i need help. plz help me,plzzzzzzzz. :cry: #include<iostream> #include<algorithm> using namespace std; long long int ackermann(long long int x) { long long int len=0; while(x>1) { i...
by deena sultana
Thu Jun 29, 2006 9:04 pm
Forum: Volume 105 (10500-10599)
Topic: 10533 - Digit Primes
Replies: 108
Views: 31755

Sohel n Mamun,

thank u soooooooooooo much.

At last i get AC. :D .

So kind of u both.

Thanks again.

Go to advanced search