Search found 19 matches

by Shuvra(CSE-BUET)
Fri Sep 01, 2006 11:15 pm
Forum: Volume 2 (200-299)
Topic: 218 - Moth Eradication
Replies: 60
Views: 10490

Pls help us

I am very much astonished why I get WA always. I also checked every input from other threads. Now I am posting only my main fn here. Pls tell me what is wrong?My graham scan function is 100% OK and I got acc in other programs. It sorts in ccwise . So I print from backward. After convex hull I insert...
by Shuvra(CSE-BUET)
Fri Sep 01, 2006 5:06 pm
Forum: Volume 100 (10000-10099)
Topic: 10065 - Useless Tile Packers
Replies: 22
Views: 5908

I am really stuck

I can't realise how to calculate wasted area , which interbal points I have to consider and how. Pls explain me.
by Shuvra(CSE-BUET)
Fri Sep 01, 2006 3:14 pm
Forum: Volume 100 (10000-10099)
Topic: 10002 - Center of Masses
Replies: 59
Views: 26363

Thanks ,for your reply Martin.

Thanks Martin for reply. I have just got acc after 2 day's utmost efforts. I have changed my code from O(n*n) to O(n*log(n)) and acc in 1.07 secs. What can I say for you all that , geometry is very interesting ,don't neglect this type of problems. Here 3 points can be collinear. Graham scan is must ...
by Shuvra(CSE-BUET)
Fri Sep 01, 2006 7:38 am
Forum: Volume 109 (10900-10999)
Topic: 10930 - A-Sequence
Replies: 102
Views: 31893

I can't understand

Hi, I don't understand what u say. You say that 200 500 600 900 is not an A sequence, as 200 + 900 = 500 + 600. But from prob 'For this problem an A-sequence is a sequence of positive integers ai satisfying 1 ≤ a1 < a2 < a3 < ... and every ak of the sequence is not the sum of two or more distinct ea...
by Shuvra(CSE-BUET)
Thu Aug 31, 2006 2:10 pm
Forum: Volume 109 (10900-10999)
Topic: 10930 - A-Sequence
Replies: 102
Views: 31893

Waaaaaaa

My code gives nasty WA.... Help me pls.(Posting code is bad I know) ........................................................................................................ #include <stdio.h> bool a[1020]; long p[1200]; void main(){ long cas=1,i,j,x,prev; int flag; while(scanf("%ld",&x)==1){ prev=0;...
by Shuvra(CSE-BUET)
Thu Aug 31, 2006 1:54 pm
Forum: Volume 105 (10500-10599)
Topic: 10505 - Montesco vs Capuleto
Replies: 73
Views: 37121

I am so sorry to all

I am a new poster and all that I can say that my inexperience caused this problem. I shall try to avoid posting same topic in a new thread next time.
by Shuvra(CSE-BUET)
Thu Aug 31, 2006 12:17 pm
Forum: Volume 100 (10000-10099)
Topic: 10002 - Center of Masses
Replies: 59
Views: 26363

i am getting WA for many times and I am hung

I have no way but to post my code. Anybody there to help , why I am getting WA after 8.898 secs , also pls help how to speed up? I used Graham Scan of CORMEN and read all the previous posts about this prob. My code is a bit long ,but understandable. .....................................................
by Shuvra(CSE-BUET)
Thu Aug 31, 2006 12:11 pm
Forum: Volume 100 (10000-10099)
Topic: 10065 - Useless Tile Packers
Replies: 22
Views: 5908

hey

Thanks Mr. Martin Macko. But is it the answer of my question? I read all the previous posts about it.
by Shuvra(CSE-BUET)
Thu Aug 31, 2006 7:01 am
Forum: Volume 100 (10000-10099)
Topic: 10065 - Useless Tile Packers
Replies: 22
Views: 5908

10065(USELESS TILE PACKERS) stuck in this prob

I used graham scan to solve the prob and code is correct as I got acc in other probs. But what makes me crazy is that calculation of wasted area. While graham scanning ,wasted area =sum of (negetive area),i.e clockwise turn. I am posting the code segment of convex hull function now . hh saves hull p...
by Shuvra(CSE-BUET)
Thu Aug 24, 2006 4:01 pm
Forum: Volume 102 (10200-10299)
Topic: 10208 - Liar or Not Liar that is the...
Replies: 13
Views: 2931

10208(Liar or not Liar) Helppppppppp

I found the problem very odd. I can't understand how to solve this. How can prime factorization help me here? I could not find the pattern. It is not possible like prob. 106 to generate and check x,y,z tripple. Funny thing is that Shahriar Manzoor has a very big heart ,and so always deals with very ...
by Shuvra(CSE-BUET)
Wed Aug 23, 2006 6:37 am
Forum: Volume 100 (10000-10099)
Topic: 10036 - Divisibility
Replies: 37
Views: 10843

10036(DIVISIBILTY) WA , mad judge?

Hey, what's the hell there?I can't find any tricky input ,and what I think is absolutely right. I read all the previous posts. But I am too fool realise what is my mistake. Pls help me. (I tried also with a newline after the last case .Don't tell me about this.) ........................................
by Shuvra(CSE-BUET)
Tue Aug 22, 2006 5:07 am
Forum: Volume 7 (700-799)
Topic: 796 - Critical Links
Replies: 54
Views: 22486

796 ,WA = wrong articulation , helppp.

Hey. I got WA but I used almost the same code for Articulation point and got acc.Anybody here or all sleeping? Help me please. .......................................................................................................... #include <stdio.h> struct a { int d,c,data,p,l,f; }g[1005][1005]; ...
by Shuvra(CSE-BUET)
Thu Aug 17, 2006 6:58 pm
Forum: Volume 5 (500-599)
Topic: 524 - Prime Ring Problem
Replies: 74
Views: 19082

WA ring

Thanks Kallol for ur reply. I have now tried with that possibility also. But I got WA after 1.143 secs again.
by Shuvra(CSE-BUET)
Wed Aug 16, 2006 12:11 pm
Forum: Volume 103 (10300-10399)
Topic: 10305 - Ordering Tasks
Replies: 59
Views: 21438

10305(Ordering Tasks) WA makes me mad

I don't know why this type of normal topological sort gives me WA after .002 secs for 5 times. If the algo is right there is not even any necessity to check several inputs. But I tried all the inputs posted before but could not find out the bug. Now plssssssssssssss check my code and help me. .........
by Shuvra(CSE-BUET)
Tue Aug 15, 2006 7:08 am
Forum: Volume 105 (10500-10599)
Topic: 10505 - Montesco vs Capuleto
Replies: 73
Views: 37121

10505(Montesco vs Copuleto)WA is my enemy

Hi .I read the previous posts and now very upset as I tried all inputs posted and got the right answer. Now would you please check my code and say what is wrong there? .......................................................................................................................................

Go to advanced search