Search found 12 matches

by Kyku
Tue Sep 12, 2006 9:15 pm
Forum: Algorithms
Topic: Which window clicked?
Replies: 0
Views: 908

Which window clicked?

Hello All,

I'm writing a program in which the user selects lots of rectangles. The problem is that when the user clicks the canvas, I'd like to quickly determine which rectangle has been selected. Any ideas as for the algorithm and data structure? TIA
by Kyku
Sat Sep 09, 2006 11:37 pm
Forum: Other words
Topic: Determine which window was clicked.
Replies: 0
Views: 1502

Determine which window was clicked.

Hello All,

I'm writing a program in which the user selects lots of rectangles. The problem is that when the user clicks the canvas, I'd like to quickly determine which rectangle has been selected. Any ideas as for the algorithm and data structure? TIA
by Kyku
Tue Dec 27, 2005 11:48 am
Forum: Off topic (General chit-chat)
Topic: A spam or something?
Replies: 13
Views: 4791

The problem I was mentioning (Super Toy Soldiers), took me one week, some 50 WA and still didn't solve it, so I simply gave up.

BTW 1 / 4 ACs is not that bad, so don't brag ;-)
by Kyku
Thu Dec 22, 2005 12:31 am
Forum: Off topic (General chit-chat)
Topic: A spam or something?
Replies: 13
Views: 4791

Do you think it is just to give the solutions in source code? I faced many problems that I haven't solved, though I tried veerrry hard, and the forum didn't help, either. I know the frustration.
by Kyku
Tue Dec 13, 2005 12:59 am
Forum: Off topic (General chit-chat)
Topic: A spam or something?
Replies: 13
Views: 4791

A spam or something?

I've recently got those two messages

[quote]
Hello, I
by Kyku
Mon May 09, 2005 4:08 pm
Forum: Volume 101 (10100-10199)
Topic: 10103 - Karpovich blocks
Replies: 21
Views: 8247

Abednego wrote:No, there are always exactly 3 pieces. I checked it with an assert().
That's right, thank you. My problems lied in oversimplificated understanding of the problem. Now I managed to solve it with some nice time.
by Kyku
Thu May 05, 2005 8:38 pm
Forum: Volume 101 (10100-10199)
Topic: 10103 - Karpovich blocks
Replies: 21
Views: 8247

Hello, having some troubles with this problem, too.. Is it possible that pieces of the same color are disconnected?
by Kyku
Sat Feb 12, 2005 3:53 pm
Forum: Volume 104 (10400-10499)
Topic: 10418 - Hyper Toy Soldiers
Replies: 4
Views: 2587

What approach did you use? For me, it's very convoluted problem, and I can't even figure out how to start.
by Kyku
Sat Feb 12, 2005 2:21 pm
Forum: Algorithms
Topic: Matching elements of two multisets.
Replies: 1
Views: 804

Matching elements of two multisets.

Hello all, I have an algorithmic problem of making pairs between elements of two multisets (let's call them P and Q) based on a function A: P x Q -> N (N - natural numbers + {0}). Those two multisets are of the same size. Each p must be paired with exactly one q and vice versa. The outcome should be...
by Kyku
Tue Jan 04, 2005 12:12 am
Forum: Volume 6 (600-699)
Topic: 658 - It's not a Bug, it's a Feature!
Replies: 15
Views: 7786

by Kyku
Wed Dec 29, 2004 7:14 pm
Forum: Volume 6 (600-699)
Topic: 658 - It's not a Bug, it's a Feature!
Replies: 15
Views: 7786

Thanks for the tips man, you are my Idol now :) The mistakes were rather stupid. Test cases helped me the most. The real source of the problem was that variable "I" in ShortestPath that I used to index Lengts and Colors arrays was declared as Word, and therefore it couldn't span all the elements. Th...
by Kyku
Wed Dec 29, 2004 3:22 pm
Forum: Volume 6 (600-699)
Topic: 658 - It's not a Bug, it's a Feature!
Replies: 15
Views: 7786

658 - What's so tricky?

I'm having a real trouble with this problem. My solution is based on Dijkstra's algorithm. I think I've tested it thouroughly, but I always get Wrong Answer after a very short time. Could you please give me some hints or test cases that could be tricky? Here's the prog, for the interested, I've put ...

Go to advanced search