Search found 17 matches

by Rashad
Mon Mar 28, 2011 6:51 pm
Forum: Volume 111 (11100-11199)
Topic: 11136 - Hoax or what
Replies: 31
Views: 17316

Re: 11136 - Hoax or what

I am getting WA in this problem. :( I don't know whats wrong with my algo. :-? Please give me some I/O. Thaks in advance. :)
by Rashad
Fri Mar 18, 2011 5:58 am
Forum: Volume 7 (700-799)
Topic: 762 - We Ship Cheap
Replies: 51
Views: 19573

Re: 762 - We Ship Cheap

I am getting WA. :cry: Can anyone please give me some i/o?? Thanks in advance.
by Rashad
Tue Jan 11, 2011 6:46 pm
Forum: Volume 119 (11900-11999)
Topic: 11902 - Dominator
Replies: 20
Views: 8893

Re: 11902 - dominator

I am getting WA. :( Can anyone give me some i/o?? Thanks in advance. :)
by Rashad
Fri Dec 17, 2010 6:52 pm
Forum: Volume 116 (11600-11699)
Topic: 11661 - Burger Time?
Replies: 37
Views: 10305

Re: 11661 - Burger Time?

I am getting WA. Please help.
by Rashad
Tue Nov 02, 2010 3:05 pm
Forum: Volume 118 (11800-11899)
Topic: 11850 - Alaska
Replies: 32
Views: 9779

Re: 11850-Alaska

You need not to check at a[0]. a[0]-0 can be greater than 100. if you have a charging station at 0 and at 150 you can travel. you have to check while returning. :wink:
by Rashad
Sat Oct 09, 2010 9:53 am
Forum: Volume 118 (11800-11899)
Topic: 11850 - Alaska
Replies: 32
Views: 9779

Re: 11850-Alaska

Got AC. Thanks Leonid. :)
by Rashad
Wed Oct 06, 2010 5:59 pm
Forum: Volume 118 (11800-11899)
Topic: 11850 - Alaska
Replies: 32
Views: 9779

Re: 11850-Alaska

Should I consider that her journey begins form 0 and ends at 1422? My algo is something like that: I am taking the input in an array & sort it. Then I am checking difference between index 0&1, 1&2, 2&3.... is<=200. Is it correct??
by Rashad
Tue Oct 05, 2010 7:20 pm
Forum: Volume 118 (11800-11899)
Topic: 11850 - Alaska
Replies: 32
Views: 9779

11850 - Alaska

I am getting WA. Can anyone give me any hints. :-?
by Rashad
Sun Oct 03, 2010 3:40 am
Forum: Algorithms
Topic: Please help me this problem. "Longest word"
Replies: 2
Views: 2938

Re: Please help me this problem. "Longest word"

It seems that input will be given once for this problem. Whatever you can solve it while taking input. first read a char from input, if(ch==' '){ //check if str is the longest word or not. If it is copy it into another string lets say str1; //also check this if(!strcmp(str,"E-N-D")) break; } else if...
by Rashad
Sat Oct 02, 2010 5:31 pm
Forum: Volume 101 (10100-10199)
Topic: 10110 - Light, more light
Replies: 76
Views: 25397

Re: 10110 why WA? please any body help me

I think changing "double db" with "unsigned long db" and "db=sqrt(n)" with "db=(unsigned long)sqrt(n)" will do. Hope you got AC by the time.. :)
by Rashad
Mon Sep 27, 2010 5:16 pm
Forum: Volume 7 (700-799)
Topic: 793 - Network Connections
Replies: 102
Views: 29992

Re: 793 - Network Connections

Got AC after 3 TLE and 3 WA. :D
by Rashad
Mon Sep 27, 2010 10:55 am
Forum: Volume 7 (700-799)
Topic: 793 - Network Connections
Replies: 102
Views: 29992

Re: 793 - Network Connections

I tried a lots of input sets and my algo gives correct output but still WA. Is there any thing i am not noticing???? :-?
by Rashad
Fri Sep 24, 2010 4:14 am
Forum: Volume 116 (11600-11699)
Topic: 11686 - Pick up sticks
Replies: 44
Views: 10213

Re: 11686 How can

I tried that. But I was getting WA. Now I got AC. I was making some silly mistakes in initialization. Thanks a lot. :)
by Rashad
Thu Sep 23, 2010 3:46 am
Forum: Volume 116 (11600-11699)
Topic: 11686 - Pick up sticks
Replies: 44
Views: 10213

Re: 11686 How can

I am getting WA. Give me some test case. Thanks in advance.
by Rashad
Thu Sep 23, 2010 3:43 am
Forum: Volume 2 (200-299)
Topic: 200 - Rare Order
Replies: 25
Views: 12477

Re: 200 - Rare Order

I am getting WA in 200. Can anyone give me some I/O. Thanks in advance.

Go to advanced search