OJ Board

2036.90

2016.50

2024.43

1786.77

2035.76

2031.91

2047.72

1926.92

2017.60

2037.43

2009.28

2053.14

1976.60

2035.57

2040.49

2016.83

2016.51

1074.64

2033.82

2017.17

1991.99

2019.20

1953.64

2039.43

2050.24

2042.80

2031.43

2023.13

2015.69

1964.63

2043.51

2040.67

1912.34 ...

I get the same answers as above, which makes me believe that my algo is correct in principle, but I fail to get accepted :(
Can it be that rounding errors creap in? There is no special judge, but the range of the input values is not specified, so it can be anything in principle. On the other hand ...

I've created multiple solutions for this, but still WA.

The problem I think lies in the definition of "ENGLISH".

My definition is:

#define ISENGLISH(a) ( ( (a) >= '0' && (a) <= '9' ) || ( (a) >= 'a' && (a) <= 'z' ) || ( (a) >= 'A' && (a) <= 'Z' ) || (a) == ' ' || (a) == '\n' || (a) == '\r' )


ie ...

Hi,

I doubt your solution to the case when the first string = second string. I sent a code that yields for the test case

abc

abc abc

an answer

abc

So I guess this case doesn't exist.

Also, does anybody know how to do this in C++? I tried to use sets/maps which supposingly uses binary ...

I managed to come up with a solution that gives the correct answers to my test data, but WA from the judge.

I believe the problem lies in my code to find the four corners of each rectangle. Right now, the formula I use is:

angle_phi is the given angle in radians

angle_a = atan2( width, height ...

I used backtracking with pruning and got a pretty decent time, so it shouild be fine.

If you have a small floating point error which occurs RANDOMLY, it probably means that your equations are not precise enough. Try to optimize your equations by removing the functions that reduce the precision.

For example, in C++, the following functions are relatively imprecise, so try to avoid ...

I used brute force checking and my time was 0:00.563s so that should be enough... I don't think there's any other creative way of solving this (eg: DP, etc.) since this question is NP-complete.

I think the best way of solving this is to work out a few examples by hand and then try to find an ...

in case you don't realise.. there are:

2 types of triangles
3 types of parralleogram
1 type of hexagon

I used exhaustive search and my timing was 0.00s so it should be good enough...

anyway, if I'm not wrong, this problem is NP-complete and cannot be solved in polynomial time.. so exhaustive search is more or less the only way to go.

the difference between TLE and AC is that you have to order your ...

Greetings!.
What's the Math way to do this problem?.
I work with Pascal, and I made it adding and testing, but it takes so much time (even with (a+b)*(b-a+1)/2 will take too long).
What formulas can be used?.
Thanks in advance.

I think the maths formula is already posted somewhere on this forum ...

I just wrote an algorithm for the ugly numbers problem. Running my prog is probably going to take several hours although I already tried to optimize my code slightly. How do these people in the ranking list achieve times like 0.00.000? Do they just submit codes like:

#include <stdio.h>
void main ...

My Answer:

Your input:
1
4 5
1 2
2 3
3 4
1 4
2 4

My output:
2
1 3

Is correct??


Draw out the graph.. do a manual trace.. as far as I can tell from your snippet of code, there can exist a case where:
(using the above graph)
You start from node 1, go to 2, go to 3, go to 4. Since 4 is ...

NightZ-1 wrote:This example a fully connected graph:

Input :

1
5 10
1 2
1 3
1 4
1 5
2 3
2 4
2 5
3 4
3 5
4 5

Possible output's

1
1

1
2

1
3

1
4

1
5

My output:

1
5

It's correct... I'm crazy with this problem...

Try this:
Answer is 2.

I got TLE at first too (it's unfortunate that time limit is now 10 second instead of the previous 30 second). I just got AC using 0.5 second by the stack approach. Basically just start at the end of the string, and whenever you see one of the C, D, E, or I, check if stack has at least 2 correct ...