OJ Board

txandi

Instead of factoring, just try to think the inverse problem... If you know sopf, can you calculate sopf[j] where j is a multiple of i?

txandi

Hi! Some critical I/O:

Input:
5

9
3
2 00:10:99
1 00:11:00
4 00:10:99
5 00:10:99
6 00:10:99
7 00:10:99
8 00:10:99
9 00:10:99

10
3
2 00:10:00
1 00:10:00
4 00:10:00
5 00:10:00
6 00:10:00
7 00:10:00
8 00:10:00
9 00:11:00
10 00:11:00

10
1
2 00:10:00
3 00:10:00
4 00:10:00
5 00:10:00
6 00:10:00
7 00 ...

txandi

Output from my AC program:
There are 0 odd non-prime numbers between 3 and 3.
There are no failures in base 3.

There are 0 odd non-prime numbers between 89 and 89.
There are no failures in base 3.

There are 0 odd non-prime numbers between 89 and 89.
There are no failures in base 2.

There are ...

txandi

My AC program outputs:

Code: Select all

Case 1: 399
Case 2: 337
Case 3: 337
Case 4: 9
Case 5: 9
Case 6: 9
Case 7: 9
Case 8: 9

Good luck!

txandi

I've also been trying the same icpc problem, and I only get TLE (lots of TLE's :cry: ). If sb find a fast algorithm please email me at txandi@gmail.com.

What I'm doing now is:
1) Fill all "sure" blanks (the ones that can only be filled with a number)
2) Sort the blanks I have to fill. The first one ...

txandi

This could help:

http://irl.eecs.umich.edu/jamin/courses ... ture22.pdf

txandi

http://www.comp.nus.edu.sg/~stevenha/pr ... acmoj.html

You can also find interesting:

http://www.felix-halim.net
http://shygypsy.com/acm/
http://www.algorithmist.com

txandi

You can simplify your formula:

Code: Select all

dist = acos( sin(rad1) * sin(rad3) +
       cos(rad1) * cos(rad3) * cos(rad2) * cos(rad4) +
       cos(rad1) * cos(rad3) * sin(rad2) * sin(rad4) ) * r;

txandi

I forgot to drop the first one. AC now. Thanks!!!

txandi

I can't understand the sample I/O. Perhaps I've misunderstood the problem.
In the first case (5 5 1 50 50 4 0 2), for example I think the output should be 9 6 6 4 and not 8 7 6 4 because:
X = paintball

00000 00000 00000 00000 00000 00000 00000 00000 0000X
00000 00000 00000 00000 00000 0000X 0000X ...

txandi

The next buoy to visit is determined by the closest buoy in the mission that has not yet been visited. In case of a tie, the buoy information that comes first in the input is given preference.
It means that when you're in a place A, the next place B to visit must be the not already visited one ...

txandi

I got AC now. The input above this is ok.
My (silly) mistake:

There is one line after each map, ignore them.
I assumed this line was empty, but I was wrong, it was full of garbage... I shoud have thought about this before wasting a lot of time debugging a correct program... In my opinion these ...

txandi

Can anybody check this I/O??? I keep getting WA and I don't know why.

20
5 14
##############
#@ 1 3 1@#
#@#2# # #
#213 @13 @3#
##############

9 9
#########
# 3 #
# 3 @ #
#21 1@ #
#3 3#
# 2 # @#
# # #
## 3 2 #
#########

11 13
#############
# 2 2@ # #
#2 3@ 1 @@ 2#
# 2 @2 #
#3 2 @ # 3 #
## 2# 2 ...

txandi

Need Help!!!
I've summited it lots of times, but still WA :cry:
My algorithm is simple, I save in a table (table [j][k]) the best way to reach "j", starting from "i" with "k" iterations.

What's wrong?? Is it precission??

My code

[cpp]#include <iostream>
#include <vector>

#define EPS 0.0000001 ...

txandi

OJ Board

Search found 25 matches

10873 - Splat, Inc.

10274 - Fans and Gems (Need I/O verification)

104 - WA