Search found 145 matches

by Julien Cornebise
Fri Oct 03, 2003 7:46 pm
Forum: Volume 101 (10100-10199)
Topic: 10154 - Weights and Measures
Replies: 60
Views: 39885

Hi ! I finally got AC, but... I don't understand why !! :o I sort by strength then by weight (if strengths are equal), then LIS. This got me AC. But ! I don't understand why my first prog, wich is almost the same but that sort by RESIDUAL STRENGTH instead of strength got WA. I saw that it failed on ...
by Julien Cornebise
Thu Oct 02, 2003 10:48 am
Forum: Other words
Topic: Regional Warmup Contest Shifted to 5th October
Replies: 7
Views: 1906

I guess nobody will mind, and I think that I can assume that I speak for the majority of people here if I tell that we're so grateful to you and all people involved in acm, acm.uva.es, and icpc, to organize all this !!
:D
by Julien Cornebise
Thu Oct 02, 2003 1:00 am
Forum: Volume 100 (10000-10099)
Topic: 10054 - The Necklace
Replies: 62
Views: 30954

Well, I got AC this afternoon. Given that it was my first Eulerian cycle, I was mistaking in the construction of the final cycle from the direct cycles found via dfs.
It's really slow, though (5.7 sec !). Anyone would have a link to a nice implementation of eulerian cucle search please ?
by Julien Cornebise
Wed Oct 01, 2003 7:28 pm
Forum: Volume 100 (10000-10099)
Topic: 10054 - The Necklace
Replies: 62
Views: 30954

I'm having WA too !
My algo is a simple Eulerian cycle on the graph of the colors as vertices and the beads as the edges. Where can I fail please ?
Any idea is welcome :) !
by Julien Cornebise
Tue Sep 30, 2003 7:44 am
Forum: Volume 2 (200-299)
Topic: 243 - Theseus and the Minotaur (II)
Replies: 22
Views: 7303

IMO the problem statement is misleading on this point, if not plain wrong. There had been some ambiguities in the pb statement some time ago about what happened if Minos saw a light in a cavern and turned back while Theseus was precisely coming from this cavern : it wasn't precised wether both of t...
by Julien Cornebise
Mon Sep 29, 2003 9:27 pm
Forum: Volume 2 (200-299)
Topic: 243 - Theseus and the Minotaur (II)
Replies: 22
Views: 7303

I finally got AC !! :D :D Thank you very much Adrian for your wiseful and precious help. For other people, here are the main trap I fall into Theseus and Minotaurus can go back (I forgot that...). One thing more : be extremely precautionous and slow when coding this one, to avoid stupid things as I ...
by Julien Cornebise
Sun Sep 28, 2003 11:43 pm
Forum: Volume 2 (200-299)
Topic: 243 - Theseus and the Minotaur (II)
Replies: 22
Views: 7303

243 - Theseus and the Minotaur (II)

Hi I'm trying to solve 243, but I keep getting Wrong Answer. Only 7 users got it AC ! Is there any special thing to know about the problem ? ANy special case ? Any error in the sample output (such as a '.' to add at the end of the lines, etc), that would not be specified in the sample output and tha...
by Julien Cornebise
Sun Sep 28, 2003 2:30 pm
Forum: Volume 100 (10000-10099)
Topic: 10090 - Marbles
Replies: 43
Views: 22128

I've got exactly the same problem, it's driving me crazy !!
Could anyone who got AC tell us some tricky input, or other tricks to solve this damn one please ??
by Julien Cornebise
Sun Sep 28, 2003 1:02 am
Forum: Volume 105 (10500-10599)
Topic: 10553 - Treasure Map
Replies: 24
Views: 6784

What the program does is to find the points on my way to the treasure the first time I was on the island - findPoints() . [snip] I get WA. I tried also looking for some careless mistake but I couldn't find any. Perfect. Your description enables me to see you're oversight. I think Lain's example wil...
by Julien Cornebise
Sat Sep 27, 2003 3:23 pm
Forum: C++
Topic: the i problem
Replies: 2
Views: 1635

I had the same problem as you, but with the following code : [cpp] // no i global scope variable int main(){ // no i local scope variable for (int i=0; i<150; i++) { // i is only preesnt in the foor loop // work with i; } printf("%d", i); // <---- HERE ! i is used but out of scope return 0; } [/cpp]...
by Julien Cornebise
Sat Sep 27, 2003 2:16 pm
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 6724

epsilon0 wrote:also, my mate Olivier Bery has a solution for this problem without any kind of brute force!
Well, I'll ask him tonight at dinner... The world is small ! He's my teammate ! And didn't even knew he had such a formula :lol:
by Julien Cornebise
Sat Sep 27, 2003 10:12 am
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 6724

Re: hints

here are a few hints: 1] the sum of all integers from 1 to n is n * (n+1) / 2 2] n and n + 1 don't have any common divisor (other than 1). 3] look at the first two couples: Hi ! First, thanks for your answer. I got AC a few days ago, with slicker bruteforce than the basis, but kinda brute anyway. I...
by Julien Cornebise
Sat Sep 27, 2003 10:02 am
Forum: Volume 101 (10100-10199)
Topic: 10194 - Football (aka Soccer)
Replies: 119
Views: 36282

Re: 10194 - Football (aka Soccer)

*Just a few words of mine. *Take #6 into account: Case-insentive Lex. So when all have the same score and names are being considered, both a B b a b B are correct. Dmytro already mentioned this. It might be a cause for stable-sort's failure. I got AC. Thank you for answering :) I already used case ...
by Julien Cornebise
Tue Sep 23, 2003 2:03 pm
Forum: Volume 1 (100-199)
Topic: 138 - Street Numbers
Replies: 93
Views: 6724

Hi

I can't see how the Pell's Equation, as defined in
http://mathworld.wolfram.com/PellEquation.html
can help solve this problem.
I agree that
k^2 = n(n+1)/2
for all (k, n) solutions, but how can Pell's Equations do help please ?
by Julien Cornebise
Wed Sep 17, 2003 11:44 pm
Forum: Other words
Topic: Rejudged probs, how do we know that?
Replies: 12
Views: 2362

Everything ? Wow ... you'll have to run. I've been living here for 20 years, and I'm still discovering secrets everyday (I love Paris ! :D ) Welcome, so !

Go to advanced search