Search found 100 matches

by Kallol
Tue Jul 04, 2006 3:03 pm
Forum: Volume 110 (11000-11099)
Topic: 11001 - Necklace
Replies: 38
Views: 16898

Thanx a lot Martin Macko, I finally got ACC. It was just a mistake of a symbol but it made me so crazy and wasted a lot of my time . I think this has become a regular event for me. I think about a problem get the solution way and then code it but do not get ACC for some silly reasons.Anyway you were...
by Kallol
Tue Jul 04, 2006 2:39 pm
Forum: Volume 105 (10500-10599)
Topic: 10533 - Digit Primes
Replies: 108
Views: 31253

Well, I also got ACC in that problem but thats not what i am bothered about but its the timing . It took me 2.090 CPU and what I found in the list that people solved it much more efficiently . My algo is as same as it was told here. Can anyone tell me whether there is a better algorithm to solve thi...
by Kallol
Thu Jun 29, 2006 11:19 am
Forum: Volume 3 (300-399)
Topic: 378 - Intersecting Lines
Replies: 48
Views: 15055

I am getting crazy :evil: what is the problem with my code?? It passed all sample tests I found here . Still getting WA . :cry: Can anyone help me????? here is my code .. #include<stdio.h> #include<math.h> int main(void) { register long double x1,y1,x2,y2,x3,y3,x4,y4,a1,b1,c1,a2,b2,c2,l,xh,yh,x,y; r...
by Kallol
Wed Jun 28, 2006 1:20 pm
Forum: Volume 104 (10400-10499)
Topic: 10420 - List of Conquests
Replies: 68
Views: 25691

Well. I was actually confused watching the name of the thread ! Why shoulf one help a problem like this. This is a nice problem . I solved this using a binary tree. If u get a new input u find it in the tree, left or right according to dictionary , and if found , add its frequency else create a new ...
by Kallol
Sun Jun 18, 2006 9:14 am
Forum: Volume 110 (11000-11099)
Topic: 11015 - 05-2 Rendezvous
Replies: 48
Views: 16699

I used Dijkstra to solve this problem ..
The answers of the test cases were right but I got WA when I submitted.

Is Dijkstra not the proper algorithm here ??
by Kallol
Thu Jun 15, 2006 9:21 pm
Forum: Volume 110 (11000-11099)
Topic: 11001 - Necklace
Replies: 38
Views: 16898

I cant get any clue :-?

I got correct output for all the inputs posted in this thread ....still WA !! :cry:

would anyone check my code, please ?

Code: Select all

removed after AC
by Kallol
Tue Jun 13, 2006 5:01 pm
Forum: Volume 108 (10800-10899)
Topic: 10880 - Colin and Ryan
Replies: 45
Views: 27849

well
all the test cases posted here in this thread give right answer with my prog , still I got WA :cry:

is there someone to check my code please ??

Code: Select all

removed after acc
by Kallol
Sat Nov 19, 2005 8:09 pm
Forum: Volume 109 (10900-10999)
Topic: 10959 - The Party, Part I
Replies: 37
Views: 18120

Oh~ That line is check code. I will delete when I submit it. And why the outputs are 1 & 2 I thought it was 1 & (can't wrote it) The order of the dances doesn't matter. Even if 2 danced with 1 before 1 danced with Don Guilianni, the D. G. number of 2 is still 2. hey my code does print right those t...
by Kallol
Sat Nov 19, 2005 7:50 pm
Forum: Volume 109 (10900-10999)
Topic: 10959 - The Party, Part I
Replies: 37
Views: 18120

Soarer wrote:
ayon wrote:did i write bf? i think it's bfs(breadth first search), not bf(boyfriend).
I am new to C++ so i don't know bfs as well, can you kindly tell me what it is? thanks.
Well , u may use internet to know abou bfs, its not a tough one....the book of Cormen is also cool :D
by Kallol
Sat Nov 19, 2005 7:46 pm
Forum: Volume 109 (10900-10999)
Topic: 10959 - The Party, Part I
Replies: 37
Views: 18120

Yap, bfs does the trick, but i am confused .... whats the prob with my code? I got WA :-? here is my c code : #include<stdio.h> unsigned long P[1010]; unsigned long a[1005][1005]; void setP(unsigned long n) { unsigned long i; P[0]=0; for(i=1;i<n;i++) { P =2000; } return; } void refresh(unsigned long...

Go to advanced search