Search found 167 matches

by Ivan Golubev
Sun Feb 02, 2003 12:04 pm
Forum: Volume 1 (100-199)
Topic: 111 - History Grading
Replies: 135
Views: 21917

epsilon0 wrote:give up, the judge is wrong.

just look at the second input test in the problem. it's wrong.
Everything is OK! Just read carefully description, the information under exclamation sign and search this board before posting such things.

http://acm.uva.es/board/viewtopic.php?t=524
by Ivan Golubev
Thu Jan 30, 2003 10:12 am
Forum: Volume 6 (600-699)
Topic: 697 - Jack and Jill
Replies: 21
Views: 6437

Your output looks OK, so I don't know why you haven't got AC...

What's you're using for PI value? In my solution I've used pi = acos(-1).
by Ivan Golubev
Thu Jan 30, 2003 10:11 am
Forum: Volume 1 (100-199)
Topic: 110 - Meta-Loopless Sorts
Replies: 92
Views: 7654

Re: #110 WA Why? I'm going to be mad!

chinaluoqi wrote:I have read all the threads about this problem, and havenot found the bug in my program.
All threads? Really? So why you aren't handle multiple input properly?
by Ivan Golubev
Thu Jan 30, 2003 10:10 am
Forum: General
Topic: SECURITY FLAW IN ONLINE JUDGE
Replies: 34
Views: 8485

Actually TLE is a worst choice -- better to use assert(), division by zero, invalid memory reference, MLE, OLE. So it's possible to get more than one bit of information from one submission. However, most judge's inputs are large, so this won't work. But looks like earlier somebody tried this method ...
by Ivan Golubev
Wed Jan 29, 2003 5:30 pm
Forum: Volume 6 (600-699)
Topic: 697 - Jack and Jill
Replies: 21
Views: 6437

Here is output for your input from my accepted program: Scenario 1: up hill 1.00 sec well diameter 1.00 in water level 1.00 in bucket volume 1.00 cu ft bucket ascent rate 1.00 in/sec down hill 1.00 sec required volume 1.00 cu ft TIME REQUIRED 3.07 sec Scenario 2: up hill 1.00 sec well diameter 1.00 ...
by Ivan Golubev
Wed Jan 15, 2003 11:27 am
Forum: Volume 6 (600-699)
Topic: 684 - Integral Determinant
Replies: 16
Views: 6602

OK, I'll try to describe my algorithm. Main idea -- to leave coefficients only in main diagonal and to zero upper triangle (sorry, don't know how this triangle must be named correctly). So, for given matrix above bottom-right part of the matrix after calculations will be: 0.00 0.00 0.00 0.00 0.00 0....
by Ivan Golubev
Tue Jan 14, 2003 9:18 pm
Forum: Volume 6 (600-699)
Topic: 684 - Integral Determinant
Replies: 16
Views: 6602

Caesum, (a stupid question but sometimes it happens) do you print asterisk after last line of output?
by Ivan Golubev
Tue Jan 14, 2003 9:12 pm
Forum: Volume 6 (600-699)
Topic: 676 - Horse Step Maze
Replies: 21
Views: 11628

Re: 676 Horse Step Maze

Caesum wrote:2. Anyone seen sigxfsz before ?
Yes, I've got this error two times when solving (actually speeding up) P495. But I have no idea what it means. I've asked one man from OJ team about this SIGXFSZ but he's also wasn't able to say what this error means! :-?
by Ivan Golubev
Tue Jan 14, 2003 10:59 am
Forum: Volume 6 (600-699)
Topic: 684 - Integral Determinant
Replies: 16
Views: 6602

It's a bit hard to create correct IO for this problem (without final 2^31 overflow), so only one small test: Input: 30 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
by Ivan Golubev
Mon Jan 13, 2003 10:40 pm
Forum: Volume 6 (600-699)
Topic: 684 - Integral Determinant
Replies: 16
Views: 6602

I've got accepted with floating point and actually I think that it's very hard to get precision error with floating point calculations in this problem!
by Ivan Golubev
Tue Dec 24, 2002 1:56 pm
Forum: Volume 101 (10100-10199)
Topic: 10188 - Automated Judge Script
Replies: 58
Views: 30643

I think that input reading routine is a most important part in this problem. Once you've read everything correct, everything else is trivial. In my accepted solution this part looks like:[c] while (gets(s) != NULL) { n1 = atol(s); if (n1 == 0) break; p1 = (char *)malloc(128 * n1); for (i=0; i<n1; i+...
by Ivan Golubev
Sun Dec 22, 2002 1:14 am
Forum: Volume 6 (600-699)
Topic: 602 - What Day Is It?
Replies: 56
Views: 22094

OK, more I/O. Input: 2 28 0 2 29 0 1 1 1 9 10 2500 5 5 999 7 3 8888 2 27 1000 2 28 1000 2 29 1000 2 30 1000 3 1 1000 2 27 1400 2 28 1400 2 29 1400 2 30 1400 3 1 1400 2 27 1800 2 28 1800 2 29 1800 2 30 1800 3 1 1800 2 27 2000 2 28 2000 2 29 2000 2 30 2000 3 1 2000 2 27 2100 2 28 2100 2 29 2100 2 30 2...
by Ivan Golubev
Sun Dec 22, 2002 1:02 am
Forum: Volume 1 (100-199)
Topic: 197 - Cube
Replies: 20
Views: 2466

Yes, I've firstly wrote that output must be sorted (because I forget about correction program) but then I've corrected this -- output need not to be sorted. About speed-up -- you need to calculate all possible assemblies only once. So, short algorithm: 1. Fix part 'a' to translation only and generat...
by Ivan Golubev
Thu Dec 19, 2002 7:26 pm
Forum: Volume 6 (600-699)
Topic: 602 - What Day Is It?
Replies: 56
Views: 22094

Output: January 1, 0 is a Thursday January 1, 1 is a Saturday March 1, 401 is a Friday March 1, 801 is a Monday February 29, 1000 is a Thursday March 1, 1000 is a Friday 9/3/1752 is an invalid date. 9/13/1752 is an invalid date. Do the days September 3rd 1752 until September 13th 1752 ever exist in ...
by Ivan Golubev
Thu Dec 19, 2002 5:55 pm
Forum: Volume 1 (100-199)
Topic: 116 - Unidirectional TSP
Replies: 226
Views: 35826

Second one (yeah, in this problem "lexicography" means "select lowest number").

Go to advanced search