OJ Board

I think the only trick of this problem is to calculate angle. except 0, 90, 180, 270 degree angle, you can use the formula: a = atan2( fabs( y-cordinate ), fabs( x-cordinate ) ) * ( 45 / atan( 1.0 ) ); And, in 1st quadrant angle is just a. in 2nd quadrant angle is 180 - a in 3rd quadrant angle is 18...

Hello, Carlos

New machine is cool. I feel it much faster than before.

Where can we understand the details of new machine??

I can see the precision in time is to 0.002 ms.

Thanks.

This problem can be solved by shortest path algorithms. Did you use A* search?? I have no idea to use Dijkstra to solve this problem. Because it may be 2 or above paths from one node to the other. Finally I use backtracking and got AC. I think it is easy to use backtracking to solve this problem wi...

What's the correct output for the case below? AZ B # Here we are sure that A comes before B, but we can't say anything about Z. The problem description does not explain this case. EDIT: just read the problem description again and I it seems that there'll be no case like the one above: "Not all lett...

my AC code uses these sizes: max row: 999 max column: 999 formula length: 1000 formula divide into cells: 1000 formula queue size(it means how many cells are formula): 8000 cell number length: 8 it means nothing to calculate the threshold of sizes, and these sizes are enough to help you get AC. Hope...

some info about Problem 195 1.there is no blank between characters in the word. 2.the length about 100 characters is enough 3.alphabet order is A -> a -> B -> b -> C -> c ..... -> Y -> y -> Z -> z 4.Problem 146 is similar with Problem 195, but test cases in Problem 146 are weak, and some wrong algor...

If u dont use backtracking to solve this problem, maybe u got WA. try this test case. input 1 12 11 1 2 3 1 4 1 5 1 6 1 7 1 8 2 9 2 10 2 11 2 12 2 output 10 3 4 5 6 7 8 9 10 11 12 the graph like 3 4 5 8 9 10 \ | / \ | / 1 ---------- 2 / | \ / \ 6 7 8 11 12 And in judge test cases, every vertex has e...

I give a super critical input and output, some codes are from Jan, thanks. input program test; VAR ch:array['a' .. 'z']of Char; BEGIN{Ignore 'like a string'} (* Comments can be splitted over several lines and all the operators like + - * / should be ignored *)Temp:=2; WRITELN ('''', TEMP.FIRST <= TE...

I got 0.780 AC in 185 - Roman Numerals. first part to calculate roman sum is easy . I have a problem in arabit sum part. I do all permutation and fill arabit number into roman digits, and judge if the sum is equal to each other. if count == 0 -> impossible if count == 1 -> valid if count == 2 -> amb...

some input and output: input: 1234567890 1 1234567890 2 1234567890 3 1234567890 4 1234567890 5 1234567890 6 1234567890 7 1234567890 8 1234567890 9 1234567890 10 0000000000 0 output: 100000000 24567890 0 0 0 0 0 0 0 0 20000000 20000000 14567890 10000000 10000000 10000000 10000000 10000000 10000000 10...

I give 2 hints. the first hint: If n is not multiple of k you can add any the same character after plaintext and cyphertext, like: k = 5 "abcdabcd" "bcdabcda" after add '?' "abcdabcd??" "bcdabcda??" then you can check k = 5 the second hint: If one string is "abcdeee" it has possible 3! permutation. ...

Hi all, I can't understand the problem description,

TS QC 8S 8D is also form one pair of 8

before the next card - QH
why should not cover the 8S??

I am confused and need help, thanks.

the hint is
Hope is helps.

test cases 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 0 answer Case 1: -1 Case 2: 1 2 4 Case 3: 1 3 2 5 Case 4: -1 Case 5: -1 Case 6: 1 4 5 3 7 2 8 Case 7: 1 5 4 6 3 8 2 9 Case 8: -1 Case 9: -1 Case 10: 1...

test cases answer hope it helps.