OJ Board

Hi, there, a tip for you: operators should be evaluated from right to left, but brackets should be evaluated from left to right.

Cheers.

Hi, there, just so you know this is a classic DP problem, the Change-making problem. You can find the solution for unlimited coins in the YT (YouTube), for the limited case, I recommend taking the most coins possible for each value. And you will need a prune strategy, since the amount of change grow ...

shanto86, maybe a little bit late. Try this:
Input:

A1W S50N E
TURN HALF LEFT
STOP
END

My AC program output:

A0E S50N NE

Your output:

Illegal stopping place

You may need to verify further the command read, say something like GO 12ss, GO STRAIGHT -1, TURN LEFT SHARP, TURN RIGHT xxxx ...

Is this case allowed? What's the AC program output?
Thanks for replies.


A4W S1N SW
TURN RIGHT
TURN HALF RIGHT
TURN SHARP RIGHT
GO STRAIGHT 41
GO -32
PW
TURN RIGHT
TURN RIGHT
GO STRAIGHT 21
TURN HALF LEFT
TURN SHARP LEFT
GO ON 47
TURN HALF LEFT
OPPEKEOBWFGFXRYISILEIMFGUFRZZZDWVO
TURN SHARP ...

yiuyuho wrote: Fri Jan 17, 2003 12:37 am Will there be events that lieing over several days? Or will there be events of the same name? If so, do we need to output both of the event?

What's the output to:
1980
A 3 1 7 1-3-7
A 2 1 7 1-3-7
D 1 1
#


????????

From my AC code:

Hi, there, my tip for you if you are suffering is to generate all dates in the range of the problem or at least one year with leap day and one year without it for all priorities in all days and then look in the generated answer for errors. And the correct order is DAY / PRIORITY / INPUT ORDER (for ...

Hi, there, some tips for you:

1) Once you have a code that you think it is working, write a program to generate all possible dates between the range specified and check for negative numbers or zero.

2) Check for leap days, days between months and between years.

3) As said before, the first day in ...

Could anyone tell me why that x & y only have to count to 20??


Because of the limited range of the problem (0.nn), you will be able to test all cases once you have a solution, and after 20 steps the algorithm just do updates to the sight of the trees but adds no new tree. It seems that to get ...

Hi, there, some tips for you.

1) Precision matters, I've used 1e-9

2) Don't compute the angle, use cos, sin or tan.

3) Use your own PI, I've used #define PI 3.14159265358979323846264338327

4) You should not only consider trees that are too small and gaps that are too small, but beyond that ...

Hi, there, some tips for you if you suffered with this problem.

1) You must consider lines and points too besides triangles.

2) Pay attention to PRECISION of your floating-point variables, 1e-9 is enough.

3) Try at first solving the problem through brute force and when you are able, only then ...

Hi, some tips for you.

1) Do not assume the 8 nodes will be the 8 first letters of the alphabet.

2) Strip spaces from the line (A: B; C : D => A:B;C:D).

3) There may be repeating neighbors like A:BB.

4) Beware of Maximal Cliques (you should think of a way to avoid them and gain some speed up).

Hi, some tips for you. There are several methods to approach this problem, but I recommend:

1) Implement a method for triangulation. Some triangles will belong to the intersection and some to the union (you'll need a way to find out which ones are in one or the other).

2) Implement a method for ...

Hi, some tips for you:

1) This is a non-linear diophantine equation, a Pell's equation, there is many methods to solve this kind of equation. Search one, implement it and enjoy. (There is not a general method for non-linear diophantine equations.)

I recommend reading B. Sury's paper: http://www ...

If you are stuck in this problem some tips for you:

1) DO NOT TRY BRUTE FORCE testing for rectangles or creating all of them, O(nˆ4) and O(nˆ3) is too much for this algorithm.

2) Look into projective spaces (study about them a little if you need, lot of videos in YouTube). The FANO plane is a ...

Just some tips for you:

1) The center of mass is not always inside the object nor even the convex hull.

2) It really does help plotting all problems that deal with geometry using maybe an on-line tool (or some library)
https://www.math10.com/en/geometry/geog ... gebra.html